STACS 97

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

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

Orders over $0.00 qualify for free shipping.

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.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Programming & Scripting Languages Computer Science Mathematical Theory of Computation Databases Data Capture & Analysis Mathematics Compilers & Interpreters

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.

STACS 97

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 Computer Science

Don't Burn Anyone at the Stake Today

(and other lessons from history about living through an information crisis)

The Laws of Thought

The Quest for a Mathematical Theory of the Mind

Nexus

A Brief History of Information Networks from the Stone Age to AI

Storytelling with Data

A Data Visualization Guide for Business Professionals, 10th Anniversary Edition

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Decoding Despair

How AI is Reshaping Psychiatry

The AI Cybersecurity Handbook

Hope in the Library

How Libraries Can Help Shape Our Future with Artificial Intelligence

A Practitioner's Guide to Advancing Behavioral Health Care with Artificial Intelligence

Nonparametric Statistics on Stratified Spaces and Their Applications in Object Data Analysis

Agentic AI For Dummies

For Dummies (Computer/Tech)

Application of Ergonomics in Politics

A Layperson's Approach

Artificial Intelligence for Sustainable Development

How, Why, and What Drives the Future

Digital Fashion

Artificial Intelligence, Virtual, and Other Emerging Applications

Digital Fashion

Artificial Intelligence, Virtual, and Other Emerging Applications

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Python All-in-One For Dummies

3rd Edition

Python Crash Course

3rd Edition - A Hands-On, Project-Based Introduction to Programming

Microsoft Power BI For Dummies

For Dummies (Computer/Tech)

AI for Business

A Guide to AI Adoption

AI and Data Science in Healthcare 5.0

Medical Robots and Devices: New Developments and Advances

Risk-First Software Development, Second Edition

Deliver Better Systems in a Post-Agile, AI World

This product is categorised by