IP over connection-oriented networks and distributional paging
Lund, C.; Phillips, S.; Reingold, N.
Page(s): 424-434
Digital Object Identifier 10.1109/SFCS.1994.365674 Abstract
| Full Text: PDF (760 KB)
Rights and Permissions
On-line admission control and circuit routing for high performance
computing and communication
Awerbuch, B.; Gawlick, R.; Leighton, T.; Rabani, Y.
Page(s): 412-423
Digital Object Identifier 10.1109/SFCS.1994.365675 Abstract
| Full Text: PDF (916 KB)
Rights and Permissions
A theory of competitive analysis for distributed algorithms
Ajtai, M.; Aspnes, J.; Dwork, C.; Waarts, O.
Page(s): 401-411
Digital Object Identifier 10.1109/SFCS.1994.365676 Abstract
| Full Text: PDF (904 KB)
Rights and Permissions
Beyond competitive analysis [on-line algorithms]
Koutsoupias, E.; Papadimitriou, C.H.
Page(s): 394-400
Digital Object Identifier 10.1109/SFCS.1994.365677 Abstract
| Full Text: PDF (528 KB)
Rights and Permissions
Program result-checking: a theory of testing meets a test of theory
Blum, M.; Wasserman, H.
Page(s): 382-392
Digital Object Identifier 10.1109/SFCS.1994.365678 Abstract
| Full Text: PDF (840 KB)
Rights and Permissions
Fast and feasible periodic sorting networks of constant depth
Kutylowski, M.; Lorys, K.; Oesterdiekhoff, B.; Wanka, R.
Page(s): 369-380
Digital Object Identifier 10.1109/SFCS.1994.365679 Abstract
| Full Text: PDF (956 KB)
Rights and Permissions
Scheduling multithreaded computations by work stealing
Blumofe, R.D.; Leiserson, C.E.
Page(s): 356-368
Digital Object Identifier 10.1109/SFCS.1994.365680 Abstract
| Full Text: PDF (1140 KB)
Rights and Permissions
Nearly tight bounds for wormhole routing
Ranade, A.; Schleimer, S.; Wilkerson, D.S.
Page(s): 347-355
Digital Object Identifier 10.1109/SFCS.1994.365681 Abstract
| Full Text: PDF (676 KB)
Rights and Permissions
On the design of reliable Boolean circuits that contain partially
unreliable gates
Kleitman, D.; Leighton, T.; Ma, Y.
Page(s): 332-346
Digital Object Identifier 10.1109/SFCS.1994.365682 Abstract
| Full Text: PDF (1108 KB)
Rights and Permissions
Products and help bits in decision trees
Nisan, N.; Rudich, S.; Saks, M.
Page(s): 318-329
Digital Object Identifier 10.1109/SFCS.1994.365683 Abstract
| Full Text: PDF (880 KB)
Rights and Permissions
Efficient oblivious branching programs for threshold functions
Sinha, R.K.; Thathachar, J.S.
Page(s): 309-317
Digital Object Identifier 10.1109/SFCS.1994.365684 Abstract
| Full Text: PDF (556 KB)
Rights and Permissions
A lower bound for the monotone depth of connectivity
Yao, A.C.-C.
Page(s): 302-308
Digital Object Identifier 10.1109/SFCS.1994.365685 Abstract
| Full Text: PDF (384 KB)
Rights and Permissions
On the robustness of functional equations
Rubinfeld, R.
Page(s): 288-299
Digital Object Identifier 10.1109/SFCS.1994.365686 Abstract
| Full Text: PDF (884 KB)
Rights and Permissions
Randomness-efficient oblivious sampling
Bellare, M.; Rompel, J.
Page(s): 276-287
Digital Object Identifier 10.1109/SFCS.1994.365687 Abstract
| Full Text: PDF (784 KB)
Rights and Permissions
Computing with very weak random sources
Srinivasan, A.; Zuckerman, D.
Page(s): 264-275
Digital Object Identifier 10.1109/SFCS.1994.365688 Abstract
| Full Text: PDF (904 KB)
Rights and Permissions
(De)randomized construction of small sample spaces in 𝒩𝒞
Karger, D.R.; Koller, D.
Page(s): 252- 263
Digital Object Identifier 10.1109/SFCS.1994.365689 Abstract
| Full Text: PDF (1032 KB)
Rights and Permissions
Local optimization of global objectives: competitive distributed
deadlock resolution and resource allocation
Awerbuch, B.; Azar, Y.
Page(s): 240-249
Digital Object Identifier 10.1109/SFCS.1994.365690 Abstract
| Full Text: PDF (712 KB)
Rights and Permissions
Fast and lean self-stabilizing asynchronous protocols
Itkis, G.; Levin, L.
Page(s): 226-239
Digital Object Identifier 10.1109/SFCS.1994.365691 Abstract
| Full Text: PDF (1084 KB)
Rights and Permissions
The load, capacity and availability of quorum systems
Naor, M.; Wool, A.
Page(s): 214-225
Digital Object Identifier 10.1109/SFCS.1994.365692 Abstract
| Full Text: PDF (880 KB)
Rights and Permissions
Rapid rumor ramification: approximating the minimum broadcast time
Kosaraju, S.R.; Park, J.K.; Stein, C.
Page(s): 166-177
Digital Object Identifier 10.1109/SFCS.1994.365696 Abstract
| Full Text: PDF (900 KB)
Rights and Permissions
Finding the k shortest paths
Eppstein, D.
Page(s): 154-165
Digital Object Identifier 10.1109/SFCS.1994.365697 Abstract
| Full Text: PDF (904 KB)
Rights and Permissions
Efficient average-case algorithms for the modular group
Jin-Yi Cai; Fuchs, W.H.; Kozen, D.; Zicheng Lui
Page(s): 143-152
Digital Object Identifier 10.1109/SFCS.1994.365698 Abstract
| Full Text: PDF (648 KB)
Rights and Permissions