FST TCS 2001

Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings

By: Ramesh Hariharan (Editor), Madhavan Mukund (Editor), V. Vinay (Editor)

Write A Review

Paperback | 28 November 2001

At a Glance

Paperback
364 Pages

Dimensions(cm)
24.13 x 15.88 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This volume contains the proceedings of the 21st international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). This year's conference attracted 73 submissions from 20 countries. Each s- mission was reviewed by at least three independent referees. In a departure from previous conferences, the ?nal selection of the papers making up the program was done through an electronic discussion spanning two weeks, without a physical meeting of the Program Committee (PC). Since the PC of FSTTCS is distributed across the globe, it is very di?cult to ?x a meeting whose time and venue is convenient for a substantial fraction of the PC. Given this, it was felt that an electronic discussion would enable all members to participate on a more equal footing in the ?nal selection. All reviews, scores, and comments were posted on a secure website, with a mechanism for making updates and automatically sending noti?cations by email to relevant members of the PC. All PC members participated actively in the discussion. The general feedback on the arrangement was very positive, so we hope to continue this in future years. We had ?ve invited speakers this year: Eric Allender, Sanjeev Arora, David Harel, Colin Stirling, and Uri Zwick. We thank them for having readily accepted our invitation to talk at the conference and for providing abstracts (and even full papers) for the proceedings.

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 Computing & I.T.Computer Science Computer Architecture & Logic Design Medicine Medicine in General Computer Programming & Software Development Algorithms & Data Structures Business Applications Mathematics Mathematical Foundation Mathematical Logic

Programming & Scripting Languages Databases Data Capture & Analysis Software Engineering

When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity	p. 1
Approximation Schemes for Geometric NP-Hard Problems: A Survey	p. 16
On Clustering Using Random Walks	p. 18
An Introduction to Decidability of DPDA Equivalence	p. 42
Semidefinite Programming Based Approximation Algorithms	p. 57
Hard Sets and Pseudo-random Generators for Constant Depth Circuits	p. 58
The First-Order Isomorphism Theorem	p. 70
Thresholds and Optimal Binary Comparison Search Trees	p. 83
Distributed LTL Model Checking Based on Negative Cycle Detection	p. 96
Computability and Complexity Results for a Spatial Assertion Language for Data Structures	p. 108
Using Nondeterminism to Design Efficient Deterministic Algorithms	p. 120
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter	p. 132
A Mechanically Verified Compiling Specification for a Lisp Compiler	p. 144
Beyond Regular Model Checking	p. 156
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity	p. 171
Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel	p. 183
List Decoding from Erasures: Bounds and Code Constructions	p. 195
Verification of a Leader Election Algorithm in Timed Asynchronous Systems	p. 207
Efficient Addition on Field Programmable Gate Arrays	p. 219
The Directed Minimum-Degree Spanning Tree Problem	p. 232
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems	p. 244
Beyond Message Sequence Graphs	p. 256
Grouping Techniquess for One Machine Scheduling Subject to Precedence Constraints	p. 268
Properties of Distributed Timed-Arc Petri Nets	p. 280
From Falsification to Verification	p. 292
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems	p. 305
Range Allocation for Equivalence Logic	p. 317
Rewrite Closure for Ground and Cancellative AC Theories	p. 334
Author Index	p. 347
Table of Contents provided by Blackwell. All Rights Reserved.

FST TCS 2001

Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

Python Crash Course

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

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

The AI Con

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

The Tech Coup

How to Save Democracy from Silicon Valley

Nexus

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

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

Creative Machines

AI, Art & Us

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

Empire of AI

Inside the reckless race for total domination

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Python All-in-One For Dummies

3rd Edition

Artificial Intelligence and Human Rights, Democracy, and the Rule of Law

Computational Intelligence Techniques

The Shortest History of AI

Ideal Subjects Volume 76

The Abstract People of AI

Ideal Subjects Volume 76

The Abstract People of AI

Scary Smart

The Future of Artificial Intelligence and How You Can Save Our World

Advances in Practical Applications of Agents, Multi-Agent Systems, and Computational Social Science

The PAAMS Collection : 23rd International Conference, PAAMS 2025, Lille, France, June 25-27, 2025, Proceedings

AI 2025

Advances in Artificial Intelligence : 38th Australasian Joint Conference on Artificial Intelligence, AI 2025, Canberra, ACT, Australia, December 1-5, 2025, Proceedings, Part II

Life 3.0

Being Human in the Age of Artificial Intelligence

Hands-On Machine Learning with Scikit-Learn and PyTorch

Concepts, Tools, and Techniques to Build Intelligent Systems

Storytelling with Data

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

Effective Modern C++

42 Specific Ways to Improve Your Use of C++11 And C++14

Co-Intelligence

Living and Working with AI

Soft Design

Aesthetic Experience at the Intersection of Materials, Technology & Interaction

This product is categorised by