|
Search the dblp DataBase
Oded Margalit:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Noga Alon, Zvi Galil, Oded Margalit
On the Exponent of the All Pairs Shortest Path Problem [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:569-575 [Conf]
- Noga Alon, Zvi Galil, Oded Margalit, Moni Naor
Witnesses for Boolean Matrix Multiplication and for Shortest Paths [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:417-426 [Conf]
- Zvi Galil, Oded Margalit
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. [Citation Graph (0, 0)][DBLP] ICALP, 1991, pp:719-727 [Conf]
- Zvi Galil, Oded Margalit
All Pairs Shortest Distances for Graphs with Small Integer Length Edges. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:134, n:2, pp:103-139 [Journal]
- Zvi Galil, Oded Margalit
Witnesses for Boolean Matrix Multiplication and for Transitive Closure. [Citation Graph (0, 0)][DBLP] J. Complexity, 1993, v:9, n:2, pp:201-221 [Journal]
- Noga Alon, Zvi Galil, Oded Margalit
On the Exponent of the All Pairs Shortest Path Problem. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:255-262 [Journal]
- Zvi Galil, Oded Margalit
All Pairs Shortest Paths for Graphs with Small Integer Length Edges. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1997, v:54, n:2, pp:243-254 [Journal]
- Zvi Galil, Oded Margalit
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:6, pp:1157-1189 [Journal]
Finding the Rare Cube. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|