 | 2009 |
|---|
| 13 |       | Deepak Ajwani,
Ulrich Meyer:
Design and Engineering of External Memory Traversal Algorithms for General Graphs.
Algorithmics of Large and Complex Networks 2009: 1-33 |
| 12 | | Deepak Ajwani,
Andreas Beckmann,
Riko Jacob,
Ulrich Meyer,
Gabriel Moruz:
On Computational Models for Flash Memory Devices.
SEA 2009: 16-27 |
| 2008 |
|---|
| 11 | | Deepak Ajwani,
Itay Malinger,
Ulrich Meyer,
Sivan Toledo:
Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.
WEA 2008: 208-219 |
| 10 | | Deepak Ajwani,
Tobias Friedrich,
Ulrich Meyer:
An O(n2.75) algorithm for incremental topological ordering.
ACM Transactions on Algorithms 4(4): (2008) |
| 9 | | Deepak Ajwani,
Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering
CoRR abs/0802.1059: (2008) |
| 2007 |
|---|
| 8 | | Deepak Ajwani,
Ulrich Meyer,
Vitaly Osipov:
Improved External Memory BFS Implementation.
ALENEX 2007 |
| 7 | | Deepak Ajwani,
Tobias Friedrich:
Average-Case Analysis of Online Topological Ordering.
ISAAC 2007: 464-475 |
| 6 | | Deepak Ajwani,
Khaled M. Elbassioni,
Sathish Govindarajan,
Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n.382) colors.
SPAA 2007: 181-187 |
| 5 | | Deepak Ajwani,
Saurabh Ray,
Raimund Seidel,
Hans Raj Tiwary:
On Computing the Centroid of the Vertices of an Arrangement and Related Problems.
WADS 2007: 519-528 |
| 2006 |
|---|
| 4 | | Deepak Ajwani,
Roman Dementiev,
Ulrich Meyer:
A computational study of external-memory BFS algorithms.
SODA 2006: 601-610 |
| 3 | | Deepak Ajwani,
Tobias Friedrich,
Ulrich Meyer:
An O(n2.75) Algorithm for Online Topological Ordering.
SWAT 2006: 53-64 |
| 2 | | Deepak Ajwani,
Tobias Friedrich,
Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering
CoRR abs/cs/0602073: (2006) |
| 1 | | Deepak Ajwani,
Tobias Friedrich,
Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering.
Electronic Notes in Discrete Mathematics 25: 7-12 (2006) |
