Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
J. H. Spencer - MaRDI portal

J. H. Spencer

From MaRDI portal
(Redirected from Person:168594)
Person:590239

Available identifiers

zbMath Open spencer.joel-hDBLPs/JoelHSpencerWikidataQ1691718 ScholiaQ1691718MaRDI QIDQ590239

List of research outcomes





PublicationDate of PublicationType
Erdős magic2024-10-02Paper
Ronald Lewis Graham (1935–2020)2022-02-15Paper
On‐line balancing of random inputs2021-01-05Paper
Ronald Louis Graham (1935 ‐ 2020)2020-11-30Paper
https://portal.mardi4nfdi.de/entity/Q51336472020-11-10Paper
Preferential attachment when stable2019-12-09Paper
Deterministic Random Walks2019-09-16Paper
Existential monadic second order logic on random rooted trees2018-11-13Paper
First Order Probabilities for Galton–Watson Trees2018-02-26Paper
On the Length of a Random Minimum Spanning Tree2017-10-04Paper
Galton-Watson probability contraction2017-03-21Paper
Reflections on Paul Erdős on His Birth Centenary2016-06-15Paper
Bounded quantifier depth spectra for random graphs2016-04-08Paper
https://portal.mardi4nfdi.de/entity/Q27989992016-04-07Paper
Heat diffusion with frozen boundary2015-12-03Paper
On the spectra of first-order language properties for random graphs2015-11-12Paper
Erratum to “The Bohman‐Frieze process near criticality”2015-07-23Paper
Deterministic discrepancy minimization2015-03-23Paper
Queuing with future information2014-09-25Paper
https://portal.mardi4nfdi.de/entity/Q51702692014-07-23Paper
https://portal.mardi4nfdi.de/entity/Q54176802014-05-22Paper
The Bohman-Frieze process near criticality2013-10-09Paper
Phase transitions for modified Erdős--Rényi processes2012-12-06Paper
Explosive Percolation in Random Networks2011-11-30Paper
Deterministic Discrepancy Minimization2011-09-16Paper
Potpourri2011-06-27Paper
LIAR!2011-03-18Paper
Proppian random walks in \(\mathbb Z\)2011-02-18Paper
https://portal.mardi4nfdi.de/entity/Q30782162011-02-18Paper
https://portal.mardi4nfdi.de/entity/Q30635342011-01-03Paper
Eighty Years of RamseyR(3, k)…and Counting!2010-12-20Paper
The second largest component in the supercritical 2D Hamming graph2010-11-10Paper
Deterministic random walks on regular trees2010-11-10Paper
https://portal.mardi4nfdi.de/entity/Q57479452010-09-14Paper
https://portal.mardi4nfdi.de/entity/Q35794952010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35766542010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35766632010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35754222010-07-27Paper
Complexity and effective prediction2010-05-25Paper
Dynamics of Stochastic Neuronal Networks and the Connections to Random Graph Theory2010-04-09Paper
The elementary proof of the prime number theorem2009-09-25Paper
The Maturation of the Probabilistic Method2009-02-12Paper
Birth control for giants2008-10-21Paper
https://portal.mardi4nfdi.de/entity/Q35034332008-06-05Paper
Deterministic Random Walks on Regular Trees2008-06-05Paper
The complexity of random ordered structures2008-03-28Paper
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution2008-01-18Paper
Deterministic random walks on the integers2007-11-21Paper
Decomposable graphs and definitions with no quantifier alternation2007-11-21Paper
First-Order Definability of Trees and Sparse Random Graphs2007-05-15Paper
Simulating a Random Walk with Constant Error2007-02-07Paper
Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube2007-01-08Paper
Counting connected graphs asymptotically2006-11-15Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
The liar game over an arbitrary channel2006-10-05Paper
The Two-Batch Liar Game over an Arbitrary Channel2006-06-01Paper
Connectivity Transitions in Networks with Super-Linear Preferential Attachment2006-05-09Paper
Succinct definitions in the first order theory of graphs2006-04-28Paper
Random subgraphs of finite graphs. II: The lace expansion and the triangle condition2005-11-14Paper
Discrepancy games2005-11-01Paper
Avoiding defeat in a balls-in-bins process with feedback2005-10-30Paper
Random subgraphs of finite graphs: I. The scaling window under the triangle condition2005-09-22Paper
How complex are random graphs in first order logic?2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46575962005-03-14Paper
Finite model theory and its applications.2005-01-12Paper
A halfliar's game2004-10-27Paper
A scaling result for explosive processes2004-10-13Paper
https://portal.mardi4nfdi.de/entity/Q30443082004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44100242004-02-12Paper
Branching processes with negative offspring distributions2003-08-14Paper
The halflie problem.2003-07-30Paper
Random dyadic tilings of the unit square2003-03-19Paper
Crossing numbers of random graphs2003-03-19Paper
A useful elementary correlation inequality. II2003-02-19Paper
Counting dyadic equipartitions of the unit square2002-12-02Paper
Combinatorics by Coin Flipping2002-10-17Paper
The degree sequence of a scale-free random graph process2002-05-13Paper
Packing random rectangles2002-05-02Paper
https://portal.mardi4nfdi.de/entity/Q27843262002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q44100192002-01-01Paper
The tenacity of zero-one laws2001-10-16Paper
https://portal.mardi4nfdi.de/entity/Q45245922001-10-02Paper
The strange logic of random graphs2001-07-30Paper
New bounds on crossing numbers2001-06-28Paper
Ups and downs of first order sentences on random graphs2001-04-01Paper
Packing Ferrers Shapes2001-02-12Paper
https://portal.mardi4nfdi.de/entity/Q42253142001-02-05Paper
The birth of the infinite cluster: Finite-size scaling in percolation2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45083862000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42634862000-02-16Paper
Random unary predicates: Almost sure theories and countable models1999-12-19Paper
Uniformly distributed distances -- a geometric application of Janson's inequality1999-12-08Paper
https://portal.mardi4nfdi.de/entity/Q47047971999-11-25Paper
An asymptotic isoperimetric inequality1999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q42211861999-01-03Paper
https://portal.mardi4nfdi.de/entity/Q43813841998-04-01Paper
Real time asymptotic packing1998-02-15Paper
Nearly perfect matchings in regular simple hypergraphs1997-09-17Paper
Enumerating graphs and Brownian motion1997-07-27Paper
Asymptotically optimal covering designs1997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q47182011997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q48790991997-06-03Paper
https://portal.mardi4nfdi.de/entity/Q27855651997-02-25Paper
Discrepancy in arithmetic progressions1997-01-28Paper
https://portal.mardi4nfdi.de/entity/Q48717811997-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43593091997-01-01Paper
Sudden emergence of a giant \(k\)-core in a random graph1996-10-14Paper
Asymptotic packing via a branching process1996-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48662511996-04-18Paper
https://portal.mardi4nfdi.de/entity/Q48452621996-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48660871996-03-04Paper
https://portal.mardi4nfdi.de/entity/Q48413121995-11-14Paper
Coloring Random and Semi-Random k-Colorable Graphs1995-09-17Paper
Covering with Latin transversals1995-07-11Paper
https://portal.mardi4nfdi.de/entity/Q46974541995-05-28Paper
https://portal.mardi4nfdi.de/entity/Q47633871995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43263891995-03-19Paper
Random sparse unary predicates1995-03-05Paper
From Erdős to algorithms1995-02-13Paper
Randomization, derandomization and antirandomization: Three games1995-01-31Paper
https://portal.mardi4nfdi.de/entity/Q31423981994-07-24Paper
https://portal.mardi4nfdi.de/entity/Q42846291994-07-19Paper
Three Thresholds for a Liar1994-05-05Paper
Can you feel the double jump?1994-04-24Paper
https://portal.mardi4nfdi.de/entity/Q31372161993-11-01Paper
Zero-one laws with variable probability1993-08-17Paper
Clique coverings of the edges of a random graph1993-08-16Paper
https://portal.mardi4nfdi.de/entity/Q40040781992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q39970751992-09-17Paper
Ulam's searching game with a fixed number of lies1992-06-28Paper
Probabilistic construction of proportional graphs1992-06-28Paper
Nonconvergence in the theory of random orders1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39727611992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39749701992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39750131992-06-26Paper
When Does the Zero-One Law Hold?1992-06-26Paper
Set systems with no union of cardinality 0 modulo \(m\)1992-06-25Paper
Threshold functions for extension statements1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39721381992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39723121992-06-25Paper
Countable sparse random graphs1992-06-25Paper
Extremal subgraphs of random graphs1992-06-25Paper
Lopsided Lovász Local lemma and Latin transversals1991-01-01Paper
Threshold spectra via the Ehrenfeucht game1991-01-01Paper
Infinite spectra in the first order theory of graphs1990-01-01Paper
Note on vertex-partitions of infinite graphs1990-01-01Paper
Counting extensions1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746741990-01-01Paper
Asymptotic behavior of the chromatic index for hypergraphs1989-01-01Paper
Ascending waves1989-01-01Paper
Coloring the projective plane1989-01-01Paper
A useful elementary correlation inequality1989-01-01Paper
Monochromatic sumsets1989-01-01Paper
Erratum: ``Three hundred million points suffice1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010651989-01-01Paper
Explicit codes with low covering radius1989-01-01Paper
How to make a graph bipartite1988-01-01Paper
Three hundred million points suffice1988-01-01Paper
Zero-One Laws for Sparse Random Graphs1988-01-01Paper
Cutting a graph into two dissimilar halves1988-01-01Paper
Tournament Ranking with Expected Profit in Polynomial Time1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326061988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34817431987-01-01Paper
Balancing vectors in the max norm1986-01-01Paper
On a method for random graphs1986-01-01Paper
Discrepancy of set-systems and matrices1986-01-01Paper
Functions that never agree1986-01-01Paper
Extremal subgraphs for two graphs1985-01-01Paper
Asymptotically good coverings1985-01-01Paper
Probabilistic methods1985-01-01Paper
Six Standard Deviations Suffice1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187531985-01-01Paper
Unit distances1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51862781984-01-01Paper
Well-distributed 2-colorings of integers relative to long arithmetic progressions1984-01-01Paper
Guess a Number-with Lying1984-01-01Paper
Integral approximation sequences1984-01-01Paper
Balancing matrices with line shifts1983-01-01Paper
What's not inside a Cayley graph1983-01-01Paper
Canonical configurations1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33122681983-01-01Paper
Large Numbers and Unprovable Theorems1983-01-01Paper
Ramsey theory and Ramsey theoreticians1983-01-01Paper
Extremal uncrowded hypergraphs1982-01-01Paper
On Graphs Which Contain All Sparse Graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39676131982-01-01Paper
Coloring n-sets red and blue1981-01-01Paper
Discrete ham sandwich theorems1981-01-01Paper
Suresums1981-01-01Paper
Extremal problems, partition theorems, symmetric hypergraphs1981-01-01Paper
Balancing unit vectors1981-01-01Paper
Coping with errors in binary search procedures1980-01-01Paper
Optimally ranking unrankable tournaments1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030021980-01-01Paper
Counting Magic Squares1980-01-01Paper
All finite configurations are almost Ramsey1979-01-01Paper
Evolution of the \(n\)-cube1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128371979-01-01Paper
Ramsey's Theorem for Spaces1979-01-01Paper
A General Ramsey Product Theorem1979-01-01Paper
Edge disjoint placement of graphs1978-01-01Paper
Asymptotic lower bounds for Ramsey functions1978-01-01Paper
Balancing families of sets1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41934611978-01-01Paper
Balancing games1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41326261977-01-01Paper
Intersection Theorems for Systems of Sets1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41633081977-01-01Paper
The Number of Semigroups of Order n1976-01-01Paper
Maximal asymmetry of graphs1976-01-01Paper
Ramsey's theorem - a new lower bound1975-01-01Paper
Restricted Ramsey configurations1975-01-01Paper
Factorizing the complete graph into factors with large star number1975-01-01Paper
Ramsey Theorems for Multiple Copies of Graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717511975-01-01Paper
Optimal Doubling in Backgammon1975-01-01Paper
Random regular tournaments1974-01-01Paper
Puncture sets1974-01-01Paper
A Generalized Rota Conjecture for Partitions1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655481974-01-01Paper
Euclidean Ramsey theorems. I1973-01-01Paper
Families of \(k\)-independent sets1973-01-01Paper
A Deception Game1973-01-01Paper
Turan's theorem for \(k\)-graphs1972-01-01Paper
A Remark on Coloring Integers1972-01-01Paper
Minimal scrambling sets of simple orders1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595401972-01-01Paper
Imbalances in k‐colorations1972-01-01Paper
Directed graphs as unions of partial orders1971-01-01Paper
A characterization of clique graphs1971-01-01Paper
A Constructive Solution to a Tournament Problem1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56167201971-01-01Paper
Minimization of ±1 matrices under line shifts1971-01-01Paper
Optimal ranking of tournaments1971-01-01Paper
On cliques in graphs1971-01-01Paper
Minimal completely separating systems1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56109381970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56567991970-01-01Paper
Maximal consistent families of triples1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55413811966-01-01Paper

Research outcomes over time

This page was built for person: J. H. Spencer