dblp.uni-trier.dewww.uni-trier.de

Oded Margalit (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Oded Margalit: All Pairs Shortest Distances for Graphs with Small Integer Length Edges. Inf. Comput. 134(2): 103-139 (1997)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Oded Margalit: All Pairs Shortest Paths for Graphs with Small Integer Length Edges. J. Comput. Syst. Sci. 54(2): 243-254 (1997)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Zvi Galil, Oded Margalit: On the Exponent of the All Pairs Shortest Path Problem. J. Comput. Syst. Sci. 54(2): 255-262 (1997)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Oded Margalit: Witnesses for Boolean Matrix Multiplication and for Transitive Closure. J. Complexity 9(2): 201-221 (1993)
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Zvi Galil, Oded Margalit, Moni Naor: Witnesses for Boolean Matrix Multiplication and for Shortest Paths FOCS 1992: 417-426
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Zvi Galil, Oded Margalit: On the Exponent of the All Pairs Shortest Path Problem FOCS 1991: 569-575
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Oded Margalit: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. ICALP 1991: 719-727
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZvi Galil, Oded Margalit: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. SIAM J. Comput. 20(6): 1157-1189 (1991)

Selection of 8 from 9 records - Oded Margalit has 4 coauthors

Copyright © 2009-12-27 by Michael Ley (ley@uni-trier.de)