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=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Christmas gift exchange games
Arpita Ghosh
,
Mohammad Mahdian
Theory of Computing Systems
50
(1), 2012, pp. 3-19
The feline Josephus problem
Frank Ruskey
,
Aaron Williams
Theory of Computing Systems
50
(1), 2012, pp. 20-34
On approximate jumbled pattern matching in strings
Péter Burcsi
,
Ferdinando Cicalese
,
Gabriele Fici
,
Zsuzsanna Lipták
Theory of Computing Systems
50
(1), 2012, pp. 35-51
Guessing bank PINs by winning a mastermind game
Riccardo Focardi
,
Flaminia L. Luccio
Theory of Computing Systems
50
(1), 2012, pp. 52-71
The complexity of flood filling games
Raphaël Clifford
,
Markus Jalsenius
,
Ashley Montanaro
,
Benjamin Sach
Theory of Computing Systems
50
(1), 2012, pp. 72-92
Simple wriggling is hard unless you are a fat hippo
Irina Kostitsyna
,
Valentin Polishchuk
Theory of Computing Systems
50
(1), 2012, pp. 93-110
In-place algorithm for erasing a connected component in a binary image
Tetsuo Asano
Theory of Computing Systems
50
(1), 2012, pp. 111-123
Scheduling with bully selfish jobs
Tami Tamir
Theory of Computing Systems
50
(1), 2012, pp. 124-146
Maintaining privacy on a line
Evangelos Kranakis
,
Danny Krizanc
Theory of Computing Systems
50
(1), 2012, pp. 147-157
Searching for black holes in subways
Paola Flocchini
,
Matthew Kellett
,
Peter C. Mason
,
Nicola Santoro
Theory of Computing Systems
50
(1), 2012, pp. 158-184
Two skew-binary numeral systems and one application
Amr Elmasry
,
Claus Jensen
,
Jyrki Katajainen
Theory of Computing Systems
50
(1), 2012, pp. 185-211
The navigational power of web browsers
Michaƚ Bielecki
,
Jan Hidders
,
Jan Paredaens
,
Marc Spielmann
,
Jerzy Tyszkiewicz
,
Jan Van den Bussche
Theory of Computing Systems
50
(2), 2012, pp. 213-240
A Büchi-like theorem for weighted tree automata over multioperator monoids
Zoltán Fülöp
,
Torsten Stüber
,
Heiko Vogler
Theory of Computing Systems
50
(2), 2012, pp. 241-278
Layered hashing algorithm for real-time systems
Matan Mandelbrod
Theory of Computing Systems
50
(2), 2012, pp. 279-295
On empirical meaning of randomness with respect to parametric families of probability distributions
Vladimir V'yugin
Theory of Computing Systems
50
(2), 2012, pp. 296-312
On the expressiveness of single-pass instruction sequences
J.A. Bergstra
,
C.A. Middelburg
Theory of Computing Systems
50
(2), 2012, pp. 313-328
On the expression complexity of equivalence and isomorphism of primitive positive formulas
Simone Bova
,
Hubie Chen
,
Matthew Valeriote
Theory of Computing Systems
50
(2), 2012, pp. 329-353
Computing conformal maps of finitely connected domains onto canonical slit domains
Valentin V. Andreev
,
Timothy H. McNicholl
Theory of Computing Systems
50
(2), 2012, pp. 354-369
Computing space-filling curves
P.J. Couch
,
B.D. Daniel
,
Timothy H. McNicholl
Theory of Computing Systems
50
(2), 2012, pp. 370-386
The baire partial quasi-metric space: A mathematical tool for asymptotic complexity analysis in computer science
M.A. Cerdà-Uguet
,
M.P. Schellekens
,
O. Valero
Theory of Computing Systems
50
(2), 2012, pp. 387-399
The complexity of circumscriptive inference in Post's lattice
Michael Thomas
Theory of Computing Systems
50
(3), 2012, pp. 401-419
A note on exact algorithms for vertex ordering problems on graphs
Hans L. Bodlaender
,
Fedor V. Fomin
,
Arie M.C.A. Koster
,
Dieter Kratsch
,
Dimitrios M. Thilikos
Theory of Computing Systems
50
(3), 2012, pp. 420-432
How to prove impossibility under global fairness: On space complexity of self-stabilizing leader election on a population protocol model
Shukai Cai
,
Taisuke Izumi
,
Koichi Wada
Theory of Computing Systems
50
(3), 2012, pp. 433-445
Trichotomies in the complexity of minimal inference
Arnaud Durand
,
Miki Hermann
,
Gustav Nordh
Theory of Computing Systems
50
(3), 2012, pp. 446-491
Faster approximate string matching for short patterns
Philip Bille
Theory of Computing Systems
50
(3), 2012, pp. 492-515
Seiten 1
2
>