37%
Automata, Languages, and Programming

Automata, Languages, and Programming

          
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

Invited Talks.- Sporadic Solutions to Zero-One Exclusion Tasks.- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution).- Track A: Algorithms, Complexity, and Games Weak Parity.- Consequences of Faster Alignment of Sequences.- Distance Labels with Optimal Local Stretch.- Time-Expanded Packings.- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average.- Tighter Relations between Sensitivity and Other Complexity Measures.- On Hardness of Jumbled Indexing.- Morphing Planar Graph Drawings Optimally.- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs.- On the Role of Shared Randomness in Simultaneous Communication.- Short PCPs with Projection Queries.- Star Partitions of Perfect Graphs.- Coordination Mechanisms for Selfish Routing over Time on a Tree.- On Area-Optimal Planar Graph Drawings.- Shortest Two Disjoint Paths in Polynomial Time.- Listing Triangles.- On DNF Approximators for Monotone Boolean Functions.- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs.- Holographic Algorithms Beyond Matchgates.- Testing Probability Distributions Underlying Aggregated Data.- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost.- The Bose-Hubbard Model is QMA-complete.- Characterization of Binary Constraint System Games.- Fast Algorithms for Constructing Maximum Entropy Summary Trees.- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems.- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile.- Canadians Should Travel Randomly.- Efficiency Guarantees in Auctions with Budgets.- Parameterized Complexity of Bandwidth on Trees.- Testing Equivalence of Polynomials under Shifts.- Optimal Analysis of Best Fit Bin Packing.- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract).- Online Stochastic Reordering Buffer Scheduling.- Demand Queries with Preprocessing.- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs.- Public vs Private Coin in Bounded-Round Information.- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations.- Improved Submatrix Maximum Queries in Monge Matrices.- For-All Sparse Recovery in Near-Optimal Time.- Families with Infants: A General Approach to Solve Hard Partition Problems.- Changing Bases: Multistage Optimization for Matroids and Matchings.- Problems.- Nearly Linear-Time Model-Based Compressive Sensing.- Breaking the PPSZ Barrier for Unique 3-SAT.- Privately Solving Linear Programs.- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.- Partial Garbling Schemes and Their Applications.- On the Complexity of Trial and Error for Constraint Satisfaction Problems.- Information Theoretical Cryptogenography.- The Complexity of Somewhat Approximation Resistant Predicates.- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound.- Distance Oracles for Time-Dependent Networks.- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields.- Coloring Relatives of Interval Overlap Graphs via On-line Games.- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model.- Parameterized Approximation Schemes Using Graph Widths.- FPTAS for Weighted Fibonacci Gates and Its Applications.- Parameterized Algorithms to Preserve Connectivity.- Nonuniform Graph Partitioning with Unrelated Weights.- Precedence-Constrained Scheduling of Malleable Jobs with Preemption.- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability.- QCSP on Semicomplete Digraphs.- Fast Ps


Best Sellers



Product Details
  • ISBN-13: 9783662439470
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Depth: 57
  • Height: 234 mm
  • No of Pages: 1090
  • Series Title: Lecture Notes in Computer Science / Advanced Research in Computing and Software Science
  • Sub Title: 41st International Colloquium, Icalp 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
  • Width: 156 mm
  • ISBN-10: 3662439476
  • Publisher Date: 24 Jun 2014
  • Binding: Paperback
  • Edition: 2014 ed.
  • Language: English
  • Returnable: N
  • Spine Width: 56 mm
  • Weight: 1544 gr


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
Springer -
Automata, Languages, and Programming
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

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!