Lecture Notes in Computer Science

14th Annual Symposium on Theoretical Aspects of Computer Science, L¼beck, Germany, February 27 - March 1, 1997 Proceedings

By: RÃ¼diger Reischuk (Editor), Michel Morvan (Editor)

Write A Review

Paperback | 21 February 1997

At a Glance

Paperback
636 Pages

Dimensions(cm)
22.86 x 15.88 x 1.91

Paperback

$169.75

or 4 interest-free payments of $42.44 with

or

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

More in Discrete Mathematics

Discrete Mathematics for Computing

Grassroots

Paperback

RRP $150.00

$135.75

Discrete Mathematics with Applications, Metric Edition

5th edition

Paperback

RRP $184.95

$148.75

20%
OFF

Topics in Mathematical Modeling by Difference Equations

With Mathematica

Hardcover

RRP $194.00

$171.75

11%
OFF

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Hardcover

RRP $173.00

$153.99

11%
OFF

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Paperback

RRP $132.99

$110.75

17%
OFF

Introduction to Modern Cryptography

Revised Third Edition

Hardcover

RRP $252.00

$209.75

17%
OFF

Business Process Analytics : Modeling, Simulation and Design - Manuel Laguna

$161.75

From Christoffel Words To Markoff Numbers 2E Cloth - Christophe Reutenauer

$83.75

27%
OFF

Synthetic Media, Deepfakes, and Cyber Deception : Attacks, Analysis, and Defenses - Cameron H., JD, CISSP Malin

$103.75

14%
OFF

New Probes into Discrete and Convex Geometry : Bolyai Society Mathematical Studies - Geza Toth

$59.75

15%
OFF

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Hardcover

RRP $263.00

$262.75

Electromagnetics Through the Finite Element Method

From Maxwell's Equations to Code

Hardcover

RRP $263.00

$192.75

27%
OFF

Chapman & Hall/CRC Cryptography and Network Security : Chapman & Hall/Crc Cryptography and Network Security - Jonathan Katz

$117.99

16%
OFF

Unifying Models	p. 1
Predecessor Queries in Dynamic Integer Sets	p. 21
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs	p. 33
Greibach Normal Form Transformation, Revisited	p. 47
Translating Regular Expressions into Small [epsilon]-Free Nondeterministic Finite Automata	p. 55
Memory Management for Union-Find Algorithms	p. 67
Fast Online Multiplication of Real Numbers	p. 81
The Operators min and max on the Polynomial Hierarchy	p. 93
Resource-Bounded Kolmogorov Complexity Revisited	p. 105
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations	p. 117
Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes	p. 129
MOD[subscript p]-tests, Almost Independence and Small Probability Spaces	p. 141
Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification	p. 153
Temporal Logics for the Specification of Performance and Reliability	p. 165
Efficient Scaling-Invariant Checking of Timed Bisimulation	p. 177
Gossiping and Broadcasting versus Computing Functions in Networks	p. 189
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams	p. 201
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams	p. 213
On the Classification of Computable Languages	p. 225
A Conditional-Logical Approach to Minimum Cross-Entropy	p. 237
Undecidability Results on Two-Variable Logics	p. 249
Methods and Applications of (max,+) Linear Algebra	p. 261
Regular Expressions and Context-Free Grammars for Picture Languages	p. 283
Measuring Nondeterminism in Pushdown Automata	p. 295
On Polynomially D-Verbose Sets	p. 307
A Downward Translation in the Polynomial Hierarchy	p. 319
Strict Sequential P-completeness	p. 329
An Unambiguous Class Possessing a Complete Set	p. 339
Deadlock-Free Interval Routing Schemes	p. 351
Power Consumption in Packet Radio Networks	p. 363
The Complexity of Generating Test Instances	p. 375
Efficient Construction of Hitting Sets for Systems of Linear Functions	p. 387
Protocols for Collusion-Secure Asymmetric Fingerprinting	p. 399
Minimal Transition Systems for History-Preserving Bisimulation	p. 413
On Ergodic Linear Cellular Automata over Z[subscript m]	p. 427
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton	p. 439
The Computational Complexity of Some Problems of Linear Algebra	p. 451
Algebraic and Logical Characterizations of Deterministic Linear Time Classes	p. 463
Finding the k Shortest Paths in Parallel	p. 475
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs	p. 487
Distance Approximating Spanning Trees	p. 499
A Better Upper Bound on the Bisection Width of de Bruijn Networks	p. 511
An Information-Theoretic Treatment of Random-Self-Reducibility	p. 523
Equivalence of Measures of Complexity Classes	p. 535
Better Algorithms for Minimum Weight Vertex-Connectivity Problems	p. 547
RNC-Approximation Algorithms for the Steiner Problem	p. 559
Pattern Matching in Trace Monoids	p. 571
Removing [epsilon]-Transitions in Timed Automata	p. 583
Probabilistic Proof Systems - A Survey	p. 595
List of Authors	p. 613
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

14th Annual Symposium on Theoretical Aspects of Computer Science, L¼beck, Germany, February 27 - March 1, 1997 Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Discrete Mathematics

Discrete Mathematics for Computing

Grassroots

Discrete Mathematics with Applications, Metric Edition

5th edition

Topics in Mathematical Modeling by Difference Equations

With Mathematica

The Green Crypto Handbook

Blockchain for Sustainability Professionals

Introduction to Mathematical Logic

Discrete Mathematics and Its Applications

Introduction to Modern Cryptography

Revised Third Edition

Business Process Analytics

Modeling, Simulation and Design

Marxian Economics

A New Japanese Tradition

Discrete Mathematics and Its Applications

2025 Release ISE

From Christoffel Words To Markoff Numbers 2E Cloth

Geometry of Frameworks

Compact Textbooks in Mathematics

Axiomatic Set Theory

An Introduction

The Algebra of Code, Volume 1

Explore Set Theory, Abstract Algebra, and Category Theory with Functional Programming

Synthetic Media, Deepfakes, and Cyber Deception

Attacks, Analysis, and Defenses

An Introduction to Single-User Information Theory

Springer Undergraduate Texts in Mathematics and Technology

Emergence and Phase Transitions in Uniform Random Graphs

London Mathematical Society Lecture Note Series

New Probes into Discrete and Convex Geometry

Bolyai Society Mathematical Studies

Book of Proof

Parabolic Problems

60 Years of Mathematical Puzzles in Parabola

Reading Randomness I

New Horizons for Understanding Fractal and Fractional Calculus

Electromagnetics Through the Finite Element Method

From Maxwell's Equations to Code

Chapman & Hall/CRC Cryptography and Network Security

Chapman & Hall/Crc Cryptography and Network Security

Introduction to Quantum Cryptography

CISSP Study Guide

Syngress

This product is categorised by