Probabilistic methods for algorithmic discrete mathematics
From MaRDI portal
Publication:1270418
zbMath0898.00019MaRDI QIDQ1270418
No author found.
Publication date: 21 October 1998
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
05-06: Proceedings, conferences, collections, etc. pertaining to combinatorics
60-06: Proceedings, conferences, collections, etc. pertaining to probability theory
00B15: Collections of articles of miscellaneous specific interest
68-06: Proceedings, conferences, collections, etc. pertaining to computer science
Related Items
Unnamed Item, Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”., An improved upper bound on the density of universal random graphs, Window-Games between TCP Flows, On dynamic monopolies of graphs with general thresholds, Soft memberships for spectral clustering, with application to permeable language distinction, Window-games between TCP flows, Curve reconstruction from noisy samples, Faster rumor spreading with multiple calls, RIPless compressed sensing from anisotropic measurements, Average case recovery analysis of tomographic compressive sensing, Semi-supervised statistical region refinement for color image segmentation, Broadcast in the rendezvous model, Approximation schemes for scheduling and covering on unrelated machines, Radiocoloring in planar graphs: Complexity and approximations, A novel giant-subgraph phase-transition in sparse random \(k\)-partite graphs, Critical window for the vacant set left by random walk on random regular graphs, Packing tight Hamilton cycles in 3-uniform hypergraphs, Packing hamilton cycles in random and pseudo-random hypergraphs, ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS
