Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 25
Volume 25, Number 1, January 2016
- Noga Alon, Rani Hod
, Amit Weinstein:
On Active and Passive Testing. 1-20 - Béla Bollobás, Oliver Riordan:
Counting Connected Hypergraphs via the Probabilistic Method. 21-75 - Dennis Clemens, Heidi Gebauer, Anita Liebenau:
The Random Graph Intuition for the Tournament Game. 76-88 - Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer:
On the Length of a Random Minimum Spanning Tree. 89-107 - Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl, Wojciech Samotij:
On the Number of Bh -Sets. 108-129 - Rajko Nenadov, Angelika Steger:
A Short Proof of the Random Ramsey Theorem. 130-144 - János Pach, Bartosz Walczak:
Decomposition of Multiple Packings with Subquadratic Union Complexity. 145-153 - Oliver Riordan, Lutz Warnke:
Convergence of Achlioptas Processes via Differential Equations with Unique Solutions. 154-171
Volume 25, Number 2, March 2016
- József Balogh, Jane Butterfield, Ping Hu, John Lenz, Dhruv Mubayi:
On the Chromatic Thresholds of Hypergraphs. 172-212 - Demetres Christofides, Daniel Král':
First-Order Convergence and Roots. 213-221 - Thibault Espinasse, Nadine Guillotin-Plantard, Philippe Nadeau:
A Combinatorial Approach to a Model of Constrained Random Walkers. 222-235 - Boris G. Pittel, Gregory B. Sorkin:
The Satisfiability Threshold for k-XORSAT. 236-268 - Lutz Warnke:
On the Method of Typical Bounded Differences. 269-299 - Bruce A. Reed, David R. Wood:
Forcing a sparse minor. 300-322
- Bruce A. Reed, David R. Wood:
'Forcing a sparse minor' - CORRIGENDUM. 323
Volume 25, Number 3, May 2016
- Richard Arratia, Stephen Desalvo:
Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example. 324-351 - Jean-Bernard Baillon, Roberto Cominetti, José Vaisman:
A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials. 352-361 - Andrew Beveridge:
A Hitting Time Formula for the Discrete Green's Function. 362-379 - Boris Bukh:
An Improvement of the Beck-Fiala Theorem. 380-398 - Tom Eccles:
A Stability Result for the Union-Closed Size Problem. 399-418 - Weidong Gao, David J. Grynkiewicz, Xingwu Xia:
On n-Sums in an Abelian Group. 419-435 - Justin Salez:
The Interpolation Method for Random Graphs with Prescribed Degrees. 436-447 - David Saxton, Andrew Thomason:
Simple Containers for Simple Hypergraphs. 448-459 - George Shakan:
Sum of Many Dilates. 460-469 - Marko Thiel:
The Inversion Number and the Major Index are Asymptotically Jointly Normally Distributed on Words. 470-483
- Tim Austin:
Quantitative Equidistribution for Certain Quadruples in Quasi-Random Groups: Erratum. 484-485
Volume 25, Number 4, July 2016
- Petter Brändén, Madeleine Leander, Mirkó Visontai:
Multivariate Eulerian Polynomials and Exclusion Processes. 486-499 - Andreas Galanis, Daniel Stefankovic, Eric Vigoda:
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. 500-559 - Dan Hefetz, Mykhaylo Tyomkyn:
Universality of Graphs with Few Triangles and Anti-Triangles. 560-576 - Mark Huber:
Nearly Optimal Bernoulli Factories for Linear Functions. 577-591 - Alexandr V. Kostochka, Jaroslav Nesetril:
Adding Edges to Increase the Chromatic Number of a Graph. 592-594 - John Lenz, Dhruv Mubayi:
Perfect Packings in Quasirandom Hypergraphs II. 595-611 - Shoham Letzter:
Path Ramsey Number for Random Graphs. 612-622 - Micha Sharir, József Solymosi:
Distinct Distances from Three Points. 623-632 - Hunter Spink:
Local Maxima of Quadratic Boolean Functions. 633-640
Volume 25, Number 5, September 2016
- Béla Bajnok:
Comments on Y. O. Hamidoune's Paper 'Adding Distinct Congruence Classes'. 641-644 - Jacob D. Baron, Jeff Kahn:
Tuza's Conjecture is Asymptotically Tight for Dense Graphs. 645-667 - Alexis Darrasse, Hsien-Kuei Hwang, Michèle Soria:
Shape Measures of Random Increasing k-trees. 668-699 - Daniel Glasscock:
Marstrand-type Theorems for the Counting and Mass Dimensions in ℤ. 700-743 - Mark Holmes, Thomas S. Salisbury:
Forward Clusters for Degenerate Random Environments. 744-765 - Peter Keevash, Eoin Long:
On the Normalized Shannon Capacity of a Union. 766-767 - Bojan Mohar:
Median Eigenvalues of Bipartite Subcubic Graphs. 768-790 - Dhruv Mubayi:
Improved Bounds for the Ramsey Number of Tight Cycles Versus Cliques. 791-796
Volume 25, Number 6, November 2016
- Tonci Antunovic, Elchanan Mossel, Miklós Z. Rácz:
Coexistence in Preferential Attachment Networks. 797-822 - Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak:
Manipulative Waiters with Probabilistic Intuition. 823-849 - Dennis Clemens, Yury Person:
Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs. 850-869 - Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs. 870-908 - Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. 909-927 - Gábor V. Nagy, Vilmos Totik:
A Convexity Property of Discrete Random Walks. 928-940 - János Pach, Natan Rubin, Gábor Tardos:
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves. 941-958
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
