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 Volume=320
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast natural algorithm for searching
Joshua J. Arulanandham
,
Cristian S. Calude
,
Michael J. Dinneen
Theoretical Computer Science
320
(1), 2004, pp. 3-13
Quantum computing without entanglement
Eli Biham
,
Gilles Brassard
,
Dan Kenigsberg
,
Tal Mor
Theoretical Computer Science
320
(1), 2004, pp. 15-33
Classifying RNA pseudoknotted structures
Anne Condon
,
Beth Davy
,
Baharak Rastegari
,
Shelly Zhao
,
Finbarr Tarrant
Theoretical Computer Science
320
(1), 2004, pp. 35-50
Families of languages defined by ciliate bio-operations
Mark Daley
,
Lila Kari
,
Ian McQuillan
Theoretical Computer Science
320
(1), 2004, pp. 51-69
Neural computation, social networks, and topological spectra
Michelangelo Diligenti
,
Marco Gori
,
Marco Maggini
Theoretical Computer Science
320
(1), 2004, pp. 71-87
On the computational complexity of membrane systems
Oscar H. Ibarra
Theoretical Computer Science
320
(1), 2004, pp. 89-109
Neural learning methods yielding functional invariance
Vicente Ruiz de Angulo
,
Carme Torras
Theoretical Computer Science
320
(1), 2004, pp. 111-121
Real royal road functions for constant population size
Tobias Storch
,
Ingo Wegener
Theoretical Computer Science
320
(1), 2004, pp. 123-134
When a genetic algorithm outperforms hill-climbing
Adam Prügel-Bennett
Theoretical Computer Science
320
(1), 2004, pp. 135-153
New spectral lower bounds on the bisection width of graphs
S. Bezrukov
,
R. Elsässer
,
B. Monien
,
R. Preis
,
J.-P. Tillich
Theoretical Computer Science
320
(2-3), 2004, pp. 155-174
On groups whose word problem is solved by a counter automaton
Gillian Z. Elston
,
Gretchen Ostheimer
Theoretical Computer Science
320
(2-3), 2004, pp. 175-185
String-matching with OBDDs
Ch. Choffrut
,
Y. Haddad
Theoretical Computer Science
320
(2-3), 2004, pp. 187-198
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
J.J. Yuan
,
Z.H. Liu
,
C.T. Ng
,
T.C.E. Cheng
Theoretical Computer Science
320
(2-3), 2004, pp. 199-212
Bounding the firing synchronization problem on a ring
André Berthiaume
,
Todd Bittner
,
Ljubomir Perković
,
Amber Settle
,
Janos Simon
Theoretical Computer Science
320
(2-3), 2004, pp. 213-228
A note on measuring in
P
Olivier Powell
Theoretical Computer Science
320
(2-3), 2004, pp. 229-246
Combined super-/substring and super-/subsequence problems
Martin Middendorf
,
David F. Manlove
Theoretical Computer Science
320
(2-3), 2004, pp. 247-267
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
Carlo Blundo
,
Paolo D'Arco
,
Vanessa Daza
,
Carles Padró
Theoretical Computer Science
320
(2-3), 2004, pp. 269-291
Deletion along trajectories
Michael Domaratzki
Theoretical Computer Science
320
(2-3), 2004, pp. 293-313
On the state complexity of reversals of regular languages
Arto Salomaa
,
Derick Wood
,
Sheng Yu
Theoretical Computer Science
320
(2-3), 2004, pp. 315-329
Algorithms for multi-level graph planarity testing and layout
Patrick Healy
,
Ago Kuusik
Theoretical Computer Science
320
(2-3), 2004, pp. 331-344
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Simona Cocco
,
Rémi Monasson
Theoretical Computer Science
320
(2-3), 2004, pp. 345-372
Algorithms for four variants of the exact satisfiability problem
Vilhelm Dahllöf
,
Peter Jonsson
,
Richard Beigel
Theoretical Computer Science
320
(2-3), 2004, pp. 373-394
An algorithmic view of gene teams
Marie-Pierre Béal
,
Anne Bergeron
,
Sylvie Corteel
,
Mathieu Raffinot
Theoretical Computer Science
320
(2-3), 2004, pp. 395-418
On the number of nonterminals in linear conjunctive grammars
Alexander Okhotin
Theoretical Computer Science
320
(2-3), 2004, pp. 419-448
On probabilistic analog automata
Asa Ben-Hur
,
Alexander Roitershtein
,
Hava T. Siegelmann
Theoretical Computer Science
320
(2-3), 2004, pp. 449-464
Seiten 1
2
>