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=Theor.~Comput.~Sci. AND YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An axiom system for sequence-based specification
Lan Lin
,
Stacy J. Prowell
,
Jesse H. Poore
Theoretical Computer Science
411
(2), 2010, pp. 360-376
Quantum implicit computational complexity
Ugo Dal Lago
,
Andrea Masini
,
Margherita Zorzi
Theoretical Computer Science
411
(2), 2010, pp. 377-409
Strong normalization property for second order linear logic
Michele Pagani
,
Lorenzo Tortora de Falco
Theoretical Computer Science
411
(2), 2010, pp. 410-444
Peek arc consistency
Manuel Bodirsky
,
Hubie Chen
Theoretical Computer Science
411
(2), 2010, pp. 445-453
Complexity and succinctness issues for linear-time hybrid logics
Laura Bozzelli
,
Ruggero Lanotte
Theoretical Computer Science
411
(2), 2010, pp. 454-469
Linear logic by levels and bounded time complexity
Patrick Baillot
,
Damiano Mazza
Theoretical Computer Science
411
(2), 2010, pp. 470-503
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
M. Alpuente
,
S. Escobar
,
B. Gramlich
,
S. Lucas
Theoretical Computer Science
411
(2), 2010, pp. 504-541
On the computational power of BlenX
Alessandro Romanel
,
Corrado Priami
Theoretical Computer Science
411
(2), 2010, pp. 542-565
Canonical finite state machines for distributed systems
Robert M. Hierons
Theoretical Computer Science
411
(2), 2010, pp. 566-580
On stateless multihead automata: Hierarchies and the emptiness problem
Oscar H. Ibarra
,
Juhani Karhumäki
,
Alexander Okhotin
Theoretical Computer Science
411
(3), 2010, pp. 581-593
On the stability of Sand Piles Model
Phan Thi Ha Duong
,
Tran Thi Thu Huong
Theoretical Computer Science
411
(3), 2010, pp. 594-601
Comparing notions of randomness
Bart Kastermans
,
Steffen Lempp
Theoretical Computer Science
411
(3), 2010, pp. 602-616
On a special class of primitive words
Elena Czeizler
,
Lila Kari
,
Shinnosuke Seki
Theoretical Computer Science
411
(3), 2010, pp. 617-630
Definable transductions and weighted logics for texts
Christian Mathissen
Theoretical Computer Science
411
(3), 2010, pp. 631-659
When ignorance helps: Graphical multicast cost sharing games
Vittorio Biló
,
Angelo Fanelli
,
Michele Flammini
,
Luca Moscardelli
Theoretical Computer Science
411
(3), 2010, pp. 660-671
Energy optimal schedules for jobs with multiple active intervals
Wanyong Tian
,
Minming Li
,
Enhong Chen
Theoretical Computer Science
411
(3), 2010, pp. 672-676
A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
Colm ÓDúnlaing
,
Natalie Schluter
Theoretical Computer Science
411
(3), 2010, pp. 677-690
Listing closed sets of strongly accessible set systems with applications to data mining
Mario Boley
,
Tamás Horváth
,
Axel Poigné
,
Stefan Wrobel
Theoretical Computer Science
411
(3), 2010, pp. 691-700
On notions of regularity for data languages
Henrik Björklund
,
Thomas Schwentick
Theoretical Computer Science
411
(4-5), 2010, pp. 702-715
Complexity issues in color-preserving graph embeddings
Gaëlle Brevier
,
Romeo Rizzi
,
Stéphane Vialette
Theoretical Computer Science
411
(4-5), 2010, pp. 716-729
Extended strings and graphs for simple gene assembly
Robert Brijder
,
Miika Langille
,
Ion Petre
Theoretical Computer Science
411
(4-5), 2010, pp. 730-738
On blockwise symmetric signatures for matchgates
Jin-Yi Cai
,
Pinyan Lu
Theoretical Computer Science
411
(4-5), 2010, pp. 739-750
Factorization forests for infinite words and applications to countable scattered linear orderings
Thomas Colcombet
Theoretical Computer Science
411
(4-5), 2010, pp. 751-764
Productivity of stream definitions
Jörg Endrullis
,
Clemens Grabmayer
,
Dimitri Hendriks
,
Ariya Isihara
,
Jan Willem Klop
Theoretical Computer Science
411
(4-5), 2010, pp. 765-782
On the complexity of kings
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Till Tantau
,
Osamu Watanabe
Theoretical Computer Science
411
(4-5), 2010, pp. 783-798
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>