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: Series=LNCS AND Volume=1432
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determinant: Old algorithms, new insights
Meena Mahajan
,
V. Vinay
Lecture Notes in Computer Science
1432
, 1998, pp. 276-287
Solving fundamental problems on sparse-meshes
Jop F. Sibeyn
Lecture Notes in Computer Science
1432
, 1998, pp. 288-299
Output-sensitive cell enumeration in hyperplane arrangements
Nora Sleumer
Lecture Notes in Computer Science
1432
, 1998, pp. 300-309
Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
Hans-Martin Will
Lecture Notes in Computer Science
1432
, 1998, pp. 310-321
On the number of regular vertices of the union of Jordan regions
Boris Aronov
,
Alon Efrat
,
Dan Halperin
,
Micha Sharir
Lecture Notes in Computer Science
1432
, 1998, pp. 322-334
Distribution-sensitive algorithms
Sandeep Sen
,
Neelima Gupta
Lecture Notes in Computer Science
1432
, 1998, pp. 335-346
Seiten
<
1
2