Home > Computing and Information Technology > Computer science > Artificial intelligence > Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)
37%
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)

Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This volume contains the contributions of the 29th International Colloquium on Automata, Languages, and Programming (ICALP) held July8-13, 2002 in M'alaga, Spain. The diversityand the qualityof the scienti?c program of ICALP 2002 serve as evidence that theoretical computer science with all its aspects continues to be a vibrant ?eld and is increasinglyturning into a valuable and abundant source of ideas and concepts for other research disciplines and app- cations. ICALP has been the main annual scienti?c event of the European Assoc- tion for Theoretical Computer Science (EATCS) for almost thirtyyears, making ICALP one of the best-established conferences in theoretical computer science and EATCS one of the world's largest and oldest theoretical computer science organizations. To re?ect the two parts of the EATCS journal Theoretical Computer Science (TCS), ICALP's technical program is split into two parts: while track A is - voted to algorithms, automata, complexity, and games, track B focuses on logic, semantics, and theoryof programming.

Table of Contents:
Invited Talks.- Molecular Assembly and Computation: From Theory to Experimental Demonstrations.- Towards a Predictive Computational Complexity Theory.- Equivariant Syntax and Semantics.- L(A) = L(B)? Decidability Results from Complete Formal Systems.- Discrete Tomography: Reconstruction under Periodicity Constraints.- Local and Global Methods in Data Mining: Basic Techniques and Open Problems.- Program Debugging and Validation Using Semantic Approximations and Partial Specifications.- Best Papers.- Inapproximability Results for Equations over Finite Groups.- A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs.- On Families of Graphs Having a Decidable First Order Theory with Reachability.- Contributions.- Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet.- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.- Control Message Aggregation in Group Communication Protocols.- Church-Rosser Languages vs. UCFL.- Intersection of Regular Languages and Star Hierarchy.- On the Construction of Reversible Automata for Reversible Languages.- Priority Queues, Pairing, and Adaptive Sorting.- Exponential Structures for Efficient Cache-Oblivious Algorithms.- Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations.- On the Complexity of Resolution with Bounded Conjunctions.- Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes.- Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials.- Exponential Lower Bound for Static Semi-algebraic Proofs.- Paths Problems in Symmetric Logarithmic Space.- Scheduling Search Procedures.- Removable Online Knapsack Problems.- New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.- TheQuest for Small Universal Cellular Automata.- Hyperbolic Recognition by Graph Automata.- Quantum and Stochastic Branching Programs of Bounded Width.- Spanning Trees with Bounded Number of Branch Vertices.- Energy Optimal Routing in Radio Networks Using Geometric Data Structures.- Gossiping with Bounded Size Messages in ad hoc Radio Networks.- The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences.- The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.- Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.- Cache Oblivious Distribution Sweeping.- One-Probe Search.- New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems.- Measuring the Probabilistic Powerdomain.- Games Characterizing Levy-Longo Trees.- Comparing Functional Paradigms for Exact Real-Number Computation.- Random Sampling from Boltzmann Principles.- On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures.- Bialgebraic Modelling of Timed Processes.- Testing Labelled Markov Processes.- Why Computational Complexity Requires Stricter Martingales.- Correspondence Principles for Effective Dimensions.- A Total Approach to Partial Algebraic Specification.- Axiomatising Divergence.- A Spatial Logic for Querying Graphs.- Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network.- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.- Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths.- Synthesis of Uninitialized Systems.- Infinite-State High-Level MSCs: Model-Checking and Realizability.- Universal Inherence of Cycle-Free Context-Free Ambiguity Functions.- Histogramming Data Streams with Fast Per-Item Processing.- Finding Frequent Items in Data Streams.- Symbolic Strategy Synthesis for Games on Pushdown Graphs.- Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard.- Solving the String Statistics Problem in Time (nlogn).- A PTAS for Distinguishing (Sub)string Selection.- On the Theory of One-Step Rewriting in Trace Monoids.- Navigating with a Browser.- Improved Results for Stackelberg Scheduling Strategies.- Call Control in Rings.- Preemptive Scheduling in Overloaded Systems.- The Equivalence Problem of Finite Substitutions on ab*c, with Applications.- Deciding DPDA Equivalence Is Primitive Recursive.- Two-Way Alternating Automata and Finite Models.- Approximating Huffman Codes in Parallel.- Seamless Integration of Parallelism and Memory Hierarchy.- The Communication Complexity of Approximate Set Packing and Covering.- Antirandomizing the Wrong Game.- Fast Universalization of Investment Strategies with Provably Good Relative Returns.- Randomized Pursuit-Evasion in Graphs.- The Essence of Principal Typings.- Complete and Tractable Local Linear Time Temporal Logics over Traces.- An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces.- Random Numbers and an Incomplete Immune Recursive Set.- A Banach-Mazur Computable But Not Markov Computable Function on the Computable Real Numbers.- Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.- Finding a Path of Superlogarithmic Length.- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.- Improved Inapproximability Results for Vertex Cover on k-Uniform Hypergraphs.- Efficient Testing of Hypergraphs.- Optimal Net Surface Problems with Applications.- Wagner’s Theorem on Realizers.- Circular Arrangements.


Best Sellers


Product Details
  • ISBN-13: 9783540438649
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 1072
  • Returnable: Y
  • Spine Width: 55 mm
  • Weight: 1499 gr
  • ISBN-10: 3540438645
  • Publisher Date: 26 Jun 2002
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 2380 Lecture Notes in Computer Science
  • Sub Title: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Automata, Languages and Programming: 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings(2380 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA