Combinatorics, Probability & Computing, Volume 13, 2004

Volume 13, Number 1, January 2004

• Magnus Bordewich:
  Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs. 1-16
  
• Ehud Friedgut:
  Influences in Product Spaces: KKL and BKKKL Revisited. 17-29
  
• Hans Garmo, Svante Janson, Michal Karonski:
  On Generalized Random Railways. 31-35
  
• André E. Kézdy, Hunter S. Snevily:
  Polynomials that Vanish on Distinct nth Roots of Unity. 37-59
  
• Yoshiharu Kohayakawa, Vojtech Rödl, Mathias Schacht:
  The Turán Theorem for Random Graphs. 61-91
  
• Daniela Kühn, Deryk Osthus:
  Large Topological Cliques in Graphs Without a 4-Cycle. 93-102
  
• Robert Parviainen:
  Random Assignment with Integer Costs. 103-113
  
• Béla Bollobás:
  How Sharp is the Concentration of the Chromatic Number? 115-117
  
• Imre Leader:
  Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp. 119-121
  
• Alexander D. Scott:
  Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp. 122
  

Volume 13, Number 2, March 2004

• Anders Dessmark, Andrzej Pelc:
  Distributed Colouring and Communication in Rings with Local Knowledge. 123-136
  
• David Galvin, Jeff Kahn:
  On Phase Transition in the Hard-Core Model on Math. 137-164
  
• Stefanie Gerke, Colin McDiarmid:
  On the Number of Edges in Random Planar Graphs. 165-183
  
• Alexander V. Gnedin:
  Three Sampling Formulas. 185-193
  
• J. Robert Johnson:
  A Disproof of the Fon-der-Flaass Conjecture. 195-201
  
• Micha Sharir, Emo Welzl:
  Point-Line Incidences in Space. 203-220
  
• Alan D. Sokal:
  Chromatic Roots are Dense in the Whole Complex Plane. 221-261
  
• József Solymosi:
  A Note on a Question of Erdos and Graham. 263-267
  
• Lorenzo Traldi:
  A Subset Expansion of the Coloured Tutte Polynomial. 269-275
  
• Béla Bollobás, Imre Leader:
  Isoperimetric Problems for r-sets. 277-279
  
• Imre Bárány:
  Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp. 280-282
  

Volume 13, Number 3, May 2004

• Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
  Distinct Distances in Three and Higher Dimensions. 283-293
  
• Geoffrey Atkinson, Alan M. Frieze:
  On the b-Independence Number of Sparse Random Graphs. 295-309
  
• Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
  Longest Paths in Circular Arc Graphs. 311-317
  
• Colin Cooper, Alan M. Frieze:
  The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. 319-337
  
• Steven N. Evans:
  Embedding a Markov Chain into a Random Walk on a Permutation Group. 339-351
  
• Don R. Hush, Clint Scovel:
  Fat-Shattering of Affine Functions. 353-360
  
• Daniela Kühn, Deryk Osthus:
  Subdivisions of K_r+2 in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. 361-371
  
• Gregory L. McColm:
  Threshold Functions for Random Graphs on a Line Segment. 373-387
  
• Shakhar Smorodinsky, Micha Sharir:
  Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. 389-411
  
• Andrew Thomason:
  Two Minor Problems. 412
  

Volume 13, Number 4-5, Juli 2004

• Michael Drmota, Wojciech Szpankowski:
  Special Issue on Analysis of Algorithms. 415-417
  
• Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
  Quicksort with Unreliable Comparisons: A Probabilistic Analysis. 419-449
  
• Béla Bollobás, Alex D. Scott:
  Max Cut for Random Graphs with a Planted Partition. 451-474
  

• Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger:
  And/Or Trees Revisited. 475-497
  
• Benoit Daireaux, Brigitte Vallée:
  Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm. 499-536
  
• Olivier Dubois, Guy Louchard, Jacques Mandler:
  Additive Decompositions, Random Allocations, and Threshold Phenomena. 537-575
  
• Philippe Duchon, Philippe Flajolet, Guy Louchard, Gilles Schaeffer:
  Boltzmann Samplers for the Random Generation of Combinatorial Structures. 577-625
  
• Predrag R. Jelenkovic, Ana Radovanovic:
  Optimizing LRU Caching for Variable Document Sizes. 627-643
  
• Olgica Milenkovic, Kevin J. Compton:
  Probabilistic Transforms for Combinatorial Urn Models. 645-675
  
• Kate Morris, Alois Panholzer, Helmut Prodinger:
  On Some Parameters in Heap Ordered Trees. 677-696
  
• Michel Nguyen The:
  Area and Inertial Moment of Dyck Paths. 697-716
  
• Alois Panholzer:
  Distribution of the Steiner Distance in Generalized M-ary Search Trees. 717-733
  
• Robin Pemantle, Mark C. Wilson:
  Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety. 735-761
  
• Werner Schachinger:
  Concentration of Size and Path Length of Tries. 763-793
  

Volume 13, Number 6, November 2004

• Noga Alon, Uri Stav:
  New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. 795-807
  
• Feng Ming Dong, Khee Meng Koh:
  Two Results on Real Zeros of Chromatic Polynomials. 809-813
  
• Péter Gács:
  Compatible Sequences and a Slow Winkler Percolation. 815-856
  
• Penny E. Haxell:
  On the Strong Chromatic Number. 857-865
  
• Luke Pebody:
  The Reconstructibility of Finite Abelian Groups. 867-892
  
• Raphael Yuster:
  Families of Trees Decompose the Random Graph in an Arbitrary Way. 893-910
  

• Yonatan Bilu, Nathan Linial:
  Ramanujan Signing of Regular Graphs. 911-912
  

• Anton Bovier:
  Spin Glasses: A Challenge for Mathematicians - Cavity and Mean Field Models, cby Michel Talagrand. 913-915
  
• Lars Holst:
  Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. 916-917
  

Last update Wed May 22 17:24:54 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page