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: Journal=Algorithmica AND Volume=46
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The monotone circuit complexity of quadratic Boolean functions
Kazuyuki Amano
,
Akira Maruoka
Algorithmica
46
(1), 2006, pp. 3-14
Multicriteria global minimum cuts
Amitai Armon
,
Uri Zwick
Algorithmica
46
(1), 2006, pp. 15-26
Efficient algorithms for
k
maximum sums
Fredrik Bengtsson
,
Jingsen Chen
Algorithmica
46
(1), 2006, pp. 27-41
Random access to advice strings and collapsing results
Jin-Yi Cai
,
Osamu Watanabe
Algorithmica
46
(1), 2006, pp. 43-57
Partial lifting and the elliptic curve discrete logarithm problem
Qi Cheng
,
Ming-Deh Huang
Algorithmica
46
(1), 2006, pp. 59-68
Deterministic rendezvous in graphs
Anders Dessmark
,
Pierre Fraigniaud
,
Dariusz R. Kowalski
,
Andrzej Pelc
Algorithmica
46
(1), 2006, pp. 69-96
Adaptive spatial partitioning for multidimensional data streams
John Hershberger
,
Nisheeth Shrivastava
,
Subhash Suri
,
Csaba D. Tóth
Algorithmica
46
(1), 2006, pp. 97-117
Exact computation of polynomial zeros expressible by square roots
Timo von Oertzen
Algorithmica
46
(1), 2006, pp. 119-136
GCD of random linear combinations
Joachim von zur Gathen
,
Igor E. Shparlinski
Algorithmica
46
(1), 2006, pp. 137-148
Algorithms for the homogeneous set sandwich problem
Celina M.H. de Figueiredo
,
Guilherme D. da Fonseca
,
Vinícius G.P. de Sá
,
Jeremy Spinrad
Algorithmica
46
(2), 2006, pp. 149-180
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
Uri Zwick
Algorithmica
46
(2), 2006, pp. 181-192
The Freeze-Tag Problem: How to wake up a swarm of robots
Esther M. Arkin
,
Michael A. Bender
,
Sándor P. Fekete
,
Joseph S.B. Mitchell
,
Martin Skutella
Algorithmica
46
(2), 2006, pp. 193-221
A faster and more space-efficient algorithm for inferring arc-annotations of RNA sequences through alignment
Jesper Jansson
,
See-Kiong Ng
,
Wing-Kin Sung
,
Hugo Willy
Algorithmica
46
(2), 2006, pp. 223-245
Scalar multiplication on Koblitz curves using the Frobenius endomorphism and its combination with point halving: Extensions and mathematical analysis
Roberto M. Avanzi
,
Clemens Heuberger
,
Helmut Prodinger
Algorithmica
46
(3), 2006, pp. 249-270
Large deviations for the weighted height of an extended class of trees
Nicolas Broutin
,
Luc Devroye
Algorithmica
46
(3), 2006, pp. 271-297
The random multisection problem, travelling waves and the distribution of the height of
m
-ary search trees
Brigitte Chauvin
,
Michael Drmota
Algorithmica
46
(3), 2006, pp. 299-327
A local limit theorem in the theory of overpartitions
Sylvie Corteel
,
William M.Y. Goh
,
Pawel Hitczenko
Algorithmica
46
(3), 2006, pp. 329-343
Destruction of very simple trees
James Allen Fill
,
Nevin Kapur
,
Alois Panholzer
Algorithmica
46
(3), 2006, pp. 345-366
Profiles of random trees: Limit theorems for random recursive trees and binary search trees
Michael Fuchs
,
Hsien-Kuei Hwang
,
Ralph Neininger
Algorithmica
46
(3), 2006, pp. 367-407
The expected size of the rule
k
dominating set
Jennie C. Hansen
,
Eric Schmutz
,
Li Sheng
Algorithmica
46
(3), 2006, pp. 409-418
Left and right pathlengths in random binary trees
Svante Janson
Algorithmica
46
(3), 2006, pp. 419-429
Asymptotics of the moments of extreme-value related distribution functions
Guy Louchard
,
Helmut Prodinger
Algorithmica
46
(3), 2006, pp. 431-467
Average-case analysis of approximate trie search
Moritz G. Maass
Algorithmica
46
(3), 2006, pp. 469-491
Asymptotics of largest components in combinatorial structures
Mohamed Omar
,
Daniel Panario
,
Bruce Richmond
,
Jacki Whitely
Algorithmica
46
(3), 2006, pp. 493-503
Optimal coding and sampling of triangulations
Dominique Poulalhon
,
Gilles Schaeffer
Algorithmica
46
(3), 2006, pp. 505-527
Seiten 1
2
>