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
[1]
Hilfe
Suche: Author="Moran, Shlomo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bit complexity of breaking and achieving symmetry in chains and rings
Yefim Dinitz
,
Shlomo Moran
,
Sergio Rajsbaum
Journal of the ACM
55
(1), 2008, pp. 3: 1-28
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Shlomo Moran
,
Sagi Snir
Journal of Computer and System Sciences
74
(5), 2008, pp. 850-869
Optimal implementations of UPGMA and other common clustering algorithms
Ilan Gronau
,
Shlomo Moran
Information Processing Letters
104
(6), 2007, pp. 205-210
On the hardness of inferring phylogenies from triplet-dissimilarities
Ilan Gronau
,
Shlomo Moran
Theoretical Computer Science
389
(1-2), 2007, pp. 44-55
Efficient approximation of convex recolorings
Shlomo Moran
,
Sagi Snir
Journal of Computer and System Sciences
73
(7), 2007, pp. 1078-1089
Using semi-definite programming to enhance supertree resolvability
Shlomo Moran
,
Satish Rao
,
Sagi Snir
LNCS/LNBI
3692
, 2005, pp. 89-103
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Shlomo Moran
,
Sagi Snir
Lecture Notes in Computer Science
3608
, 2005, pp. 218-232
Competitive caching of query results in search engines
Ronny Lempel
,
Shlomo Moran
Theoretical Computer Science
324
(2-3), 2004, pp. 253-271
Computing in totally anonymous asynchronous shared memory systems
Hagit Attiya
,
Alla Gorbach
,
Shlomo Moran
Information and Computation
173
(2), 2002, pp. 162-183
Public data structures: Counters as a special case
Hagit Brit
,
Shlomo Moran
,
Gadi Taubenfeld
Theoretical Computer Science
289
(1), 2002, pp. 401-423
On the total
_k
-diameter of connection networks
Yefim Dinitz
,
Tamar Eilam
,
Shlomo Moran
,
Shmuel Zaks
Theoretical Computer Science
247
(1-2), 2000, pp. 213-228
Simple end efficient network decomposition and synchronization
Shlomo Moran
,
Sagi Snir
Theoretical Computer Science
243
(1-2), 2000, pp. 217-241
Bit complexity of breaking and achieving symmetry in chains and rings
Yefim Dinitz
,
Shlomo Moran
,
Sergio Rajsbaum
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 265-274
Minimum propositional proof length is
NP
-hard to linearly approximate
Michael Alekhnovich
,
Sam Buss
,
Shlomo Moran
,
Toniann Pitassi
Lecture Notes in Computer Science
1450
, 1998, pp. 176-184
On the total-
k
-diameter of connection networks
Yefim Dinitz
,
Tamar Eilam
,
Shlomo Moran
,
Shmuel Zaks
Proceedings of the 5th Israel Symposium on Theory of Computing and Systems, ISTCS'97 (Ramat-Gan, Israel, June 17-19, 1997)
, 1997, pp. 96-106
Resource bounds for self-stabilizing message-driven protocols
Shlomi Dolev
,
Amos Israeli
,
Shlomo Moran
SIAM Journal on Computing
26
(1), 1997, pp. 273-290
Uniform dynamic self-stabilizing leader election
Shlomi Dolev
,
Amos Israeli
,
Shlomo Moran
IEEE Transactions on Parallel and Distributed Systems
8
(4), 1997, pp. 424-440
A lower bound on wait-free counting
Shlomo Moran
,
Gadi Taubenfeld
Journal of Algorithms
24
(1), 1997, pp. 1-19
Concurrent counting
Shlomo Moran
,
Gadi Taubenfeld
,
Irit Yadin
Journal of Computer and System Sciences
53
(1), 1996, pp. 61-78
Possibility and impossibility results in a shared memory environment
Gadi Taubenfeld
,
Shlomo Moran
Acta Informatica
33
(1), 1996, pp. 1-20
Tight bounds on the round complexity of distributed 1-solvable tasks
Ofer Biran
,
Shlomo Moran
,
Shmuel Zaks
Theoretical Computer Science
145
(1-2), 1995, pp. 271-290
Average and randomized complexity of distributed problems
Nechama Allenberg-Navony
,
Alon Itai
,
Shlomo Moran
Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG '94 (Terschelling, The Netherlands, September 29 - October 1, 1994)
LNCS 857
, 1994, pp. 311-325
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Hans L. Bodlaender
,
Shlomo Moran
,
Manfred K. Warmuth
Information and Computation
108
(1), 1994, January, pp. 34-50
Exotic behaviour of consensus numbers
Robert Cori
,
Shlomo Moran
Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG '94 (Terschelling, The Netherlands, September 29 - October 1, 1994)
LNCS 857
, 1994, pp. 101-115
Impossibility results in the presence of multiple faulty processes
Gadi Taubenfeld
,
Shmuel Katz
,
Shlomo Moran
Information and Computation
113
(2), 1994, September, pp. 173-198
Seiten 1
2
3
>