STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993. ProceedingsSpringer Science & Business Media, 1993. gada 19. febr. - 723 lappuses This volume contains the proceedings of the tenth annual Symposium on Theoretical Aspects of Computer Science (STACS '93), held in W}rzburg, February 25-27, 1993. The STACS symposia are held alternately in Germany and France, and organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI) and theSpecial Interest Group for Applied Mathematics of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (afcet). The volume includes the three invited talks which opened the three days of the symposium: "Causal and distributed semantics for concurrent processes" (I. Castellani), "Parallel architectures: design and efficient use" (B. Monien et al.), and "Transparent proofs" (L. Babai). The selection of contributed papers is organized into parts on: computational complexity, logic in computer science, efficient algorithms, parallel and distributed computation, language theory, computational geometry, automata theory, semantics and logic of programming languages, automata theory and logic, circuit complexity, omega-automata, non-classical complexity, learning theory and cryptography, and systems. |
Saturs
I | 1 |
III | 2 |
IV | 5 |
V | 16 |
VI | 28 |
VII | 38 |
VIII | 48 |
IX | 58 |
XL | 374 |
XLI | 386 |
XLIII | 398 |
XLIV | 408 |
XLV | 418 |
XLVI | 428 |
XLVII | 440 |
XLVIII | 452 |
X | 69 |
XI | 70 |
XII | 80 |
XIII | 90 |
XIV | 100 |
XV | 110 |
XVI | 120 |
XVII | 130 |
XVIII | 141 |
XIX | 153 |
XX | 163 |
XXI | 175 |
XXII | 185 |
XXIII | 196 |
XXIV | 206 |
XXV | 216 |
XXVI | 226 |
XXVII | 237 |
XXVIII | 247 |
XXIX | 270 |
XXX | 282 |
XXXI | 294 |
XXXII | 306 |
XXXIII | 317 |
XXXV | 323 |
XXXVI | 333 |
XXXVII | 343 |
XXXVIII | 354 |
XXXIX | 365 |
XLIX | 463 |
L | 473 |
LI | 484 |
LII | 494 |
LIII | 505 |
LIV | 515 |
LVI | 525 |
LVII | 535 |
LVIII | 545 |
LIX | 555 |
LXI | 566 |
LXII | 576 |
LXIII | 586 |
LXIV | 595 |
LXV | 607 |
LXVI | 617 |
LXVII | 629 |
LXVIII | 640 |
LXIX | 650 |
LXX | 662 |
LXXI | 672 |
LXXII | 682 |
LXXIV | 692 |
LXXV | 704 |
LXXVI | 706 |
LXXVII | 708 |
LXXVIII | 710 |
Citi izdevumi - Skatīt visu
STACS 93: 10th Annual Symposium on Theoretical Aspects of Computer Science ... Patrice Enjalbert,Alain Finkel,Klaus W. Wagner Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
A₁ accepted algorithm alphabet automata automaton binary bipartite bipartite graph bits boolean function BP1s C₁ cellular automata circuit clause complete complexity classes Computer Science configuration consider constant construct contains Corollary defined Definition denote deterministic distributed edge elements encoding equivalent exists finite first-order formula gap-definable given graph Hence hierarchy hypercube infinite integer intersection interval iterated labelled language Lemma length linear logic lower bound Lyndon word mapping maximal modules monoid morphism Muller automaton multivalued functions node nondeterministic NP-complete NPMV O(log optimal oracle oracle machine Overf(f P/poly parallel partially commutative path Petri net polygon polynomial polynomial hierarchy polynomial-time problem Proc processors proof system Proposition prove queries R₁ recursive reduced result s₁ sequence simulated step string subgraph subset t₁ temporal logic Theorem Theory transition tree Turing machines variables vertex w-languages
Populāri fragmenti
690. lappuse - ... supported by the German Ministry for Research and Technology (BMFT) under grant no.