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.
Euclidean TSP on two polygons
Jeff Abrahamson
,
Ali Shokoufandeh
Theoretical Computer Science
411
(7-9), 2010, pp. 1104-1114
On the problem of freeness of multiplicative matrix semigroups
Paweƚ Gawrychowski
,
Marin Gutan
,
Andrzej Kisielewicz
Theoretical Computer Science
411
(7-9), 2010, pp. 1115-1120
Error-repair parsing schemata
Carlos Gómez-Rodríguez
,
Miguel A. Alonso
,
Manuel Vilares
Theoretical Computer Science
411
(7-9), 2010, pp. 1121-1139
Minimizing the makespan on a single parallel batching machine
Shenpeng Lu
,
Haodi Feng
,
Xiuqian Li
Theoretical Computer Science
411
(7-9), 2010, pp. 1140-1145
Infinite labeled trees: From rational to Sturmian trees
Nicolas Gast
,
Bruno Gaujal
Theoretical Computer Science
411
(7-9), 2010, pp. 1146-1166
Pursuing a fast robber on a graph
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvíl
,
Nicolas Nisse
,
Karol Suchan
Theoretical Computer Science
411
(7-9), 2010, pp. 1167-1181
The complexity of the Hajós calculus for planar graphs
Kazuo Iwama
,
Kazuhisa Seto
,
Suguru Tamaki
Theoretical Computer Science
411
(7-9), 2010, pp. 1182-1191
On decision problems for parameterized machines
Oscar H. Ibarra
,
Igor Potapov
,
Hsu-Chun Yen
Theoretical Computer Science
411
(7-9), 2010, pp. 1192-1201
Clustering with partial information
Hans L. Bodlaender
,
Michael R. Fellows
,
Pinar Heggernes
,
Federico Mancini
,
Charis Papadopoulos
,
Frances Rosamond
Theoretical Computer Science
411
(7-9), 2010, pp. 1202-1211
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
Mauro Mezzini
Theoretical Computer Science
411
(7-9), 2010, pp. 1212-1220
Chromatic index of graphs with no cycle with a unique chord
R.C.S. Machado
,
C.M.H. de Figueiredo
,
K. Vus̑ković
Theoretical Computer Science
411
(7-9), 2010, pp. 1221-1234
Bounds on the efficiency of black-box commitment schemes
Omer Horvitz
,
Jonathan Katz
Theoretical Computer Science
411
(10), 2010, pp. 1251-1260
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Yannick Chevalier
,
Michael Rusinowitch
Theoretical Computer Science
411
(10), 2010, pp. 1261-1282
Basing cryptographic protocols on tamper-evident seals
Tal Moran
,
Moni Naor
Theoretical Computer Science
411
(10), 2010, pp. 1283-1310
CSP is a retract of CCS
Jifeng He
,
Tony Hoare
Theoretical Computer Science
411
(11-13), 2010, pp. 1311-1337
Invariants for parameterised Boolean Equation Systems
Simona Orzan
,
Tim A.C. Willemse
Theoretical Computer Science
411
(11-13), 2010, pp. 1338-1371
A trajectory-based strict semantics for program slicing
Richard W. Barraclough
,
David Binkley
,
Sebastian Danicic
,
Mark Harman
,
Robert M. Hierons
,
Ákos Kiss
,
Mike Laurence
,
Lahcen Ouarbya
Theoretical Computer Science
411
(11-13), 2010, pp. 1372-1386
On the expressiveness of interaction
Yuxi Fu
,
Hao Lu
Theoretical Computer Science
411
(11-13), 2010, pp. 1387-1451
Combinatorics of labelling in higher-dimensional automata
Philippe Gaucher
Theoretical Computer Science
411
(11-13), 2010, pp. 1452-1483
Gödel's system
{\cal T}
revisited
Sandra Alves
,
Maribel Fernández
,
Mário Florido
,
Ian Mackie
Theoretical Computer Science
411
(11-13), 2010, pp. 1484-1500
Quantum circuit oracles for Abstract Machine computations
Peter Hines
Theoretical Computer Science
411
(11-13), 2010, pp. 1501-1520
On generic context lemmas for higher-order calculi with sharing
Manfred Schmidt-Schauß
,
David Sabel
Theoretical Computer Science
411
(11-13), 2010, pp. 1521-1541
Fast radio broadcasting with advice
David Ilcinkas
,
Dariusz R. Kowalski
,
Andrzej Pelc
Theoretical Computer Science
411
(14-15), 2010, pp. 1544-1557
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Florent Becker
,
Sergio Rajsbaum
,
Ivan Rapaport
,
Eric Rémila
Theoretical Computer Science
411
(14-15), 2010, pp. 1558-1566
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Toshimitsu Masuzawa
,
Sébastien Tixeuil
Theoretical Computer Science
411
(14-15), 2010, pp. 1567-1582
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>