FSTTCS 2004

Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings

By: Kamal Lodaya (Editor), Meena Mahajan (Editor)

Write A Review

Paperback | 2 December 2004

Sorry, we are not able to source the book you are looking for right now.

We did a search for other books with a similar title, however there were no matches. You can try selecting from a similar category, click on the author's name, or use the search box above to find your book.

The international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS) is the longest-running conference on computer science in India, and is organized under the aegis of the Indian As- ciation for Research in Computing Science, IARCS. Since its inception in 1981, the conference (held annually in the month of December) has helped in nurt- ing and creating an environment for the exchange of ideas amongst the research community in the country, by attracting top scientists around the world to the conference. This volume contains the proceedings of the 24th FSTTCS conf- ence held in December 2004. A strong point of the FSTTCS programmes has been excellent invited talks by eminent computer scientists of international renown. Continuing this t- dition, this FSTTCS featured invited talks by Javier Esparza, Piotr Indyk, Pavel A. Pevzner, John C. Reynolds, and Denis Th´ erien. We thank our invited speakers for readily agreeing to come to FSTTCS, and for providing write-ups for the proceedings. It is our pleasure that IARCS chose to honor Prof. Rani Siromoney at this conference, on the occasion of her 75th birthday. The in?uence she has wielded (and the impact she has exerted) in Indian theoretical computer science is tremendous, and the tribute is ?tting and richly deserved. We thank R.K. Sh- masundar for chairing the special session in her honor, and Kamala Krithivasan and K.G. Subramanian for speaking at the session.

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 $89.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 Computer Programming & Software Development Programming & Scripting Languages Software Engineering Mathematics Mathematical Foundation Mathematical Logic Databases Data Capture & Analysis

Algorithms & Data Structures Compilers & Interpreters

Genome halving problem revisited	p. 1
Verifying probabilistic procedural programs	p. 16
Streaming algorithms for geometric problems	p. 32
Toward a grainless semantics for shared-variable concurrency	p. 35
Regular languages, unambiguous concatenation and computational complexity	p. 49
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets	p. 58
On the urgency expressiveness	p. 71
Asynchronous automata-theoretic characterization of aperiodic trace languages	p. 84
A decidable fragment of separation logic	p. 97
Approximate range searching using binary space partitions	p. 110
Representable disjoint NP-pairs	p. 122
Symbolic reachability analysis of higher-order context-free processes	p. 135
Optimal strategies in priced timed game automata	p. 148
A calculus for trust management	p. 161
Short-cuts on star, source and planar unfoldings	p. 174
Subdividing alpha complex	p. 186
Real-counter automata and their decision problems	p. 198
Adjunct elimination through games in static ambient logic	p. 211
On the bisimulation invariant fragment of monadic [Sigma][subscript 1] in the finite	p. 224
On the complexity of Hilbert's 17th problem	p. 237
Who is pointing when to whom?	p. 250
An almost linear time approximation algorithm for the permanent of a random (0-1) matrix	p. 263
Distributed games with causal memory are decidable for series-parallel systems	p. 275
Expand, enlarge, and check : new algorithms for the coverability problem of WSTS	p. 287
Minimum weight pseudo-triangulations	p. 299
Join algorithms for the theory of uninterpreted functions	p. 311
No, coreset, no cry	p. 324
Hardness hypotheses, derandomization, and circuit complexity	p. 336
Improved approximation algorithms for maximum graph partitioning problems	p. 348
Learning languages from positive data and a finite number of queries	p. 360
The complexity of the local Hamiltonian problem	p. 372
Quantum and classical communication-space tradeoffs from rectangle bounds	p. 384
Adaptive stabilization of reactive protocols	p. 396
Visibly pushdown games	p. 408
Refinement and separation contexts	p. 421
Decidability of MSO theories of tree structures	p. 434
Distributed algorithms for coloring and domination in wireless ad hoc networks	p. 447
Monotone multilinear Boolean circuits for bipartite perfect matching require exponential size	p. 460
Testing geometric convexity	p. 469
Complexity of linear connectivity problems in directed hypergraphs	p. 481
Actively learning to verify safety for FIFO automata	p. 494
Reasoning about game equilibria using temporal logic	p. 506
Alternation in equational tree automata modulo XOR	p. 518
Table of Contents provided by Blackwell. All Rights Reserved.

FSTTCS 2004

Foundations of Software Technology and Theoretical Computer Science : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Architecture & Logic Design

Foundations of High Performance Computing

A Comprehensive Guide to Systems, Concepts, and Programming

Computer Architecture

A Modern Approach

Basic Computer Architecture

Making Embedded Systems

2nd Edition - Design Patterns for Great Software

Building Microservices

Designing Fine-Grained Systems 2nd Edition

Simply AI

Facts Made Fast

Architecture Patterns with Python

Enabling Test-Driven Development, Domain-Driven Design, and Event-Driven Microservices

Learning Opentelemetry

Setting Up and Operating a Modern Observability System

Computer Systems 3ed

A Programmer's Perspective, Global Edition

Augmented Software Design

A Team Exercise in Empirical Software Design

Architecting Data and Machine Learning Platforms

Enable Analytics and Ai-Driven Innovation in the Cloud

Site Reliability Engineering

How Google Runs Production Systems

Learning Microsoft Power Automate

Improving Productivity for Business Processes and Workflows

Fundamentals of Software Architecture

A Modern Engineering Approach

Fundamentals of Quantum Computing

Solving Problems with Quantum Algorithms and Practical Qiskit Coding

Introduction to Semiconductor Devices for Engineering Students

Introduction to Semiconductor Devices for Engineering Students

Organizing for Cyber Power

Offensive Cyberspace Operations and National Security

Smart Technologies for Water Sustainability and Policy

Smart Technologies for Water Engineering & Sustainability

Statistics and Data Foundations for AI

Statistics and Data Foundations for AI

Governing AI Risk—The RIVER Charter

An Enterprise Resilience Standard

Logic Synthesis for Multi-Core Counter-Based Control Units

Structural Decomposition in Logic Design

Recursive Filtering of Networked Systems with Communication Protocol Scheduling

This product is categorised by