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
[1]
Hilfe
Suche: Journal=Algorithmica AND Volume=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantum and classical query complexities of local search are polynomially related
Miklos Santha
,
Mario Szegedy
Algorithmica
55
(3), 2009, pp. 557-575
On the quantum query of local search in two and three dimensions
Xiaoming Sun
,
Andrew Chi-Chih Yao
Algorithmica
55
(3), 2009, pp. 576-600
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Algorithmica
55
(4), 2009, pp. 601-618
Online search with time-varying price bounds
Peter Damaschke
,
Phuong Hoai Ha
,
Philippas Tsigas
Algorithmica
55
(4), 2009, pp. 619-642
Weighted sum coloring in batch scheduling of conflicting jobs
Leah Epstein
,
Magnús M. Halldórsson
,
Asaf Levin
,
Hadas Shachnai
Algorithmica
55
(4), 2009, pp. 643-665
Clamshell casting
Prosenjit Bose
,
Pat Morin
,
Michiel Smid
,
Stefanie Wuhrer
Algorithmica
55
(4), 2009, pp. 666-702
Structure and recognition of graphs with no 6-wheel subdivision
Rebecca Robinson
,
Graham Farr
Algorithmica
55
(4), 2009, pp. 703-728
A lower bound for scheduling mechanisms
George Christodoulou
,
Elias Koutsoupias
,
Angelina Vidali
Algorithmica
55
(4), 2009, pp. 729-740
Seiten
<
1
2