| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fan Chung |
Quasi-random hypergraphs revisited.  |
Random Struct. Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Horn, Mary Radcliffe |
Giant components in Kronecker graphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
Packing tight Hamilton cycles in 3-uniform hypergraphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Galligo, Laurent Miclo |
On the cut-off phenomenon for the transitivity of randomly generated subgroups. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger |
The fraction of large random trees representing a given Boolean function in implicational logic. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob van den Berg, Bernardo N. B. de Lima, Pierre Nolin |
A percolation process on the square lattice where large finite clusters are frozen. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabetta Candellero, Lorenz A. Gilch |
Phase transitions for random walk asymptotics on free products of groups. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht |
Weak quasi-randomness for uniform hypergraphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The quasi-randomness of hypergraph cut properties. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Gabizon, Ronen Shaltiel |
Increasing the output length of zero-error dispersers. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Wolfovitz |
A concentration result with application to subgraph count. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Banaszczyk |
On series of signed vectors and their rearrangements. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Dellamonica Jr. |
The size-Ramsey number of trees. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilan Gronau, Shlomo Moran, Sagi Snir |
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry A. Shabanov |
Random coloring method in the combinatorial problem of Erdős and Lovász. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fiachra Knox, Daniela Kühn, Deryk Osthus |
Approximate Hamilton decompositions of random graphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shirshendu Chatterjee, Rick Durrett |
Persistence of activity in threshold contact processes, an "Annealed approximation" of random Boolean networks. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrien Joseph |
A phase transition for the heights of a fragmentation tree. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Marckert, Grégory Miermont |
The CRT is the scaling limit of unordered binary trees. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
On covering by translates of a set. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Dekel, James R. Lee, Nathan Linial |
Eigenvectors of random graphs: Nodal Domains. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Béla Csaba, Wojciech Samotij |
Local resilience of almost spanning trees in random graphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov |
Ramsey games with giants. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Peled, Ariel Yadin, Amir Yehudayoff |
The maximal probability that k-wise independent bits are all 1. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihyun Kang, Colin McDiarmid |
Random unlabelled graphs containing few disjoint cycles. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik |
Smoothed analysis of balancing networks. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew D. Barbour, Gesine Reinert |
The shortest distance in random multi-type intersection graphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Oliver Riordan |
Duality in inhomogeneous random graphs, and the cut metric. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Mahdian, Ying Xu 0002 |
Stochastic kronecker graphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash |
A hypergraph blow-up lemma. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald |
Regular induced subgraphs of a random Graph. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Alexandr V. Kostochka |
Hypergraph list coloring and Euclidean Ramsey theory. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Pawel Pralat |
Scale-free graphs of increasing degree. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Vu |
Singular vectors under random perturbation. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Linh V. Tran |
Piercing random boxes. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze |
The cover time of random geometric graphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Latuszynski, Ioannis Kosmidis, Omiros Papaspiliopoulos, Gareth O. Roberts |
Simulating events of unknown probabilities via reverse time martingales. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Gács |
Clairvoyant scheduling of random walks. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Erick Alm, Svante Janson, Svante Linusson |
Correlations for paths in random orientations of G(n, p) and G(n, m). |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham Flaxman, David Gamarnik, Gregory B. Sorkin |
First-passage percolation on a ladder graph, and the path cost in a VCG auction. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Dependent random choice. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu |
Nonrepetitive list colourings of paths. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
Sparse random graphs with clustering. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres |
Anatomy of a young giant component in the random graph. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aicke Hinrichs, Jan Vybíral |
Johnson-Lindenstrauss lemma for circulant matrices. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pietro Caputo, Fabio Martinelli, Fabio Lucio Toninelli |
Convergence to equilibrium of biased plane Partitions. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Wolfovitz |
Triangle-free subgraphs in the triangle-free process. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna Rybarczyk |
Equivalence of a random intersection graph and G(n, p). |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Oliver Riordan |
Sparse graphs: Metrics and random models. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky |
A new perspective on implementation by voting trees. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Czygrinow, Brendan Nagle |
On random sampling in uniform hypergraphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Phong Châu, Louis DeBiasio, Hal A. Kierstead |
Pósa's conjecture for graphs of order at least 2 × 108. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Devroye, Svante Janson |
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi |
On the solution-space geometry of random constraint satisfaction problems. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Biskup |
Graph diameter in long-range percolation. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Salvy |
In Memoriam: Philippe Flajolet The Father of Analytic Combinatorics. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Jane Butterfield |
Excluding induced subgraphs: Critical graphs. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wesley Pegden |
Highly nonrepetitive sequences: Winning strategies from the local lemma. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elia Liitiäinen, Amaury Lendasse, Francesco Corona |
A boundary corrected expansion of the moments of nearest neighbor distributions. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Cilleruelo, Sándor Z. Kiss, Imre Z. Ruzsa, Carlos Vinuesa |
Generalization of a theorem of Erdos and Rényi on Sidon sequences. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nati Linial, Doron Puder |
Word maps and spectra of random graph lifts. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Reto Spöhel, Angelika Steger |
Offline thresholds for Ramsey-type games on random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey R. Grimmett, Svante Janson |
Random graphs with forbidden vertex degrees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Asymptotic equivalence and contiguity of some random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Valiant, Tim Roughgarden |
Braess's Paradox in large random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Remco van der Hofstad, Malwina J. Luczak, Joel Spencer |
The second largest component in the supercritical 2D Hamming graph. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Bordenave, Marc Lelarge |
Resolvent of large random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel Spencer |
Phase transitions for random structures and algorithms. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Dombry, Christian Mazza |
Some remarks on Betti numbers of random polygon spaces. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Brightwell, Nicholas Georgiou |
Continuum limits for classical sequential growth models. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Fleming, Nicholas Pippenger |
Large deviations and moments for the Euler characteristic of a random surface. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Richthammer |
Percolation of arbitrary words in one dimension. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Shapira, Raphael Yuster |
The effect of induced subgraphs on quasi-randomness. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters |
Random majority percolation. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shankar Bhamidi, Ram Rajagopal, Sébastien Roch |
Network delay inference from additive metrics. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Borgs, Jennifer T. Chayes, Ayalvadi Ganesh, Amin Saberi |
How to distribute antidote to control epidemics. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Capalbo |
Explicit sparse almost-universal graphs for G(n, k/n). |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuri Bakhtin |
Thermodynamic limit for large random trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Mark Jerrum, Marek Karpinski |
The mixing time of Glauber dynamics for coloring regular trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul N. Balister, Béla Bollobás |
Bond percolation with attenuation in high dimensional Voronoi tilings. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Elek |
Parameter testing in bounded degree graphs of subexponential growth. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Aldous, Shankar Bhamidi |
Edge flows in the complete random-lengths network. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piet Van Mieghem |
Weight of a link in a shortest path tree and the Dedekind Eta function. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatyana S. Turova, Thomas Vallier |
Merging percolation on Zd and classical random graphs: Phase transition. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Bertoin, Vladas Sidoravicius, Maria Eulalia Vares |
A system of grabbing particles related to Galton-Watson trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang |
The order of the giant component of random hypergraphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Kahn, M. Neiman |
Negative correlation and log-concavity. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor Petrov, Anatoly Vershik |
Uncountable graphs and invariant measures on the set of universal countable graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Austin, Terence Tao |
Testability and repair of hereditary hypergraph properties. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Dhruv Mubayi |
Coloring H-free hypergraphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Terence Tao, Van H. Vu |
A sharp inverse Littlewood-Offord theorem. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Alan M. Frieze |
Randomly coloring random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong |
An approximation algorithm for counting contingency tables. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Eyal Lubetzky, Benny Sudakov |
Hamiltonicity thresholds in Achlioptas processes. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehud Friedgut, Vojtech Rödl, Mathias Schacht |
Ramsey properties of random discrete structures. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Nachmias, Yuval Peres |
Critical percolation on random regular graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer |
Deterministic random walks on regular trees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Luczak, Pawel Pralat |
Chasing robbers on random graphs: Zigzag theorem. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Omer Giménez, Marc Noy |
Vertices of given degree in series-parallel graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshiya Itoh, Osamu Watanabe |
Weighted random popular matchings. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")