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: Author="Selman, Alan L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The equivalence of sampling and searching
Scott Aaronson
Theory of Computing Systems
55
(2), 2014, pp. 281-298
On edge irregular total labeling of categorical product of two cycles
Ali Ahmad
,
Martin Bac̑a
,
Muhammad Kamran Siddiqui
Theory of Computing Systems
54
(1), 2014, pp. 1-12
Scandinavian thins on top of cake: New and improved algorithms for stacking and packing
Helmut Alt
,
Esther M. Arkin
,
Alon Efrat
,
George Hart
,
Ferran Hurtado
,
Irina Kostitsyna
,
Alexander Kröller
,
Joseph S.B. Mitchell
,
Valentin Polishchuk
Theory of Computing Systems
54
(4), 2014, pp. 689-714
Strategic pricing in next-hop routing with elastic demands
Elliot Anshelevich
,
Ameya Hate
,
Koushik Kar
Theory of Computing Systems
54
(3), 2014, pp. 407-430
On the separation question for tree languages
André Arnold
,
Henryk Michalewski
,
Damian Niwiński
Theory of Computing Systems
55
(4), 2014, pp. 833-855
Repeated budgeted second price ad auction
Asaph Arnon
,
Yishay Mansour
Theory of Computing Systems
54
(3), 2014, pp. 453-478
Tight bounds for adopt-commit objects
James Aspnes
,
Faith Ellen
Theory of Computing Systems
55
(3), 2014, pp. 451-474
The kissing problem: How to end a gathering when everyone kisses everyone else goodbye
Michael A. Bender
,
Ritwik Bose
,
Rezaul Chowdhury
,
McCauley
,
Samuel
Theory of Computing Systems
54
(4), 2014, pp. 715-730
Approximating the minimum length of synchronizing words is hard
Mikhail V. Berlinkov
Theory of Computing Systems
54
(2), 2014, pp. 211-223
String indexing for patterns with wildcards
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
Sren Vind
Theory of Computing Systems
55
(1), 2014, pp. 41-60
Complexity of rational and irrational Nash equilibria
Vittorio Bilò
,
Marios Mavronicolas
Theory of Computing Systems
54
(3), 2014, pp. 491-527
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Guy E. Blelloch
,
Anupam Gupta
,
Ioannis Koutis
,
Gary L. Miller
,
Richard Peng
,
Kanat Tangwongsan
Theory of Computing Systems
55
(3), 2014, pp. 521-554
Parameterized domination in circle graphs
Nicolas Bousquet
,
Daniel Gonçalves
,
George B. Mertzios
,
Christophe Paul
,
Ignasi Sau
,
Stéphane Thomassé
Theory of Computing Systems
54
(1), 2014, pp. 45-72
On equilibria in quantitative games with reachability/safety objectives
Thomas Brihaye
,
Véronique Bruy`ere
,
Julie De Pril
Theory of Computing Systems
54
(2), 2014, pp. 150-189
On first-order logic and CPDA graphs
Christopher H. Broadbent
Theory of Computing Systems
55
(4), 2014, pp. 771-832
Quotient complexity of closed languages
Janusz Brzozowski
,
Galina Jirásková
,
Chenglong Zou
Theory of Computing Systems
54
(2), 2014, pp. 277-292
Linear-space data structures for range mode query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Kasper Green Larsen
,
Jason Morrison
,
Bryan T. Wilkinson
Theory of Computing Systems
55
(4), 2014, pp. 719-741
Learning read-constant polynomials of constant degree modulo composites
Arkadev Chattopadhyay
,
Ricard Gavaldà
,
Kristoffer Arnsfelt Hansen
,
Denis Thérien
Theory of Computing Systems
55
(2), 2014, pp. 404-420
Constant thresholds can make target set selection tractable
Morgan Chopin
,
André Nichterlein
,
Rolf Niedermeier
,
Mathias Weller
Theory of Computing Systems
55
(1), 2014, pp. 61-83
Perfect strategies for the Ulam-Rényi game with multi-interval questions
Ferdinando Cicalese
Theory of Computing Systems
54
(4), 2014, pp. 578-594
On the hardness of losing width
Marek Cygan
,
Daniel Lokshtanov
,
Marcin Pilipczuk
,
Michaƚ Plipczuk
,
Saket Saurabh
Theory of Computing Systems
54
(1), 2014, pp. 73-82
Decidability of branching bisimulation on normed commutative context-free processes
Wojciech Czerwiński
,
Piotr Hofman
,
Sƚawomir Lasota
Theory of Computing Systems
55
(1), 2014, pp. 136-169
Picture-hanging puzzles
Erik D. Demaine
,
Martin L. Demaine
,
Yair N. Minsky
,
Joseph S.B. Mitchell
,
Ronald L. Rivest
,
Mihai Pȃtraşcu
Theory of Computing Systems
54
(4), 2014, pp. 531-550
Optimal sensor networks for area monitoring using rotating and beam sensors
Stefan Dobrev
,
Lata Narayanan
,
Jaroslav Opatrny
Theory of Computing Systems
54
(4), 2014, pp. 622-639
Playing Mastermind with constant-size memory
Benjamin Doerr
,
Carola Winzen
Theory of Computing Systems
55
(4), 2014, pp. 658-684
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>