Lecture Notes in Computer Science - STACS 94
Latest Publications

TOTAL DOCUMENTS

63

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540577850, 9783540483328

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On codes having no finite completion

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_182 ◽

1994 ◽

pp. 691-698 ◽

Cited By ~ 3

Author(s):

Nguyen Huong Lam

Download Full-text

The complete axiomatization of Cs-congruence

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_171 ◽

1994 ◽

pp. 555-568 ◽

Cited By ~ 6

Author(s):

Joachim Parrow ◽

Peter Sjödin

Keyword(s):

Complete Axiomatization

Download Full-text

Economy of description for single-valued transducers

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_175 ◽

1994 ◽

pp. 607-618 ◽

Cited By ~ 3

Author(s):

Andreas Weber ◽

Reinhard Klemm

Download Full-text

Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_178 ◽

1994 ◽

pp. 647-660 ◽

Cited By ~ 14

Author(s):

Hiroki Arimura ◽

Takeshi Shinohara ◽

Setsuko Otsuki

Keyword(s):

Inductive Inference ◽

Pattern Languages ◽

Positive Data

Download Full-text

On the approximability of finding maximum feasible subsystems of linear systems

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_168 ◽

1994 ◽

pp. 521-532 ◽

Cited By ~ 5

Author(s):

Edoardo Amaldi ◽

Viggo Kann

Keyword(s):

Linear Systems

Download Full-text

Efficient parallel algorithms for geometric k-clustering problems

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_164 ◽

1994 ◽

pp. 475-486 ◽

Cited By ~ 2

Author(s):

Amitava Datta

Keyword(s):

Parallel Algorithms ◽

Clustering Problems

Download Full-text

Two refinements of the polynomial hierarchy

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_161 ◽

1994 ◽

pp. 439-448 ◽

Cited By ~ 9

Author(s):

V. L. Selivanov

Keyword(s):

Polynomial Hierarchy

Download Full-text

Q-grammars: Results, implementation

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_156 ◽

1994 ◽

pp. 377-388

Author(s):

Maylis Delest ◽

Jean-Philippe Dubernard

Download Full-text

Monadic second-order logic over pictures and recognizability by tiling systems

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_155 ◽

1994 ◽

pp. 365-375 ◽

Cited By ~ 3

Author(s):

Dora Giammarresi ◽

Sebastian Seibert ◽

Antonio Restivo ◽

Wolfgang Thomas

Keyword(s):

Second Order ◽

Order Logic ◽

Tiling Systems ◽

Second Order Logic ◽

Monadic Second Order Logic

Download Full-text

The complexity of resource-bounded first-order classical logic

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_131 ◽

1994 ◽

pp. 59-70 ◽

Cited By ~ 3

Author(s):

Jean Goubault

Keyword(s):

Classical Logic ◽

First Order

Download Full-text