2020
On-line balancing of random inputs.
Random Struct. Algorithms, 2020
2019
Existential monadic second order logic on random rooted trees.
Discret. Math., 2019
2018
Preferential Attachment When Stable.
CoRR, 2018
2016
Bounded quantifier depth spectra for random graphs.
Discret. Math., 2016
On the Length of a Random Minimum Spanning Tree.
Comb. Probab. Comput., 2016
2013
Queueing with future information.
SIGMETRICS Perform. Evaluation Rev., 2013
The Bohman-Frieze process near criticality.
Random Struct. Algorithms, 2013
Deterministic Discrepancy Minimization.
Algorithmica, 2013
The Erdős Existence Argument.
Proceedings of the Mathematics of Paul Erdős I, 2013
Proceedings of the Mathematics of Paul Erdős I, 2013
2011
Proppian random walks in Z.
Discret. Math., 2011
2010
Phase transitions for random structures and algorithms.
Random Struct. Algorithms, 2010
The second largest component in the supercritical 2D Hamming graph.
Random Struct. Algorithms, 2010
Complexity and effective prediction.
Games Econ. Behav., 2010
Synchrony and Asynchrony in Neural Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2008
On the Size of Induced Acyclic Subgraphs in Random Digraphs.
Discret. Math. Theor. Comput. Sci., 2008
The Probabilistic Method, Third Edition.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-470-17020-5, 2008
2007
Finite Model Theory and Its Applications
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-68804-4, 2007
Deterministic Random Walks on Regular Trees.
Electron. Notes Discret. Math., 2007
Decomposable graphs and definitions with no quantifier alternation.
Eur. J. Comb., 2007
Deterministic random walks on the integers.
Eur. J. Comb., 2007
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.
Comb. Probab. Comput., 2007
First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007
Birth control for giants.
Comb., 2007
2006
Counting connected graphs asymptotically.
Eur. J. Comb., 2006
Simulating a Random Walk with Constant Error.
Comb. Probab. Comput., 2006
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The <i>n</i>-Cube.
Comb., 2006
Succinct definitions in the first order theory of graphs.
Ann. Pure Appl. Log., 2006
Deterministic Random Walks.
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006
2005
The Two-Batch Liar Game over an Arbitrary Channel.
SIAM J. Discret. Math., 2005
How complex are random graphs in first order logic?
Random Struct. Algorithms, 2005
Random subgraphs of finite graphs: I. The scaling window under the triangle condition.
Random Struct. Algorithms, 2005
Connectivity Transitions in Networks with Super-Linear Preferential Attachment.
Internet Math., 2005
The Complexity of Random Ordered Structures.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005
The Liar Game Over an Arbitrary Channel.
Comb., 2005
2004
Theor. Comput. Sci., 2004
A Scaling Result for Explosive Processes.
Electron. J. Comb., 2004
2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
Crossing numbers of random graphs.
Random Struct. Algorithms, 2002
Random dyadic tilings of the unit square.
Random Struct. Algorithms, 2002
Counting dyadic equipartitions of the unit square.
Discret. Math., 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
On the (non)Universality of the One-Time Pad.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
The degree sequence of a scale-free random graph process.
Random Struct. Algorithms, 2001
The Tenacity of Zero-One Laws.
Electron. J. Comb., 2001
2000
Random Struct. Algorithms, 2000
New Bounds on Crossing Numbers.
Discret. Comput. Geom., 2000
Comb. Probab. Comput., 2000
Ups and Downs of First Order Sentences on Random Graphs.
Comb., 2000
Average-Case Analysis of Retangle Packings.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
The Probabilistic Method, Second Edition
John Wiley, ISBN: 978-0-47172215-1, 2000
1999
Uniform boundedness of critical crossing probabilities implies hyperscaling.
Random Struct. Algorithms, 1999
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality.
Comb., 1999
1998
Random unary predicates: Almost sure theories and countable models.
Random Struct. Algorithms, 1998
A Useful Elementary Correlation Inequality, II.
J. Comb. Theory A, 1998
Random Sparse Bit Strings at the Threshold of Adjacency.
Proceedings of the STACS 98, 1998
1997
Real time asymptotic packing.
Electron. J. Comb., 1997
On the limit values of probabilities for the first order properties of graphs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
Sudden Emergence of a Giant<i>k</i>-Core in a Random Graph.
J. Comb. Theory B, 1996
Asymptotically Optimal Covering Designs.
J. Comb. Theory A, 1996
1995
Asymptotic Packing via a Branching Process.
Random Struct. Algorithms, 1995
Coloring Random and Semi-Random k-Colorable Graphs.
J. Algorithms, 1995
Covering with Latin Transversals.
Discret. Appl. Math., 1995
Smoothness laws for random ordered graphs.
Proceedings of the Logic and Random Structures, 1995
1994
Randomization, Derandomization and Antirandomization: Three Games.
Theor. Comput. Sci., 1994
Random Sparse Unary Predicates.
Random Struct. Algorithms, 1994
Can You Feel the Double Jump?
Random Struct. Algorithms, 1994
From Erdös to algorithms.
Discret. Math., 1994
1993
Zero-One Laws with Variable Probability.
J. Symb. Log., 1993
Clique coverings of the edges of a random graph.
Comb., 1993
1992
Ulam's Searching Game with a Fixed Number of Lies.
Theor. Comput. Sci., 1992
Probabilistic Construction of Proportional Graphs.
Random Struct. Algorithms, 1992
Three Thresholds for a Liar.
Comb. Probab. Comput., 1992
The Probabilistic Method.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992
John Wiley, ISBN: 0-471-53588-5, 1992
1991
Set systems with no union of cardinality 0 modulo<i>m</i>.
Graphs Comb., 1991
Threshold spectra via the Ehrenfeucht game.
Discret. Appl. Math., 1991
Lopsided Lovász Local Lemma and Latin transversals.
Discret. Appl. Math., 1991
1990
Countable Sparse Random Graphs.
Random Struct. Algorithms, 1990
Extremal subgraphs of random graphs.
J. Graph Theory, 1990
Threshold functions for extension statements.
J. Comb. Theory A, 1990
Note on vertex-partitions of infinite graphs.
Discret. Math., 1990
Infinite spectra in the first order theory of graphs.
Comb., 1990
Gaps in Difference Sets, and the Graph of Nearly Equal Distances.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990
1989
Asymptotic behavior of the chromatic index for hypergraphs.
J. Comb. Theory A, 1989
A useful elementary correlation inequality.
J. Comb. Theory A, 1989
Coloring the projective plane.
Discret. Math., 1989
1988
Explicit codes with low covering radius.
IEEE Trans. Inf. Theory, 1988
Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discret. Math., 1988
Cutting a graph into two dissimilar halves.
J. Graph Theory, 1988
Three hundred million points suffice.
J. Comb. Theory A, 1988
How to make a graph bipartite.
J. Comb. Theory B, 1988
The design of a resilient network concentrator.
Proceedings of the Computer Communication Technologies for the 90's, Proceedings of the Ninth International Conference on Computer Communication, Tel Aviv, Israel, October 30, 1988
1987
Sharp concentration of the chromatic number on random graphs G<sub>n, p</sub>.
Comb., 1987
Threshold Spectra for Random Graphs
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
Discrepancy of Set-systems and Matrices.
Eur. J. Comb., 1986
Functions that Never Agree.
Eur. J. Comb., 1986
On a method for random graphs.
Discret. Math., 1986
Balancing vectors in the max norm.
Comb., 1986
1985
Extremal subgraphs for two graphs.
J. Comb. Theory B, 1985
1984
Integral approximation sequences.
Math. Program., 1984
1983
Ramsey theory and Ramsey theoreticians.
J. Graph Theory, 1983
Canonical Configurations.
J. Comb. Theory A, 1983
What's not inside a Cayley graph.
Comb., 1983
Balancing matrices with line shifts.
Comb., 1983
1982
Extremal Uncrowded Hypergraphs.
J. Comb. Theory A, 1982
1981
Coloring n-Sets Red and Blue.
J. Comb. Theory A, 1981
Discrete Ham Sandwich Theorems.
Eur. J. Comb., 1981
Extremal problems, partition theorems, symmetric hypergraphs.
Comb., 1981
1980
Coping with Errors in Binary Search Procedures.
J. Comput. Syst. Sci., 1980
1979
All Finite Configurations are Almost Ramsey.
J. Comb. Theory A, 1979
1978
Edge disjoint placement of graphs.
J. Comb. Theory B, 1978
Balancing Families of Sets.
J. Comb. Theory A, 1978
Coping with Errors in Binary Search Procedures (Preliminary Report)
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978
1977
Asymptotic lower bounds for Ramsey functions.
Discret. Math., 1977
1975
Restricted Ramsey Configurations.
J. Comb. Theory A, 1975
Ramsey's Theorem - A New Lower Bound.
J. Comb. Theory A, 1975
Optimal Doubling in Backgammon.
Oper. Res., 1975
1974
1973
Euclidean Ramsey Theorems I.
J. Comb. Theory A, 1973
Families of k-independent sets.
Discret. Math., 1973
1972
Turán's theorem for k-graphs.
Discret. Math., 1972
1971
Optimal ranking of tournaments.
Networks, 1971
Imbalances in k-colorations.
Networks, 1971
