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=International Journal of Foundations of Computer Science AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Synthesizing state-based object systems from LSC specifications
David Harel
,
Hillel Kugler
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 5-51
Vector algorithms for approximate string matching
Anne Bergeron
,
Sylvie Hamel
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 53-65
The regularity of two-way nondeterministic tree automata languages
Anne Brüggemann-Klein
,
Derick Wood
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 67-81
An efficient algorithm for constructing minimal cover automata for finite languages
Cezar Campeanu
,
Andrei Paun
,
Sheng Yu
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 83-97
Evaluation of three implicit structures to implement nondeterministic automata from regular expressions
Jean-Marc Champarnaud
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 99-113
Verification in queue-connected multicounter machines
Oscar H. Ibarra
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 115-127
Generic
\epsilon
-removal and input
\epsilon
-normalization algorithms for weighted transducers
Mehryar Mohri
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 129-143
Unary language operations, state complexity and Jacobsthal's function
Giovanni Pighizzini
,
Jeffrey Shallit
International Journal of Foundations of Computer Science
13
(1), 2002, pp. 145-159
The Delaunay hierarchy
Olivier Devillers
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 163-180
Walking in a triangulation
Olivier Devillers
,
Sylvain Pion
,
Monique Teillaud
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 181-199
Pitching tents in space-time: Mesh generation for discontinuous Galerkin method
Alper Üngör
,
Alla Sheffer
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 201-221
Sink insertion for mesh improvement
Herbert Edelsbrunner
,
Damrong Guoy
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 223-242
Lossless subdivision-based multiresolution representation of arbitrary triangle meshes using kite trees
Wei Xu
,
Richard Hammersley
,
Karen Lu
,
Donald Fussell
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 243-260
C^1
modeling with hybrid multiple-sided A-patches
Guoliang Xu
,
Chandrajit L. Bajaj
,
Susan Evans
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 261-284
Boundary triangulations approximating developable surfaces that interpolate a closed space curve
William H. Frey
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 285-302
On flips in polyhedral surfaces
Oswin Aichholzer
,
Lyuba S. Alboul
,
Ferran Hurtado
International Journal of Foundations of Computer Science
13
(2), 2002, pp. 303-311
Verifying probabilistic programs using a Hoare like logic
J.I. den Hartog
,
E.P. de Vink
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 315-340
An expressive extension of TLC
Jesper Gulmann Henriksen
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 341-360
An extension of an automated termination method of recursive functions
Fairouz Kamareddine
,
Francois Monin
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 361-386
Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs
Abhik Roychoudhury
,
K. Narayan Kumar
,
C.R. Ramakrishnan
,
I.V. Ramakrishnan
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 387-403
Gate resizing to reduce power consumption
Edward Y.C. Cheng
,
Sartaj Sahn
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 405-429
The fastest and shortest algorithm for all well-defined problems
Marcus Hutter
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 431-443
Sizes of ordered decision trees
Hans Zantema
,
Hans L. Bodlaender
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 445-458
A note on synchronized automata and road coloring problem
Karel Culik II
,
Juhani Karhumäki
,
Jarkko Kari
International Journal of Foundations of Computer Science
13
(3), 2002, pp. 459-471
Intelligent high-performance crawlers used to reveal topic-specific structure of the WWW
András Lŏrincz
,
István Kókai
,
Attila Meretei
International Journal of Foundations of Computer Science
13
(4), 2002, pp. 477-495
Seiten 1
2
3
>