|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ehud Aharoni, Shai Fine, Yaara Goldschmidt, Ofer Lavi, Oded Margalit, Michal Rosen-Zvi, Lavi Shpigelman |
Smarter log analysis.  |
IBM Journal of Research and Development  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Hoory, Oded Margalit |
Finding the Rare Cube.  |
ALT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Oded Margalit |
All Pairs Shortest Distances for Graphs with Small Integer Length Edges.  |
Inf. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Zvi Galil, Oded Margalit |
On the Exponent of the All Pairs Shortest Path Problem.  |
J. Comput. Syst. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Oded Margalit |
All Pairs Shortest Paths for Graphs with Small Integer Length Edges.  |
J. Comput. Syst. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Oded Margalit |
Witnesses for Boolean Matrix Multiplication and for Transitive Closure.  |
J. Complexity  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Zvi Galil, Oded Margalit, Moni Naor |
Witnesses for Boolean Matrix Multiplication and for Shortest Paths  |
FOCS  |
1992 |
DBLP DOI BibTeX RDF |
subcubic methods, shortest paths, deterministic algorithm, transitive closure, witnesses, Boolean matrix multiplication |
| 1 | Zvi Galil, Oded Margalit |
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.  |
SIAM J. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Galil, Oded Margalit |
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.  |
ICALP  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Zvi Galil, Oded Margalit |
On the Exponent of the All Pairs Shortest Path Problem  |
FOCS  |
1991 |
DBLP BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|