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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A design of a parallel dictionary using skip lists
Joaquim Gabarró
,
Conrado Martínez
,
Xavier Messeguer
Theoretical Computer Science
158
(1-2), 1996, pp. 1-33
About the
p
-paperfolding words
Michel Koskas
Theoretical Computer Science
158
(1-2), 1996, pp. 35-51
Randomized routing on generalized hypercubes
Afonso Ferreira
,
Miltos Grammatikakis
Theoretical Computer Science
158
(1-2), 1996, pp. 53-64
Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot
Stéphane Fabre
Theoretical Computer Science
158
(1-2), 1996, pp. 65-79
Sofic shifts with synchronizing presentations
Natas̑a Jonoska
Theoretical Computer Science
158
(1-2), 1996, pp. 81-115
On an approximation measure founded on the links between optimization and polynomial approximation theory
Marc Demange
,
Vangelis Th. Paschos
Theoretical Computer Science
158
(1-2), 1996, pp. 117-141
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Yoram Hirshfeld
,
Mark Jerrum
,
Faron Moller
Theoretical Computer Science
158
(1-2), 1996, pp. 143-159
Slender 0L languages
Taishin Y. Nishida
,
Arto Salomaa
Theoretical Computer Science
158
(1-2), 1996, pp. 161-176
Saving comparisons in the Crochemore--Perrin string-matching algorithm
Dany Breslauer
Theoretical Computer Science
158
(1-2), 1996, pp. 177-192
Geometric sets of low information content
M. Agrawal
,
V. Arvind
Theoretical Computer Science
158
(1-2), 1996, pp. 193-219
Separating classes in the exponential-time hierarchy from classes in
PH
Sarah E. Mocas
Theoretical Computer Science
158
(1-2), 1996, pp. 221-231
On the computational complexity of dynamic graph problems
G. Ramalingam
,
Thomas Reps
Theoretical Computer Science
158
(1-2), 1996, pp. 233-277
Solving optimization problems with variable-constraint by an extended Cohen--Grossberg model
Yoshikane Takahashi
Theoretical Computer Science
158
(1-2), 1996, pp. 279-341
The complexity of mean payoff games on graphs
Uri Zwick
,
Mike Paterson
Theoretical Computer Science
158
(1-2), 1996, pp. 343-359
Quasi-linear truth-table reductions to
p
-selective sets
M. Agrawal
,
V. Arvind
Theoretical Computer Science
158
(1-2), 1996, pp. 361-370
Closed iterative calculus
Serge Burckel
Theoretical Computer Science
158
(1-2), 1996, pp. 371-378
An introduction to pseudo-linear algebra
Manuel Bronstein
,
Marko Petkovs̆ek
Theoretical Computer Science
157
(1), 1996, pp. 3-33
An introduction to randomization in computational geometry
Olivier Devillers
Theoretical Computer Science
157
(1), 1996, pp. 35-52
Flexible high-order discretization of geometric data for global motion planning
Y. Elihai
,
Y. Yomdin
Theoretical Computer Science
157
(1), 1996, pp. 53-77
NC
solving of a system of linear ordinary differential equations in several unknowns
D. Grigoriev
Theoretical Computer Science
157
(1), 1996, pp. 79-90
Computability of the additive complexity of algebraic circuits with root extracting
Dima Grigoriev
,
Marek Karpinski
Theoretical Computer Science
157
(1), 1996, pp. 91-100
Nonholonomic systems: Controllability and complexity
Jean-Paul Laumond
,
Jean-Jacques Risler
Theoretical Computer Science
157
(1), 1996, pp. 101-114
Algorithms and methods in differential algebra
Jean Moulin Ollagnier
Theoretical Computer Science
157
(1), 1996, pp. 115-127
A bound for the degree of nonholonomy in the plane
Jean-Jacques Risler
Theoretical Computer Science
157
(1), 1996, pp. 129-136
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
Farid Ablayev
Theoretical Computer Science
157
(2), 1996, pp. 139-159
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
>