Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 2, 1993
Volume 2, 1993
- Peter J. Cameron
, Cleide Martins:
A Theorem on Reconstruction of Random Graphs. 1-9 - John Gates:
Some Dual Problems of Geometric Probability in the Plane. 11-23 - Roland Häggkvist:
Hamilton Cycles in Oriented Graphs. 25-32 - Joseph P. S. Kung:
Sign-Coherent Identities for Characteristic Polynomials of Matroids. 33-51 - Boris G. Pittel:
On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. 53-92 - D. H. Smith:
Optimally Reliable Graphs for Both Vertex and Edge Failures. 93-100 - Martin Aigner, Eberhard Triesch:
Reconstructing a Graph from its Neighborhood Lists. 103-113 - Sven Erick Alm:
Upper Bounds for the Connective Constant of Self-Avoiding Walks. 115-136 - Noga Alon, Raphael Yuster:
Threshold Functions for H-factors. 137-144 - Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond:
The Distribution of Heights of Binary Trees and Other Simple Trees. 145-156 - William M. Y. Goh, Eric Schmutz:
Random Matrices and Brownian Motion. 157-180 - Gregory F. Lawler:
A Discrete Analogue of a Theorem of Makarov. 181-199 - Nguyen Van Ngoc, Zsolt Tuza:
Linear-Time Algorithms for the Max Cut Problem. 201-210 - Rudolf Ahlswede, Ning Cai:
On Extremal Set Partitions in Cartesian Product Spaces. 211-220 - Vitaly Bergelson, Neil Hindman:
Additive and Multiplicative Ramsey Theorems in N-Some Elementary Results. 221-241 - Norman L. Biggs:
Potential Thory on Distance-Regular Graphs. 243-255 - Peter J. Cameron, William M. Kantor:
Random Permutations: Some Group-Theoretic Aspects. 257-262 - Guantao Chen, Richard H. Schelp:
Ramsey Problems With Bounded Degree Spread. 263-269 - Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani:
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. 271-284 - Jennie C. Hansen:
Factorization in Fq(x) and Brownian Motion. 285-299 - Salvatore Ingrassia:
Geometric Approaches to the Estimaton of the Spectral Gap of Reversible Marcov Chains. 301-323 - Bill Jackson:
A Zero-Free Interval for Chromatic Polynomials of Graphs. 325-336 - Miro Kraetzl, Charles J. Colbourn:
Threshold Channel Graphs. 337-349 - James F. Lynch:
Threshold Functions for Markov Chains: a Graph Theoretic Approach. 351-362 - Colin McDiarmid:
A Random Recolouring Method for Graphs and Hypergrams. 363-365 - Safwan Akkari, James G. Oxley:
Some LOcal Extremal Connectivity Results for Matroids. 367-384 - Martin Anthony, John Shawe-Taylor:
Using the Perceptron Algorithm to Find Consistent Hypotheses. 385-387 - Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Ramsey Size Linear Graphs. 389-399 - Paul Erdös, Endre Makai, János Pach:
Nearly Equal Distances in the Plane. 401-408 - Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein:
Clique Partitions of Chordal Graphs. 409-415 - Rudolf Halin:
Minimization Problems for Infinite n-Connected graphs. 417-436 - Neil Hindman, Imre Leader:
Image Partition Regularity of Matrices. 437-463 - Christoph Hundack, Hans Jürgen Prömel, Angelika Steger:
Extremal Graph Problems for Graphs with a Color-Critical Vertex. 465-477 - Guoping Jin:
Triangle-Free Graphs with High Minimal Degrees. 479-490 - Nathan Linial:
Local-Global Phenomena in Graphs. 491-503 - Tomasz Luczak, László Pyber:
On Random Generation of the Symmetic Group. 505-512 - Alexander A. Razborov, Endre Szemerédi, Avi Wigderson:
Constructing Small Sets that are Uniform in Arithmetic Progressions. 513-518 - Dirk Vertigan, Geoff Whittle:
Recognizing Polymatroids Associated with Hypergraphs. 519-530
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-05-10 18:47 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:
