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 YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for graphs embeddable with few crossings per edge
Alexander Grigoriev
,
Hans L. Bodlaender
Algorithmica
49
(1), 2007, pp. 1-11
The complexity of the single individual SNP haplotyping problem
Rudi Cilibrasi
,
Leo van Iersel
,
Steven Kelk
,
John Tromp
Algorithmica
49
(1), 2007, pp. 13-36
Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-type problems
Nir Halman
Algorithmica
49
(1), 2007, pp. 37-50
SONET ADMs minimization with divisible paths
Leah Epstein
,
Asaf Levin
Algorithmica
49
(1), 2007, pp. 51-68
Sample complexity for computational classification problems
Daniil Ryabko
Algorithmica
49
(1), 2007, pp. 69-77
Erratum to ''Approximation algorithms for connected dominating sets''
S. Guha
,
S. Khuller
Algorithmica
49
(1), 2007, pp. 79-79
Fast recognition of Fibonacci cubes
Andrej Taranenko
,
Aleksander Vesel
Algorithmica
49
(2), 2007, pp. 81-93
Space efficient dynamic orthogonal range reporting
Y. Nekrich
Algorithmica
49
(2), 2007, pp. 94-108
Analysis of randomized protocols for conflict-free distributed access
Gopal Pandurangan
,
Gahyun Park
Algorithmica
49
(2), 2007, pp. 109-126
Property testing of regular tree languages
Frédéric Magniez
,
Michel de Rougemont
Algorithmica
49
(2), 2007, pp. 127-146
Choosing a random peer in chord
Valerie King
,
Scott Lewis
,
Jared Saia
,
Maxwell Young
Algorithmica
49
(2), 2007, pp. 147-169
Exact and approximate truthful mechanisms for the shortest paths tree problem
Luciano Gualà
,
Guido Proietti
Algorithmica
49
(3), 2007, pp. 171-191
k
-nearest-neighbor clustering and percolation theory
Shang-Hua Teng
,
Frances F. Yao
Algorithmica
49
(3), 2007, pp. 192-211
Average case analysis of disk scheduling, increasing subsequences and spacetime geometry
Eitan Bachmat
Algorithmica
49
(3), 2007, pp. 212-231
The number of tree stars is
O^*(1.357^k
)
Bernhard Fuchs
,
Walter Kern
,
Xinhui Wang
Algorithmica
49
(3), 2007, pp. 232-244
A tight lower bound for computing the diameter of a 3D convex polytope
Hervé Fournier
,
Antoine Vigneron
Algorithmica
49
(3), 2007, pp. 245-257
OVSF-CDMA code assignment in wireless ad hoc networks
Peng-Jun Wan
,
Xiang-Yang Li
,
Ophir Frieder
Algorithmica
49
(4), 2007, pp. 264-285
A class of algorithms for collision resolution with multiplicity estimation
Petar Popovski
,
Frank H.P. Fitzek
,
Ramjee Prasad
Algorithmica
49
(4), 2007, pp. 286-317
Improved approximation results for the minimum energy broadcasting problem
Michele Flammini
,
Ralf Klasing
,
Alfredo Navarra
,
Stephane Perennes
Algorithmica
49
(4), 2007, pp. 318-336
On the fundamental limits of topology control in ad hoc networks
András Faragó
Algorithmica
49
(4), 2007, pp. 337-356
Accuracy vs. lifetime: Linear sketches for aggregate queries in sensor networks
Vasundhara Puttagunta
,
Konstantinos Kalpakis
Algorithmica
49
(4), 2007, pp. 357-385
On the feasibility of time estimation under isolation conditions in wireless sensor networks
Daniela Tulone
Algorithmica
49
(4), 2007, pp. 386-411
Localized techniques for broadcasting in wireless sensor networks
Devdatt Dubhashi
,
Olle Häggström
,
Lorenzo Orecchia
,
Alessandro Panconesi
,
Chiara Petrioli
,
Andrea Vitaletti
Algorithmica
49
(4), 2007, pp. 412-446
Broadcasting in heterogeneous networks
Samir Khuller
,
Yoo-Ah Kim
Algorithmica
48
(4), 2007, pp. 1-21
A space and time efficient algorithm for constructing compressed suffix arrays
Wing-Kai Hon
,
Tak-Wah Lam
,
Kunihiko Sadakane
,
Wing-Kin Sung
,
Siu-Ming Yiu
Algorithmica
48
(1), 2007, pp. 23-36
Seiten 1
2
3
>