The Wakeup Problem (English)
- New search for: Fischer, Michael J.
- New search for: Fischer, Michael J.
- New search for: Moran, Shlomo
- New search for: Rudich, Steven
- New search for: Taubenfeld, Gadi
In:
SIAM journal on computing
;
25
, 6
; 1332-1357
;
1996
-
ISSN:
- Article (Journal) / Print
-
Title:The Wakeup Problem
-
Contributors:
-
Published in:SIAM journal on computing ; 25, 6 ; 1332-1357
-
Publisher:
- New search for: SIAM
-
Place of publication:Philadelphia, Pa.
-
Publication date:1996
-
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 25, Issue 6
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.
- 1123
-
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable SetsKummer, Martin et al. | 1996
- 1144
-
An o(n3)-Time Algorithm Maximum-Flow AlgorithmCheriyan, Joseph et al. | 1996
- 1171
-
A Deterministic poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed DimensionsAjtai, Miklos et al. | 1996
- 1196
-
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access MachinesDietzfelbinger, Martin et al. | 1996
- 1231
-
Lower Bounds for Geometrical and Physical ProblemsSellen, Jürgen et al. | 1996
- 1254
-
Average and Randomized Complexity of Distributed ProblemsAllenberg-Navony, Nechama et al. | 1996
- 1268
-
Learning Behaviors of Automata from Multiplicity and Equivalence QueriesBergadano, Francesco et al. | 1996
- 1281
-
Prefix Codes: Equiprobable Words, Unequal Letter CostsGolin, Mordecai J. et al. | 1996
- 1293
-
On Unapproximable Versions of NP-Complete ProblemsZuckerman, David et al. | 1996
- 1305
-
A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthBodlaender, Hans L. et al. | 1996
- 1318
-
An Optimal O(loglogN)-Time Parallel Algorithm for Detecting All Squares in a StringApostolico, Alberto et al. | 1996
- 1332
-
The Wakeup ProblemFischer, Michael J. et al. | 1996
- 1358
-
Erratum: Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel MatricesBini, Dario et al. | 1996
- 1358
-
Fast Parallel Computation of the Polynomial Remainder Sequence via Bezout and Hankel MatricesBini, D. / Gemignani, L. et al. | 1996
- 1361
-
Author Index| 1996