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="Lynch, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simulation techniques for proving properties of real-time systems
N. Lynch
Lecture Notes in Computer Science
803
, 1994, pp. 375-424
On the correctness of orphan management algorithms
M. Herlihy
,
N. Lynch
,
M. Merritt
,
W. Weihl
Journal of the ACM
39
(4), 1992, October, pp. 881-930
A modular proof of correctness for a network synchronizer
A. Fekete
,
N. Lynch
,
L. Shrira
Lecture Notes in Computer Science
312
, 1988, pp. 219-256
Electing a leader in a synchronous ring
G.N. Frederickson
,
N.A. Lynch
Journal of the ACM
34
(1), 1987, pp. 98-115
Reaching approximate agreement in the presence of faults
D. Dolev
,
N.A. Lynch
,
S.S. Pinter
,
E.W. Stark
,
W.E. Weihl
Journal of the ACM
33
(3), 1986, pp. 499-516
Probabilistic analysis of a network resource allocation algorithm
N.A. Lynch
,
N.D. Griffeth
,
M.J. Fischer
,
L.J. Guibas
Information and Control
68
(1-3), 1986, pp. 47-85
Impossibility of distributed consensus with one faulty process
M.J. Fischer
,
N.A. Lynch
,
M.S. Paterson
Journal of the ACM
32
(2), 1985, pp. 374-382
The impact of synchronous communication on the problem of electing a leader in a ring
G. Frederickson
,
N. Lynch
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 493-503
An upper and lower bound for clock synchronization
J. Lundelius
,
N. Lynch
Information and Control
62
(2-3), 1984, pp. 190-204
Efficiency of synchronous versus asynchronous distributed systems
E. Arjomandi
,
M.J. Fischer
,
N.A. Lynch
Journal of the ACM
30
(3), 1983, pp. 449-456
A technique for decomposing algorithms which use a single shared variable
N.A. Lynch
,
M.J. Fischer
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 350-377
Data requirements for implementation on
N
-process mutual exclusion using a single shared variable
J.E. Burns
,
P. Jackson
,
N.A. Lynch
,
M.J. Fischer
,
G.L. Peterson
Journal of the ACM
29
(1), 1982, pp. 183-205
Cryptographic protocols
R.A. DeMillo
,
N.A. Lynch
,
M.J. Merritt
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 383-400
An efficient Byzantine agreement without authentication
D. Dolev
,
M.J. Fisher
,
R. Fowler
,
N. Lynch
,
H.R. Strong
Technical Report (RJ 3428), 1982
A lower bound for the time to assure interactive consistency
M.J. Fischer
,
N.A. Lynch
Information Processing Letters
14
(4), 1982, June, pp. 183-186
Accessibility of values as a determinant of relative complexity in algebras
N.A. Lynch
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 101-113
A difference in efficiency between synchronous and asynchronous systems
E. Arjomandi
,
M. Fischer
,
N. Lynch
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 128-132
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 351-364
Efficient searching using partial ordering
A. Borodin
,
L.J. Guibas
,
N.A. Lynch
,
A.C. Yao
Information Processing Letters
12
(2), 1981, April, pp. 71-75
On describing the behavior and implementation of distributed systems
N.A. Lynch
,
M.J. Fischer
Theoretical Computer Science
13
, 1981, pp. 17-43
Upper bounds for static resource allocation in a distributed system
N.A. Lynch
Journal of Computer and System Sciences
23
(2), 1981, October, pp. 254-278
Fast allocation of nearby resources in a distributed system
N.A. Lynch
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 70-81
Straight-line program length as a parameter for complexity analysis
N.A. Lynch
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 251-280
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS'79 (San Juan, PR, October 29-31, 1979)
, 1979, pp. 319-327
Resource allocaton with immunity to limited process failure (preliminary report)
M. Fischer
,
N. Lynch
,
J. Burns
,
A. Borodin
Technical Report (79-09-01), 1979, September
Seiten 1
2
>