Algorithmica, Volume 31, 2001
Volume 31, Number 1, 2001
Volume 31, Number 2, 2001
Neelima Gupta,
Sandeep Sen:
An Efficient Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains. 179-207
Volume 31, Number 3, 2001
Luc Devroye:
On the Probablistic Worst-Case Time of "Find". 291-303 Helmut Prodinger:
A q-Analogue of the Path Length of Binary Search Trees. 433-441
Volume 31, Number 4, 2001
Peter A. Beling:
Exact Algorithms for Linear Programming over Algebraic Extensions. 459-478
Google
Google Scholar
MS Academic Search
CiteSeerX
Semantic Scholar
Alon Efrat, Alon Itai, Matthew J. Katz:
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2016-09-23 21:02 CEST by the dblp team