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=234
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Formalizing mathematics in higher-order logic: A case study in geometric modelling
François Puitg
,
Jean-François Dufourd
Theoretical Computer Science
234
(1-2), 2000, pp. 1-57
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Michel Habib
,
Ross McConnell
,
Christophe Paul
,
Laurent Viennot
Theoretical Computer Science
234
(1-2), 2000, pp. 59-84
The complexity of shortest path and dilation bounded interval routing
Rastislav Král̑ovic̑
,
Peter Ruz̑ic̑ka
,
Daniel S̑tefankovic̑
Theoretical Computer Science
234
(1-2), 2000, pp. 85-107
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
Klaus Weihrauch
,
Xizhong Zheng
Theoretical Computer Science
234
(1-2), 2000, pp. 109-133
Splicing in abstract families of languages
Dennis Pixton
Theoretical Computer Science
234
(1-2), 2000, pp. 135-166
Alternating finite automata and star-free languages
Kai Salomaa
,
Sheng Yu
Theoretical Computer Science
234
(1-2), 2000, pp. 167-176
Minimization algorithms for sequential transducers
Mehryar Mohri
Theoretical Computer Science
234
(1-2), 2000, pp. 177-201
Competitive analysis of randomized paging algorithms
Dimitris Achlioptas
,
Marek Chrobak
,
John Noga
Theoretical Computer Science
234
(1-2), 2000, pp. 203-218
Three-dimensional weak visibility: Complexity and applications
Cao An Wang
,
Binhai Zhu
Theoretical Computer Science
234
(1-2), 2000, pp. 219-232
Topological 3D-manifolds: A statistical study of the cells
Jean Françon
,
Yves Bertrand
Theoretical Computer Science
234
(1-2), 2000, pp. 233-254
Counting rooted maps on a surface
Didier Arquès
,
Alain Giorgetti
Theoretical Computer Science
234
(1-2), 2000, pp. 255-272
Complete distributional problems, hard languages, and resource-bounded measure
A. Pavan
,
Alan L. Selman
Theoretical Computer Science
234
(1-2), 2000, pp. 273-286
A proof of the Krohn-Rhodes decomposition theorem
Z. Ésik
Theoretical Computer Science
234
(1-2), 2000, pp. 287-300
Factoring polynomials over arbitrary finite fields
Tanja Lange
,
Arne Winterhof
Theoretical Computer Science
234
(1-2), 2000, pp. 301-308
On the semantics of the call-by-name CPS transform
Gérard Boudol
Theoretical Computer Science
234
(1-2), 2000, pp. 309-321