STACS 97 (Record no. 188570)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05899nam a22006015i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-540-68342-1 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423132518.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 121227s1997 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783540683421 |
| -- | 978-3-540-68342-1 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/BFb0023443 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA75.5-76.95 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYA |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 245 10 - TITLE STATEMENT | |
| Title | STACS 97 |
| Medium | [electronic resource] : |
| Remainder of title | 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings / |
| Statement of responsibility, etc | edited by Rüdiger Reischuk, Michel Morvan. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 1997. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 1997. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XV, 621 p. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 1611-3349 ; |
| Volume number/sequential designation | 1200 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Unifying models -- Predecessor queries in dynamic integer sets -- Semi-dynamic shortest paths and breadth-first search in digraphs -- Greibach normal form transformation, revisited -- Translating regular expressions into small ?-free nondeterministic finite automata -- Memory management for Union-Find algorithms -- Fast online multiplication of real numbers -- The operators min and max on the polynomial hierarchy -- Resource-bounded kolmogorov complexity revisited -- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations -- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes -- MODp-tests, almost independence and small probability spaces -- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification -- Temporal logics for the specification of performance and reliability -- Efficient scaling-invariant checking of timed bisimulation -- Gossiping and broadcasting versus computing functions in networks -- On the descriptive and algorithmic power of parity ordered binary decision diagrams -- A reducibility concept for problems defined in terms of ordered binary decision diagrams -- On the classification of computable languages -- A conditional-logical approach to minimum cross-entropy -- Undecidability results on two-variable logics -- Methods and applications of (max,+) linear algebra -- Regular expressions and context-free grammars for picture languages -- Measuring nondeterminism in pushdown automata -- On polynomially D verbose sets -- A downward translation in the polynomial hierarchy -- Strict sequential P-completeness -- An unambiguous class possessing a complete set -- Deadlock-free interval routing schemes -- Power consumption in packet radio networks -- Thecomplexity of generating test instances -- Efficient constructions of Hitting Sets for systems of linear functions -- Protocols for collusion-secure asymmetric fingerprinting -- Minimal transition systems for history-preserving bisimulation -- On ergodic linear cellular automata over Zm -- Intrinsic universality of a 1-dimensional reversible Cellular Automaton -- The computational complexity of some problems of linear algebra -- Algebraic and logical characterizations of deterministic linear time classes -- Finding the k shortest paths in parallel -- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs -- Distance approximating spanning trees -- A better upper bound on the bisection width of de Bruijn networks -- An information-theoretic treatment of random-self-reducibility -- Equivalence of measures of complexity classes -- Better algorithms for minimum weight vertex-connectivity problems -- RNC-approximation algorithms for the steiner problem -- Pattern matching in trace monoids -- Removing ?-transitions in timed automata -- Probabilistic proof systems — A survey. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Compilers (Computer programs). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| General subdivision | Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Programming Techniques. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Compilers and Interpreters. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Reischuk, Rüdiger. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Morvan, Michel. |
| Relator term | editor. |
| Relator code | edt |
| -- | http://id.loc.gov/vocabulary/relators/edt |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783540626169 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783662186329 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 1611-3349 ; |
| Volume number/sequential designation | 1200 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/BFb0023443">https://doi.org/10.1007/BFb0023443</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 912 ## - | |
| -- | ZDB-2-BAE |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.