STACS 2002

19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings

By: Helmut Alt (Editor), Afonso Ferreira (Editor)

Write A Review

Paperback | 27 February 2002

At a Glance

Paperback
680 Pages

Dimensions(cm)
22.86 x 15.24 x 3.18

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

The Symposium on Theoretical Aspects of Computer Science (STACS) has - come one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of - undationsofcomputerscience:algorithmsanddatastructures,automataand formal languages, computational and structural complexity, logic, veri?cation, and current challenges. STACS 2002, the 19th in this series, was held in Antibes - Juan les Pins, on the French Riviera, March 14-16, 2002. Previous STACS symposia took place in Paris (1984), Saarbruc ¨ ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg ¨ (1993), Caen (1994), Munc ¨ hen (1995), Grenoble (1996), Lub ¨ eck (1997), Paris, (1998), Trier (1999), Lille (2000), and Dresden (2001). The proceedings of all these symposia have been published in the Lecture Notes in Computer Science series of Springer-Verlag. STACS 2002 received 209 submissions from 30 countries, one of the highest numbers of submissions ever, for a European conference on theoretical computer science. They were dispatched to the Program Committee members, and - derwent a thorough review process, where more than 900 reports were written. These reports then served as guidance to the Program Committee, which met on November 16-17, 2001, at the INRIA Sophia Antipolis (near Antibes), France, in order to select the conference program.

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 $79.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 Medicine Medicine in General Computing & I.T.Computer Science Mathematical Theory of Computation Graphical & Digital Media Applications 3D Graphics & Modelling Databases Data Capture & Analysis Mathematics Artificial Intelligence

Natural Language & Machine Translation

Invited Papers
Hyper-Encryption and Everlasting Security	p. 1
Models and Techniques for Communication in Dynamic Networks	p. 27
What Is a Theory?	p. 50
Algorithms
A Space Lower Bound for Routing in Trees	p. 65
Labeling Schemes for Dynamic Tree Networks	p. 76
Tight Bounds for the Performance of Longest-in-System on DAGs	p. 88
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling	p. 100
Balanced Coloring: Equally Easy for All Numbers of Colors?	p. 112
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3	p. 121
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets	p. 133
On Dualization in Products of Forests	p. 142
An Asymptotic <$>{cal O}<$>(ln / ln ln )-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs	p. 154
Scheduling at Twilight the Easy Way	p. 166
Complexity of Multi-dimensional Loop Alignment	p. 179
A Probabilistic 3-SAT Algorithm Further Improved	p. 192
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations	p. 203
Randomized Acceleration of Fundamental Matrix Computations	p. 215
Approximations for ATSP with Parametrized Triangle Inequality	p. 227
A New Diagram from Disks in the Plane	p. 238
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles	p. 250
Current Challenges
On the Parameterized Intractability of Closest Substring and Related Problems	p. 262
On the Complexity of Protein Similarity Search under mRNA Structure Constraints	p. 274
Pure Dominance Constraints	p. 287
Improved Quantum Communication Complexity Bounds for Disjointness and Equality	p. 299
On Quantum Computation with Some Restricted Amplitudes	p. 311
A Quantum Goldreich-Levin Theorem with Cryptographic Applications	p. 323
On Quantum and Approximate Privacy	p. 335
On Quantum Versions of the Yao Principle	p. 347
Computational and Structural Complexity
Describing Parameterized Complexity Classes	p. 359
On the Computational Power of Boolean Decision Lists	p. 372
How Many Missing Answers Can Be Tolerated by Query Learners?	p. 384
Games with a Uniqueness Property	p. 396
Bi-Immunity Separates Strong NP-Completeness Notions	p. 408
Complexity of Semi-algebraic Proofs	p. 419
A Lower Bound Technique for Restricted Branching Programs and Applications	p. 431
The Complexity of Constraints on Intervals and Lengths	p. 443
Automata and Formal Languages
Nesting Until and Since in Linear Temporal Logic	p. 455
Comparing Verboseness for Finite Automata and Turing Machines	p. 465
On the Average Parallelism in Trace Monoids	p. 477
A Further Step towards a Theory of Regular MSC Languages	p. 489
Existential and Positive Theories of Equations in Graph Products	p. 501
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL	p. 513
Recognizable Sets of Message Sequence Charts	p. 523
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard	p. 535
On the Enumerative Sequences of Regular Languages on k Symbols	p. 547
Logic in Computer Science
Ground Tree Rewriting Graphs of Bounded Tree Width	p. 559
Timed Control Synthesis for External Specifications	p. 571
Axiomatizing GSOS with Termination	p. 583
Axiomatising Tree-Interpretable Structures	p. 596
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity	p. 608
A Parametric Analysis of the State Explosion Problem in Model Checking	p. 620
Generalized Model-Checking over Locally Tree-Decomposable Classes	p. 632
Learnability and Definability in Trees and Similar Structures	p. 645
Author Index	p. 659
Table of Contents provided by Publisher. All Rights Reserved.

STACS 2002

19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Natural Language & Machine Translation

How To Think About AI

A Guide For The Perplexed

Hands-On Large Language Models

Language Understanding and Generation

Introduction to Machine Learning with Python

A Guide for Data Scientists

Scaling Responsible AI

From Enthusiasm to Execution

ChatGPT For Dummies

For Dummies (Computer/Tech)

Artificial Intelligence for HR

Use AI to Support and Develop a Successful Workforce

The Ultimate ChatGPT Prompt Book

750+ Expert Prompts to Boost Productivity, Unlock Creative Potential, and Simplify Tasks

The Scaling Era

An Oral History of AI, 2019-2025

AI Engineering

Building Applications with Foundation Models

Machine Learning Pocket Reference

Working with Structured Data in Python

Learning LangChain

Building AI and LLM Applications with LangChain and LangGraph

Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow 3e

Concepts, Tools, and Techniques to Build Intelligent Systems

Think Python

How To Think Like a Computer Scientist

Generative AI on Aws

Building Context-Aware Multimodal Reasoning Applications

AI Systems Performance Engineering

Optimizing Model Training and Inference Workloads with Gpus, Cuda, and Pytorch

Translation Tools and Technologies

Routledge Introductions to Translation and Interpreting

Acting

Keywords and Concepts

Acting

Keywords and Concepts

Recent Advances in Computational Methods in Science and Technology

Volume 1

The AI Glossary

AI and Emerging Tech Explained - 256 Key Concepts for Students, Professionals & Curious Minds

Recent Advances in Computational Methods in Science and Technology

Volume 2

Federated Learning for Healthcare

Applications with Case Studies

Perceptive Machines

The Future of Feeling AI and What It Means for Humanity

Perceptive Machines

The Future of Feeling AI and What It Means for Humanity

This product is categorised by