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="Ajwani, Deepak"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generating synthetic task graphs for simulating stream computing systems
Deepak Ajwani
,
Shoukat Ali
,
Kostas Katrinis
,
Cheng-Hong Li
,
Alfred J. Park
,
John P. Morrison
,
Eugen Schenfeld
Journal Parallel Distributed Computing
73
(10), 2013, pp. 1362-1374
Empirical evaluation of the parallel distribution sweeping framework on multicore architectures
Deepak Ajwani
,
Nodari Sitchinava
Lecture Notes in Computer Science
8125
, 2013, pp. 25-36
I/O-efficient hierarchical diameter approximation
Deepak Ajwani
,
Ulrich Meyer
,
David Veith
Lecture Notes in Computer Science
7501
, 2012, pp. 72-83
Geometric algorithms for private-cache chip multiprocessors
Deepak Ajwani
,
Nodari Sitchinava
,
Norbert Zeh
Lecture Notes in Computer Science
6347
, 2010, pp. 75-86
Conflict-free coloring for rectangle ranges using
O(n^{.382})
colors
Deepak Ajwani
,
Khaled Elbassioni
,
Sathish Govindarajan
,
Saurabh Ray
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 181-187
Average-case analysis of online topological ordering
Deepak Ajwani
,
Tobias Friedrich
Lecture Notes in Computer Science
4835
, 2007, pp. 464-475
On computing the centroid of the vertices of an arrangement and related problems
Deepak Ajwani
,
Saurabh Ray
,
Raimund Seidel
,
Hans Raj Tiwary
Lecture Notes in Computer Science
4619
, 2007, pp. 519-528
An
O(n^{2.75})
algorithm for online topological ordering
Deepak Ajwani
,
Tobias Friedrich
,
Ulrich Meyer
Lecture Notes in Computer Science
4059
, 2006, pp. 53-64