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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Counting integer points in parametric polytopes using Barvinok's rational functions
Sven Verdoolaege
,
Rachid Seghir
,
Kristof Beyls
,
Vincent Loechner
,
Maurice Bruynooghe
Algorithmica
48
(1), 2007, pp. 37-66
Mobile search for a black hole in an anonymous ring
Stefan Dobrev
,
Paola Flocchini
,
Giuseppe Prencipe
,
Nicola Santoro
Algorithmica
48
(1), 2007, pp. 67-90
The price of selfish routing
Marios Mavronicolas
,
Paul Spirakis
Algorithmica
48
(1), 2007, pp. 91-126
Server allocation algorithms for tiered systems
Kamalika Chaudhuri
,
Anshul Kothari
,
Rudi Pendavingh
,
Ram Swaminathan
,
Robert Tarjan
,
Yunhong Zhou
Algorithmica
48
(2), 2007, pp. 129-146
Oblivious and adaptive strategies for the majority and plurality problems
Fan Chung
,
Ron Graham
,
Jia Mao
,
Andrew Yao
Algorithmica
48
(2), 2007, pp. 147-157
On Walrasian price of CPU time
Xiaotie Deng
,
Li-Sha Huang
,
Minming Li
Algorithmica
48
(2), 2007, pp. 159-172
On-line construction of two-dimensional suffix trees in
O(n^2 \log n)
time
Joong Chae Na
,
Raffaele Giancarlo
,
Kunsoo Park
Algorithmica
48
(2), 2007, pp. 173-186
Rapid homology search with neighbor seeds
Miklós Csŭrös
,
Bin Ma
Algorithmica
48
(2), 2007, pp. 187-202
Algorithmic and complexity issues of three clustering methods in microarray data analysis
Jinsong Tan
,
Kok Seng Chua
,
Louxin Zhang
,
Song Zhu
Algorithmica
48
(2), 2007, pp. 203-219
Quantum complexity of testing group commutativity
Frédéric Magniez
,
Ashwin Nayak
Algorithmica
48
(3), 2007, pp. 221-232
Polynomial-time algorithms for the ordered maximum agreement subtree problem
Anders Dessmark
,
Jesper Jansson
,
Andrzej Lingas
,
Eva-Marta Lundell
Algorithmica
48
(3), 2007, pp. 233-248
Random 2-SAT with prescribed literal degrees
Colin Cooper
,
Alan Frieze
,
Gregory B. Sorkin
Algorithmica
48
(3), 2007, pp. 249-265
A linear-time algorithm for the Perfect Phylogeny Haplotype problem
Paola Bonizzoni
Algorithmica
48
(3), 2007, pp. 267-285
The consecutive ones submatrix problem for sparse matrices
Jinsong Tan
,
Louxin Zhang
Algorithmica
48
(3), 2007, pp. 287-299
Sampling conformation space to model equilibrium fluctuations in proteins
Amarda Shehu
,
Cecilia Clementi
,
Lydia E. Kavraki
Algorithmica
48
(4), 2007, pp. 303-327
An algorithm for simultaneous backbone threading and side-chain packing
Guojun Li
,
Zhijie Liu
,
Jun-tao Guo
,
Ying Xu
Algorithmica
48
(4), 2007, pp. 329-342
An algorithmic approach to the identification of rigid domains in proteins
Vicky Choi
,
Navin Goyal
Algorithmica
48
(4), 2007, pp. 343-362
Finding pathway structures in protein interaction networks
Songjian Lu
,
Fenghui Zhang
,
Jianer Chen
,
Sing-Hoi Sze
Algorithmica
48
(4), 2007, pp. 363-374
Protein communication system: Evolution and genomic structure
Nidhal Bouaynaya
,
Dan Schonfeld
Algorithmica
48
(4), 2007, pp. 375-397
Rigid components in molecular graphs
Bill Jackson
,
Tibor Jordán
Algorithmica
48
(4), 2007, pp. 399-412
A fast and simple algorithm for the Money Changing Problem
Sebastian Böcker
,
Zsuzsanna Lipták
Algorithmica
48
(4), 2007, pp. 413-432
Toward unsupervised segmentation of semi-rigid low-resolution molecular surfaces
Leonidas J. Guibas
,
Yusu Wang
Algorithmica
48
(4), 2007, pp. 433-448