The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Random Struct. Algorithms"( http://dblp.L3S.de/Venues/Random_Struct._Algorithms )

URL (DBLP): http://dblp.uni-trier.de/db/journals/rsa

Publication years (Num. hits)
1990 (28) 1991 (25) 1992 (31) 1993 (21) 1994 (47) 1995 (58) 1996 (43) 1997 (43) 1998 (45) 1999 (38) 2000 (43) 2001 (46) 2002 (52) 2003 (38) 2004 (47) 2005 (41) 2006 (49) 2007 (48) 2008 (53) 2009 (49) 2010 (43) 2011 (42) 2012 (49) 2013 (43) 2014 (46) 2015 (69) 2016 (67) 2017 (54) 2018 (59) 2019 (77)
Publication types (Num. hits)
article(1394)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1394 publication records. Showing 1394 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ali Pourmiri Balanced allocation on graphs: A random walk approach. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jakub Kwasny, Jakub Przybylo Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jonathan Hermon, Allan Sly, Yumeng Zhang Rapid mixing of hypergraph independent sets. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jacob D. Baron, Jeff Kahn On the cycle space of a random graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Daniel Montealegre, Van Vu Law of the iterated logarithm for random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huck Bennett, Daniel Reichman 0001, Igor Shinkar On percolation and -hardness. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hüseyin Acan, Jeff Kahn Disproof of a packing conjecture of Alon and Spencer. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mark Huber An optimal (ϵ, δ)-randomized approximation scheme for the mean of random variables with bounded relative variance. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthew Coulson, Guillem Perarnau Rainbow matchings in Dirac bipartite graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Prahladh Harsha, Srikanth Srinivasan 0001 On polynomial approximations to AC. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Omer Bobrowski, Gonçalo Oliveira Random Čech complexes on Riemannian manifolds. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eric Blais, Yuichi Yoshida A characterization of constant-sample testable properties. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matas Sileikis, Lutz Warnke A counterexample to the DeMarco-Kahn upper tail conjecture. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander Gnedin, Vadim Gorin Spherically symmetric random permutations. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Xavier Pérez-Giménez, Pawel Pralat, Benjamin Reiniger Perfect matchings and Hamiltonian cycles in the preferential attachment model. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bernardo N. B. de Lima, Leonardo T. Rolla, Daniel Valesin Monotonicity and phase diagram for multirange percolation on oriented trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sigurdur Örn Stefánsson, Benedikt Stufler Geometry of large Boltzmann outerplanar maps. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marek Biskup, Jeffrey Lin Sharp asymptotic for the chemical distance in long-range percolation. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Eoin Long Packing and counting arbitrary Hamilton cycles in random digraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris 0001 Competition in growth and urns. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ariane Carrance Uniform random colored complexes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benedikt Stufler The continuum random tree is the scaling limit of unlabeled unrooted trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill Hypergraph coloring up to condensation. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Emma Yu Jin, Benedikt Stufler Graph limits of random graphs from a subset of connected k-trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wiebke Bedenknecht, Jie Han 0002, Yoshiharu Kohayakawa, Guilherme Oliveira Mota Powers of tight Hamilton cycles in randomly perturbed hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Svante Janson Patterns in random permutations avoiding the pattern 321. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomasz Luczak, Abram Magner, Wojciech Szpankowski Asymmetry and structural information in preferential attachment graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Colin McDiarmid, Dieter Mitsche, Pawel Pralat Clique coloring of binomial random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kevin Leckey On densities for solutions to stochastic fixed point equations. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda Spatial mixing and nonlocal Markov chains. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arvind Ayyer, Svante Linusson Reverse juggling processes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zur Luria, Michael Simkin On the threshold problem for Latin boxes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Francesco Caravenna, Alessandro Garavaglia, Remco van der Hofstad Diameter in ultra-small scale-free random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matija Bucic, Shoham Letzter, Benny Sudakov Monochromatic paths in random tournaments. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anders Martinsson Most edge-orderings of Kn have maximal altitude. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Richard Montgomery 0001 Fractional clique decompositions of dense graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Esther Ezra, Shachar Lovett On the Beck-Fiala conjecture for random set systems. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Victor Falgas-Ravry, Kelly O'Connell, Andrew Uzzell Multicolor containers, extremal entropy, and counting. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olle Häggström, Timo Hirscher Water transport on infinite graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hafsteinn Einarsson, Johannes Lengler, Frank Mousset, Konstantinos Panagiotou, Angelika Steger Bootstrap percolation with inhibition. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shirshendu Ganguly, Fabio Martinelli Upper triangular matrix walk: Cutoff for finitely many columns. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Daniel Stefankovic, Eric Vigoda Swendsen-Wang algorithm on the mean-field Potts model. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel Ahlberg, Maria Deijfen, Svante Janson Competing first passage percolation on random graphs with finite variance degrees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maurits de Graaf, Richard J. Boucherie, Johann L. Hurink, Jan-Kees C. W. van Ommeren An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pawel Pralat, Nicholas C. Wormald Meyniel's conjecture holds for random d-regular graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arès Méroueh, Andrew Thomason List colorings of multipartite hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Remco van der Hofstad, Svante Janson, Malwina J. Luczak Component structure of the configuration model: Barely supercritical case. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alessandro Zocca Tunneling of the hard-core model on finite triangular lattices. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carina Betken, Hanna Döring, Marcel Ortgiese Fluctuations in a general preferential attachment model via Stein's method. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rajko Nenadov, Angelika Steger, Milos Trujic Resilience of perfect matchings and Hamiltonicity in random graph processes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yoshiharu Kohayakawa, Troy Retter, Vojtech Rödl The size Ramsey number of short subdivisions of bounded degree graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler Planar graphs: Random walks and bipartiteness testing. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vance Faber, David G. Harris Edge-coloring linear hypergraphs with medium-sized edges. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Colin McDiarmid, Nikola Yolov Random perfect graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Tony Johansson On the insertion time of random walk cuckoo hashing. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed Notes on growing a tree in a graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christian Táfula An extension of the Erdős-Tetali theorem. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó On the optimality of the uniform random strategy. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Wesley Pegden Traveling in randomly embedded random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anton Bernshteyn The Johansson-Molloy theorem for DP-coloring. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nati Linial, Yuval Peled Enumeration and randomized constructions of hypertrees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Julia Böttcher, Jie Han 0002, Yoshiharu Kohayakawa, Richard Montgomery 0001, Olaf Parczyk, Yury Person Universality for bounded degree spanning trees in randomly perturbed graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jean-François Marckert, Minmin Wang A new combinatorial representation of the additive coalescent. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bhaswar B. Bhattacharya, Sumit Mukherjee Limit theorems for monochromatic stars. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler Testing for forbidden order patterns in an array. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rajko Nenadov, Nemanja Skoric Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Wesley Pegden Minors of a random binary matroid. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elie de Panafieu Analytic combinatorics of connected graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova Testing convexity of figures under the uniform distribution. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ágnes Backhausz, Balázs Szegedy On large-girth regular graphs and random processes on trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David G. Harris, Aravind Srinivasan Improved bounds and algorithms for graph cuts and network reliability. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1J. Barré, Marc Lelarge, Dieter Mitsche On rigidity, orientability, and cores of random graphs with sliders. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul M. B. Vitányi On the average-case complexity of Shellsort. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pu Gao, Michael Molloy The stripping process can be slow: Part I. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohammed Amin Abdullah, Nikolaos Fountoulakis A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lior Gishboliner, Michael Krivelevich, Gal Kronenberg On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cyril Marzouk Scaling limits of random bipartite planar maps with a prescribed degree sequence. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts Extremes of the internal energy of the Potts model on cubic graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tobias Müller 0001, Marc Noy The first order convergence law fails for random perfect graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mathias Schacht, Fabian Schulenburg Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guy Moshkovitz, Asaf Shapira Decomposing a graph into expanding subgraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Wesley Pegden A note on dispersing particles on a line. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wilfried Huss, Lionel Levine, Ecaterina Sava-Huss Interpolating between random walk and rotor walk. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Subhabrata Sen Optimization on sparse random hypergraphs and spin glasses. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Barna Saha, Aravind Srinivasan A new approximation technique for resource-allocation problems. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Matthew Kwan, Benny Sudakov Counting Hamilton cycles in sparse random directed graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Annika Heckel The chromatic number of dense random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Varun Jog, Po-Ling Loh Persistence of centrality in random growing trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nicolas Fraiman, Dieter Mitsche The diameter of inhomogeneous random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Harry Crane, Stephen Desalvo, Sergi Elizalde The probability of avoiding consecutive patterns in the Mallows distribution. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1394 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license