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="Schieber, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating minimum feedback sets and multicuts in directed graphs
G. Even
,
J. (Seffi) Naor
,
B. Schieber
,
M. Sudan
Algorithmica
20
(2), 1998, pp. 151-174
A deterministic
O(k^3)
-competitive
k
-server algorithm for the circle
A. Fiat
,
Y. Rabani
,
Y. Ravid
,
B. Schieber
Algorithmica
11
, 1994, pp. 572-578
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Y. Mansour
,
B. Schieber
Journal of the ACM
39
(4), 1992, October, pp. 783-799
A lower bound for integer greatest common divisor computations
Y. Mansour
,
B. Schieber
,
P. Tiwari
Journal of the ACM
38
(2), 1991, April, pp. 453-471
Efficient parallel algorithms for testing connectivity and finding disjoint
s-t
paths in graphs
S. Khuller
,
B. Schieber
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 288-293
The complexity of approximating the square root
Y. Mansour
,
B. Schieber
,
P. Tiwari
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 325-330
Lower bounds for computations with the floor operation
Y. Mansour
,
B. Schieber
,
P. Tiwari
Lecture Notes in Computer Science
372
, 1989, pp. 559-573
Parallel construction of a suffix tree with applications
A. Apostolico
,
C. Iliopoulos
,
G.M. Landau
,
B. Schieber
,
U. Vishkin
Algorithmica
3
, 1988, pp. 347-365
Lower bounds for integer greatest common divisor computations
Y. Mansour
,
B. Schieber
,
P. Tiwari
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 54-63
Parallel construction of a suffix tree
G.M. Landau
,
B. Schieber
,
U. Vishkin
Lecture Notes in Computer Science
267
, 1987, pp. 314-325
Parallel ear decomposition search (EDS) and
st
-numbering in graphs
Y. Maon
,
B. Schieber
,
U. Vishkin
Theoretical Computer Science
47
(3), 1986, pp. 277-298
Parallel ear decomposition search (EDS) and st-numbering
Y. Maon
,
B. Schieber
,
U. Vishkin
Lecture Notes in Computer Science
227
, 1986, pp. 34-45