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 Volume=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Grammars based on patterns
Jürgen Dassow
,
Gheorghe Paun
,
Arto Salomaa
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 1-14
Average measure, descriptive complexity and approximation of maximization problems
Pierluigi Crescenzi
,
Riccardo Silvestri
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 15-30
Temporal logics for trace systems: On automated verification
Wojciech Penczek
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 31-67
Multidimensional digital searching and some new parameters in tries
Peter Kirschenhofer
,
Helmut Prodinger
,
Wojciech Szpankowski
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 69-84
Historical searching
Alistair Moffat
,
Ola Petersson
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 85-98
Scheduling file transfers under port and channel constraints
Shin-Ichi Nakano
,
Takao Nishizeki
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 101-115
On two approximation algorithms for the clique problem
Iain A. Stewart
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 117-133
On the equivalence of two-way pushdown automata and counter machines over bounded languages
Oscar H. Ibarra
,
Tao Jiang
,
Nicholas Tran
,
Hui Wang
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 135-146
General polynomial decomposition and the
s
-1-decomposition are
NP
-hard
Matthew T. Dickerson
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 147-156
Learning recursive languages with bounded mind changes
Steffen Lange
,
Thomas Zeugmann
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 157-178
Parallel algorithms for finding maximal
k
-dependent sets and maximal
f
-matchings
Krzysztof Diks
,
Oscar Garrido
,
Andrzej Lingas
International Journal of Foundations of Computer Science
4
(2), 1993, pp. 179-192
A new characterization of unbreakable graphs
Stephan Olariu
,
Iain A. Stewart
International Journal of Foundations of Computer Science
4
(3), 1993, September, pp. 193-196
On stepwise explicit substitution
Fairouz Kamareddine
,
Rob Nederpelt
International Journal of Foundations of Computer Science
4
(3), 1993, September, pp. 197-240
Complexity of universal circumscription
Alexei P. Lisitsa
International Journal of Foundations of Computer Science
4
(3), 1993, September, pp. 241-244
Banishing robust Turing completeness
Lane A. Hemaspaandra
,
Sanjay Jain
,
Nikolai K. Vereshchagin
International Journal of Foundations of Computer Science
4
(3), 1993, September, pp. 245-265
The equality condition for infinite catenations of two sets of finite words
Boris F. Melnikov
International Journal of Foundations of Computer Science
4
(3), 1993, September, pp. 267-274
Scheduling of incompatible jobs on unrelated machines
Klaus Jansen
International Journal of Foundations of Computer Science
4
(4), 1993, pp. 275-291
The complexity of finding middle elements
Heribert Vollmer
,
Klaus W. Wagner
International Journal of Foundations of Computer Science
4
(4), 1993, pp. 293-307
A top-down updating algorithm for weight-balanced trees
Tony W. Lai
,
Derick Wood
International Journal of Foundations of Computer Science
4
(4), 1993, pp. 309-324
Searching a pseudo 3-sided solid orthoconvex grid
Antonios Symvonis
,
Spyros Tragoudas
International Journal of Foundations of Computer Science
4
(4), 1993, pp. 325-353
Redundancy and the justification for fourth normal form in relational databases
Millist W. Vincent
,
Bala Srinivasan
International Journal of Foundations of Computer Science
4
(4), 1993, pp. 355-365