Stochastic Contention Resolution With Short Delays (English)
- New search for: Raghavan, Prabhakar
- New search for: Raghavan, Prabhakar
- New search for: Upfal, Eli
In:
SIAM journal on computing
;
28
, 2
; 709-719
;
1999
-
ISSN:
- Article (Journal) / Print
-
Title:Stochastic Contention Resolution With Short Delays
-
Contributors:Raghavan, Prabhakar ( author ) / Upfal, Eli
-
Published in:SIAM journal on computing ; 28, 2 ; 709-719
-
Publisher:
- New search for: SIAM
-
Place of publication:Philadelphia, Pa.
-
Publication date:1999
-
ISSN:
-
ZDBID:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 54.71 / 54.10 / 54.51
- Further information on Basic classification
- New search for: 770/3155
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 28, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 383
-
A Downward Collapse within the Polynomial HierarchyHemaspaandra, Edith et al. | 1999
- 394
-
Genericity, Randomness, and Polynomial-Time ApproximationsWang, Yongge et al. | 1999
- 409
-
Universal Limit Laws for Depths in Random TreesDevroye, Luc et al. | 1999
- 433
-
Average-Case Lower Bounds for Noisy Boolean Decision TreesEvans, William et al. | 1999
- 447
-
Competitive Algorithms for Layered Graph TraversalFiat, Amos et al. | 1999
- 463
-
On Multirate Rearrangeable Clos NetworksDu, D.Z. et al. | 1999
- 471
-
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear TimeChin, Francis et al. | 1999
- 487
-
Reconstructing Algebraic Functions from Mixed DataAr, Sigal et al. | 1999
- 511
-
Optimal Broadcast with Partial KnowledgeAwerbuch, Baruch et al. | 1999
- 525
-
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer ProgramsRajagopalan, Sridhar et al. | 1999
- 541
-
Optimal Construction of Edge-Disjoint Paths in Random GraphsBroder, Andrei Z. et al. | 1999
- 574
-
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic HelpsIvkovic, Zoran et al. | 1999
- 612
-
Dynamic Trees and Dynamic Point LocationGoodrich, Michael T. et al. | 1999
- 637
-
Query OrderHemaspaandra, Lane A. et al. | 1999
- 652
-
Finding the k Shortest PathsEppstein, David et al. | 1999
- 674
-
Exact Learning of Discretized Geometric ConceptsBshouty, Nader H. et al. | 1999
- 700
-
Fast Exponentiation Using Data CompressionYacobi, Yacov et al. | 1999
- 704
-
A Polynomial Time Complexity Bound for Computations on CurvesWalsh, P.G. et al. | 1999
- 709
-
Stochastic Contention Resolution With Short DelaysRaghavan, Prabhakar et al. | 1999
- 720
-
Asymptotically Optimal Election on Weighted RingsHigham, Lisa et al. | 1999
- 733
-
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel AlgorithmsGibbons, Phillip B. et al. | 1999