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=Theory of Computing Systems AND Volume=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Composing stack-attributed tree transducers
Keisuke Nakano
Theory of Computing Systems
44
(1), 2009, pp. 1-38
Nonblocking
k
-compare-single-swap
Victor Luchangco
,
Mark Moir
,
Nir Shavit
Theory of Computing Systems
44
(1), 2009, pp. 39-66
Paging with request sets
Leah Epstein
,
Rob van Stee
,
Tami Tamir
Theory of Computing Systems
44
(1), 2009, pp. 67-81
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
Heribert Vollmer
Theory of Computing Systems
44
(1), 2009, pp. 82-90
Applying modular decomposition to parameterized cluster editing problems
Fábio Protti
,
Maise Dantas da Silva
,
Jayme Luiz Szwarcfiter
Theory of Computing Systems
44
(1), 2009, pp. 91-104
On embedding of a hypercube in a completely overlapping network
Sanpawat Kantabutra
,
Jakarin Chawachat
Theory of Computing Systems
44
(1), 2009, pp. 105-116
Isomorphic implication
Michael Bauland
,
Edith Hemaspaandra
Theory of Computing Systems
44
(1), 2009, pp. 117-139
On embedding a graph in the grid with the maximum number of bends and other bad features
Giuseppe Di Battista
,
Fabrizio Frati
,
Maurizio Patrignani
Theory of Computing Systems
44
(2), 2009, pp. 143-159
Wooden geometric puzzles: Design and hardness proofs
Helmut Alt
,
Hans Bodlaender
,
Marc van Kreveld
,
Günter Rote
,
Gerard Tel
Theory of Computing Systems
44
(2), 2009, pp. 160-174
The worst page-replacement policy
Kunal Agrawal
,
Michael A. Bender
,
Jeremy T. Fineman
Theory of Computing Systems
44
(2), 2009, pp. 175-185
Contiguous search problem in Sierpiński graphs
Flaminia L. Luccio
Theory of Computing Systems
44
(2), 2009, pp. 186-204
Die another day
Rudolf Fleischer
Theory of Computing Systems
44
(2), 2009, pp. 205-214
The ferry cover problem
Michael Lampis
,
Valia Mitsou
Theory of Computing Systems
44
(2), 2009, pp. 215-229
Drawing borders efficiently
Kazuo Iwama
,
Eiji Myano
,
Hirotaka Ono
Theory of Computing Systems
44
(2), 2009, pp. 230-244
Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku Puzzles
Ronen Gradwohl
,
Moni Naor
,
Benny Pinkas
,
Guy N. Rothblum
Theory of Computing Systems
44
(2), 2009, pp. 245-268
Pictures from Mongolia. Extracting the top elements from a partially ordered set
Paolo Boldi
,
Chierichetti
,
Flavio
,
Sebastiano Vigna
Theory of Computing Systems
44
(2), 2009, pp. 269-288
Two-dimensional packet classificatoon and filter conflict resolution in the Internet
Andy Kwok
,
Chung Keung Poon
Theory of Computing Systems
44
(3), 2009, pp. 289-303
Adversarial queueing model for continuous network dynamics
Maria Blesa
,
Daniel Calzada
,
Antonio Fernández
,
Luis López
,
Andrés L. Martínez
,
Agustín Santos
,
Maria Serna
,
Christopher Thraves
Theory of Computing Systems
44
(3), 2009, pp. 304-331
Applying approximate counting for computing the frequency moments of long data streams
André Gronemeier
,
Martin Sauerhoff
Theory of Computing Systems
44
(3), 2009, pp. 332-348
A linear-time algorithm for Hamming distance with shifts
Minghui Jiang
Theory of Computing Systems
44
(3), 2009, pp. 349-355
Computing graph automorphism from partial solutions
Takayuki Nagoya
Theory of Computing Systems
44
(3), 2009, pp. 356-368
Machines that can output empty words
Christian Glaßer
,
Stephen Travers
Theory of Computing Systems
44
(3), 2009, pp. 369-390
Minimization problems for parity OBDDs
Detlef Sieling
Theory of Computing Systems
44
(3), 2009, pp. 391-413
On characteristics of information system homomorphisms
Yan-Hui Zhai
,
Kai-She Qu
Theory of Computing Systems
44
(3), 2009, pp. 414-431
Hairpin structures defined by DNA trajectories
Michael Domaratzki
Theory of Computing Systems
44
(3), 2009, pp. 432-454
Seiten 1
2
>