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="Margalit, Oded"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the exponent of the all pairs shortest path problem
Noga Alon
,
Zvi Galil
,
Oded Margalit
Journal of Computer and System Sciences
54
(2), 1997, pp. 255-262
All pairs shortest paths for graphs with small integer length edges
Zvi Galil
,
Oded Margalit
Journal of Computer and System Sciences
54
(2), 1997, pp. 243-254
All pairs shortest distances for graphs with small integer length edges
Zvi Galil
,
Oded Margalit
Information and Computation
134
(2), 1997, pp. 103-139
Witnesses for Boolean matrix multiplication and for shortest paths
Noga Alon
,
Zvi Galil
,
Oded Margalit
,
Moni Naor
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 417-426
On the exponent of the all pairs shortest path problem
Noga Alon
,
Zvi Galil
,
Oded Margalit
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 569-575
An almost linear-time algorithm for the dense subset-sum problem
Zvi Galil
,
Oded Margalit
SIAM Journal on Computing
20
(6), 1991, December, pp. 1157-1189