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 (22)
Publication types (Num. hits)
article(1339)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1339 publication records. Showing 1339 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1 Issue information. 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
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
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
1Colin McDiarmid, Nikola Yolov Random perfect 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
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
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
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
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
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
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
1 Issue information. 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
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
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
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
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
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
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
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
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
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
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
1Benedikt Stufler Gibbs partitions: The convergent case. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov Monochromatic cycle covers in random 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
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
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
1Béla Bollobás, Oliver Riordan Counting dense connected hypergraphs via the probabilistic method. 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
1Nemanja Skoric, Angelika Steger, Milos Trujic Local resilience of an almost spanning k-cycle in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pawel Hitczenko, Amanda Lohss Probabilistic consequences of some polynomial recurrences. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato Arboricity and spanning-tree packing in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chen Avin, Michal Koucký, Zvi Lotker Cover time and mixing time of random walks on dynamic graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Wesley Pegden Online purchasing under uncertainty. 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
1Srikanth K. Iyer The random connection model: Connectivity, edge lengths, and degree distributions. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Gamarnik, Quan Li On the max-cut of sparse random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandra Caraceni, Nicolas Curien Geometry of the uniform infinite half-planar quadrangulation. 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
1Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga Dispersion processes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Agnes 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
1 Issue information. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandro Arlotto, Yehua Wei, Xinchang Xie An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. 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
1 Issue information. 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
1Mikhail Isaev, Brendan D. McKay Complex martingales and asymptotic enumeration. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Louigi Addario-Berry, Laura Eslava High degrees in random recursive trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jacob van den Berg, Stein Andreas Bethuelsen Stochastic domination in space-time for the contact process. 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
1Dmitry Panchenko On the K-sat model with large number of clauses. 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
1Carl Johan Casselgren Coloring graphs of various maximum degree from random lists. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ronen Eldan, Mohit Singh Efficient algorithms for discrepancy minimization in convex sets. 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
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
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
1Brendan Nagle, Vojtech Rödl, Mathias Schacht An algorithmic hypergraph regularity lemma. 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
1Pu Gao, Michael Molloy Inside the clustering window for random linear equations. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthew Kwan, Benny Sudakov Intercalates and discrepancy in random Latin squares. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Van Vu Packing perfect matchings in random hypergraphs. 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
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
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
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
1Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan Line percolation. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Richard Mycroft, Tássio Naia Unavoidable trees in tournaments. 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
1Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov The random k-matching-free process. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeong Han Kim, Sang June Lee, Joohan Na On the total variation distance between the binomial random graph and the random intersection graph. 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
1Frederik Garbe, Richard Mycroft, Andrew McDowell Contagious sets in a degree-proportional bootstrap percolation process. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Boris Pittel Counting strongly connected (k1, k2)-directed cores. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oliver Cooley, Mihyun Kang, Christoph Koch 0006 The size of the giant high-order component in random hypergraphs. 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
1Nicolas Broutin, Cécile Mailler And/or trees: A local limit point of view. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Rajko Nenadov Spanning universality in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ronen Eldan, Miklós Z. Rácz, Tselil Schramm Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Sébastien Bubeck, Luc Devroye, Gábor Lugosi Finding Adam in random growing trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Colin McDiarmid, Alex Scott, Paul Withers Uniform multicommodity flows in the hypercube with random edge-capacities. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Wesley Pegden Separating subadditive euclidean functionals. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira Constructing near spanning trees with few local inspections. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christopher Hoffman, Douglas Rizzolo, Erik Slivken Pattern-avoiding permutations and Brownian excursion part I: Shapes and fluctuations. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ningyuan Chen, Nelly Litvak, Mariana Olvera-Cravioto Generalized PageRank on directed configuration networks. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Graf Self-destructive percolation as a limit of forest-fire models on regular rooted trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Roee David, Elazar Goldenberg, Robert Krauthgamer Local reconstruction of low-rank matrices and subspaces. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gabriel Berzunza The cut-tree of large trees with small heights. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira 0003 Finding paths in sparse random graphs requires many queries. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dániel Korándi, Benny Sudakov Saturation in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Lander Ramos, Juanjo Rué Subgraph statistics in subcritical graph classes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Henry Towsner σ-algebras for quasirandom hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres Competing first passage percolation on random regular graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris 0001 Chromatic thresholds in sparse random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Abbas Mehrabian Justifying the small-world phenomenon via random recursive trees. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christian Borgs, Jennifer T. Chayes, David Gamarnik Convergent sequences of sparse graphs: A large deviations approach. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts Acyclic edge colourings of graphs with large girth. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1339 (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