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="Moran, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple randomized scheme for constructing low-weight
k
-connected spanning subgraphs with applications to distributed algorithms
Maleq Khan
,
Gopal Pandurangan
,
V.S. Anil Kumar
Theoretical Computer Science
385
(1-3), 2007, pp. 101-114
The complexity of the characterization of networks supporting shortest-path interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Theoretical Computer Science
289
(1), 2002, pp. 85-104
Lower bounds for linear interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Networks
34
(1), 1999, pp. 37-46
A simple DFS-based algorithm for linear interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Lecture Notes in Computer Science
1320
, 1997, pp. 37-51
The complexity of the characterization of networks supporting shortest-path interval routing
T. Eilam
,
S. Moran
,
S. Zaks
Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity, SIROCCO'97 (Monte Verità, Switzerland, July 24-26, 1997)
, 1997, pp. 99-111
The wakeup problem
M.J. Fischer
,
S. Moran
,
S. Rudich
,
G. Taubenfeld
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 106-116
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
H.L. Bodlaender
,
S. Moran
,
M.K. Warmuth
Lecture Notes in Computer Science
380
, 1989, pp. 58-67
Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
P. Erdŏs
,
I. Koren
,
S. Moran
,
G.M. Silberman
,
S. Zaks
Math. Systems Theory
21
, 1989, pp. 85-98
Optimal lower bounds for some distributed algorithms for a complete network of processors
E. Korach
,
S. Moran
,
S. Zaks
Theoretical Computer Science
64
, 1989, pp. 125-132
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes
L. Babai
,
S. Moran
Journal of Computer and System Sciences
36
(2), 1988, April, pp. 254-276
Analysis of a distributed scheduler for communication networks
Y. Malka
,
S. Moran
,
S. Zaks
Lecture Notes in Computer Science
319
, 1988, pp. 351-360
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors
E. Korach
,
S. Moran
,
S. Zaks
SIAM Journal on Computing
16
(2), 1987, April, pp. 231-236
Extended impossibility results for asynchronous complete networks
S. Moran
,
Y. Wolfstahl
Information Processing Letters
26
(3), 1987, November, pp. 145-151
Generalized lower bounds derived from HÅstad's main lemma (small depth circuits)
S. Moran
Information Processing Letters
25
(6), 1987, July, pp. 383-388
A modular technique for the design of efficient distributed leader finding algorithms
E. Korach
,
S. Kutten
,
S. Moran
misc, 1986
Sequential machine characterizations of trellis and cellular automata and applications
O.H. Ibarra
,
S.M. Kim
,
S. Moran
SIAM Journal on Computing
14
(2), 1985, May, pp. 426-447
Parallel algorithm for finding maximum bipartite matchings and maximum flow in 0-1 networks
E. Schieber
,
S. Moran
Technical Report (352), 1985, January
On approximation problems related to the independent set and vertex cover problems
R. Bar-Yehuda
,
S. Moran
Discrete Applied Mathematics
9
, 1984, pp. 1-10
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
E. Korach
,
S. Moran
,
S. Zaks
misc, 1984
On the control power of integer division
O.H. Ibarra
,
S. Moran
,
L.E. Rosier
Theoretical Computer Science
24
(1), 1983, pp. 35-52
Some time-space tradeoff results concerning single-tape and offline TM's
O.H. Ibarra
,
S. Moran
SIAM Journal on Computing
12
(2), 1983, May, pp. 388-394
Probabilistic algorithms for deciding equivalence of straigth-line programs
O.H. Ibarra
,
S. Moran
Journal of the ACM
30
(1), 1983, pp. 217-228
On the complexity of simple arithmetic expressions
O.H. Ibarra
,
B.S. Leininger
,
S. Moran
Theoretical Computer Science
19
, 1982, pp. 17-28
On some decision problems for RAM programs
O.H. Ibarra
,
S. Moran
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 69-81
On the accepting density hierarchy in
NP
S. Moran
SIAM Journal on Computing
11
(2), 1982, May, pp. 344-349
Seiten 1
2
>