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="Ramanan, Prakash"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rewriting XPath queries using materialized XPath views
Prakash Ramanan
Journal of Computer and System Sciences
78
(4), 2012, pp. 1006-1025
Worst-case optimal algorithm for XPath evaluation over XML streams
Prakash Ramanan
Journal of Computer and System Sciences
75
(8), 2009, pp. 465-485
A new lower bound technique and its application: Tight lower bound for a polygon triangulation problem
Prakash Ramanan
SIAM Journal on Computing
23
(4), 1994, August, pp. 834-851
Testing the optimality of alphabetic trees
Prakash Ramanan
Theoretical Computer Science
93
, 1992, pp. 279-301
Euclidean shortest path in the presence of obstacles
Yong-Mao Chen
,
Prakash Ramanan
Networks
21
(3), 1991, pp. 257-265
A new lower bound technique and its application: Tight lower bound for a polygon triangulation problem
Prakash Ramanan
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 281-290
Lower bounds for maximal and convex layers problems
Sanjiv Kapoor
,
Prakash Ramanan
Algorithmica
4
, 1989, pp. 447-459
On-line bin packing in linear time
Prakash Ramanan
,
Donna J. Brown
,
C.C. Lee
,
D.T. Lee
Journal of Algorithms
10
, 1989, pp. 305-326
Average-case analysis of the modified harmonic algorithm
Prakash Ramanan
,
Kazuhiro Tsuga
Algorithmica
4
, 1989, pp. 519-533
Average-case analysis of the smart next fit algorithm
Prakash Ramanan
Information Processing Letters
31
, 1989, pp. 221-225
Pushdown permuter characterization theorem
Prakash V. Ramanan
SIAM Journal on Computing
13
(1), 1984, February, pp. 167-169