Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 19, 2010
Volume 19, Number 1, January 2010
- Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi
:
The Longest Minimum-Weight Path in a Complete Graph. 1-19 - Paul Balister, Steve Kalikow, Amites Sarkar:
The Linus Sequence. 21-46 - Henning Bruhn, Maya Jakobine Stein:
Duality of Ends. 47-60 - David Gamarnik, David A. Goldberg:
Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections. 61-85 - Ross J. Kang, Colin McDiarmid:
The t-Improper Chromatic Number of Random Graphs. 87-98 - Markus Kuba, Stephan G. Wagner:
Deterministic Edge Weights in Increasing Tree Families. 99-119 - Oleg Pikhurko:
Finding an Unknown Acyclic Orientation of a Given Graph. 121-131 - Lorenzo Traldi:
Weighted Interlace Polynomials. 133-157
Volume 19, Number 2, March 2010
- Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé:
WDM and Directed Star Arboricity. 161-182 - Jan Arpe, Elchanan Mossel:
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. 183-199 - Olivier Bodini, Éric Fusy, Carine Pivoteau:
Random Sampling of Plane Partitions. 201-226 - Amin Coja-Oghlan:
Graph Partitioning via Adaptive Spectral Techniques. 227-284 - Jacob Fox, Peter Keevash, Benny Sudakov:
Directed Graphs Without Short Cycles. 285-301 - Russell Lyons:
Identities and Inequalities for Tree Entropy. 303-313 - Yufei Zhao:
The Number of Independent Sets in a Regular Graph. 315-320
Volume 19, Number 3, May 2010
- Kevin P. Costello, Van H. Vu:
On the Rank of Random Sparse Matrices. 321-342 - Yuanan Diao, Gábor Hetyei:
Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory. 343-369 - Jacob Fox, János Pach:
A Separator Theorem for String Graphs and its Applications. 371-390 - Cecilia Holmgren:
Random Records and Cuttings in Binary Search Trees. 391-424 - Arun P. Mani:
Some Inequalities for Whitney-Tutte Polynomials. 425-439 - Uwe Schwerdtfeger, Christoph Richard, Bhalchandra Thatte:
Area Limit Laws for Symmetry Classes of Staircase Polygons. 441-461 - Ian M. Wanless:
Counting Matchings and Tree-Like Walks in Regular Graphs. 463-480
Volume 19, Number 4, July 2010
- Noga Alon, Dan Hefetz, Michael Krivelevich:
Playing to Retain the Advantage. 481-491 - Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colouring for Hypergraphs. 493-516 - Alexander I. Barvinok:
What Does a Random Contingency Table Look Like? 517-539 - Andrew Beveridge, László Lovász:
Exit Frequency Matrices for Finite Markov Chains. 541-560 - Florian Dennert, Rudolf Grübel:
On the Subtree Size Profile of Binary Search trees. 561-578 - Guoli Ding, Stan Dziobiak:
Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs. 579-591 - Henrik Renlund:
First-Passage Percolation with Exponential Times on a Ladder. 593-601 - Terence Tao:
Sumset and Inverse Sumset Theory for Shannon Entropy. 603-639
Volume 19, Numbers 5-6, November 2010
- Noga Alon, Béla Bollobás:
Introduction. 641 - József Balogh, Béla Bollobás, Robert Morris:
Bootstrap Percolation in High Dimensions. 643-692 - Artur Czumaj, Christian Sohler:
Testing Expansion in Bounded-Degree Graphs. 693-709 - Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers and the Reals. 711-728 - Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Peres:
Diameters in Supercritical Random Graphs Via First Passage Percolation. 729-751 - Jacob Fox, Benny Sudakov:
Decompositions into Subgraphs of Small Diameter. 753-774 - Andreas Goerdt:
On Random Betweenness Constraints. 775-790 - Catherine S. Greenhill, Svante Janson, Andrzej Rucinski:
On the Number of Perfect Matchings in Random Lifts. 791-817 - Tomasz Luczak, Andrew Thomason:
Vicarious Graphs. 819-827 - Yuri V. Matiyasevich:
One More Probabilistic Reformulation of the Four Colour Conjecture. 829-834 - Oliver Riordan, Nicholas C. Wormald:
The Diameter of Sparse Random Graphs. 835-926
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-22 20:03 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:
