Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Reischuk, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Renaming in an asynchronous environment
H. Attiya
,
A. Bar-Noy
,
D. Dolev
,
D. Peleg
,
R. Reischuk
Journal of the ACM
37
(3), 1990, July, pp. 524-548
Exact time bounds for computing Boolean functions on PRAMs without simultaneous writes
M. Dietzfelbinger
,
M. Kutyƚowski
,
R. Reischuk
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 125-135
Relations between communication complexity classes
B. Halstenberg
,
R. Reischuk
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 19-28
Lower bounds for synchronous networks and the advantage of local information
R. Reischuk
,
M. Koshors
Lecture Notes in Computer Science
312
, 1988, pp. 374-387
Achievable cases in an asynchronous environment
H. Attiya
,
A. Bar-Noy
,
D. Dolev
,
D. Koller
,
D. Peleg
,
R. Reischuk
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 337-346
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions
R. Reischuk
Journal of the ACM
34
(1), 1987, pp. 163-178
Upper and lower time bounds for parallel random access machines without simultaneous writes
S. Cook
,
C. Dwork
,
R. Reischuk
SIAM Journal on Computing
15
(1), 1986, February, pp. 87-97
Coding strings by pairs of strings
F.R.K. Chung
,
R.E. Tarjan
,
W.J. Paul
,
R. Reischuk
SIAM Journal on Algebraic Discrete Methods
6
, 1985, pp. 445-461
Bounds on information exchange for Byzantine agreement
D. Dolev
,
R. Reischuk
Journal of the ACM
32
(1), 1985, pp. 191-204
Probabilistic parallel algorithms for sorting and selection
R. Reischuk
SIAM Journal on Computing
14
(2), 1985, May, pp. 396-409
A new solution for the Byzantine generals problem
R. Reischuk
Information and Control
64
(1-3), 1985, pp. 23-42
On the limits to speed up parallel machines by large hardware and unbounded communication
F. Meyer auf der Heide
,
R. Reischuk
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 56-64
Coding strings by pairs of strings
F.R.K. Chung
,
R.E. Tarjan
,
W.J. Paul
,
R. Reischuk
Technical Report (RJ 3989), 1983
Two nonlinear lower bounds
P. Dúris
,
Z. Galil
,
W. Paul
,
R. Reischuk
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 127-132
``Eventual'' is earlier than ``immediate''
D. Dolev
,
R. Reischuk
,
H.R. Strong
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 196-203
On time versus space. II. (Turing machines)
W. Paul
,
R. Reischuk
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 312-327
A fast probabilistic parallel sorting algorithm
R. Reischuk
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 212-219
On alternation (Turing machines)
W.J. Paul
,
E.J. Prauss
,
R. Reischuk
Acta Informatica
14
(3), 1980, September, pp. 243-255
On alternation II. A graph theoretic approach to determinism versus nondeterminism
W. Paul
,
R. Reischuk
Acta Informatica
14
(4), 1980, October, pp. 391-403
A ``fast implementation'' of a multidimensional storage into a tree storage
R. Reischuk
Lecture Notes in Computer Science
85
, 1980, pp. 531-542
On time versus space II
W.J. Paul
,
R. Reischuk
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 298-306
A graph theoretic approach to determinism versus non-determinism
W.J. Paul
,
R. Reischuk
Lecture Notes in Computer Science
67
, 1979, pp. 222-232
On alternation (preliminary version)
W.J. Paul
,
E.J. Prauss
,
R. Reischuk
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 113-122
Improved bounds on the problem of time-space trade-off in the pebble game (preliminary version)
R. Reischuk
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 84-91