Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
33
views
0
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,918
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Automata, Languages, and Programming
other
Editor(s):
Javier Esparza
,
Pierre Fraigniaud
,
Thore Husfeldt
,
Elias Koutsoupias
Publication date
(Print):
2014
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Author and book information
Book
ISBN (Print):
978-3-662-43947-0
ISBN (Electronic):
978-3-662-43948-7
Publication date (Print):
2014
DOI:
10.1007/978-3-662-43948-7
SO-VID:
cb9f5fdf-12b4-4a87-a97b-ed78b9cdcf28
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Sporadic Solutions to Zero-One Exclusion Tasks
pp. 11
Verifying and Synthesizing Software with Recursive Functions
pp. 26
Weak Parity
pp. 52
Distance Labels with Optimal Local Stretch
pp. 64
Time-Expanded Packings
pp. 77
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
pp. 89
The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average
pp. 101
Tighter Relations between Sensitivity and Other Complexity Measures
pp. 114
On Hardness of Jumbled Indexing
pp. 126
Morphing Planar Graph Drawings Optimally
pp. 138
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
pp. 150
On the Role of Shared Randomness in Simultaneous Communication
pp. 163
Short PCPs with Projection Queries
pp. 174
Star Partitions of Perfect Graphs
pp. 186
Coordination Mechanisms for Selfish Routing over Time on a Tree
pp. 198
On Area-Optimal Planar Graph Drawings
pp. 211
Shortest Two Disjoint Paths in Polynomial Time
pp. 223
Listing Triangles
pp. 235
On DNF Approximators for Monotone Boolean Functions
pp. 247
Internal DLA: Efficient Simulation of a Physical Growth Model
pp. 259
Lower Bounds for Approximate LDCs
pp. 271
Holographic Algorithms Beyond Matchgates
pp. 283
Testing Probability Distributions Underlying Aggregated Data
pp. 296
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
pp. 320
Characterization of Binary Constraint System Games
pp. 332
Fast Algorithms for Constructing Maximum Entropy Summary Trees
pp. 344
Thorp Shuffling, Butterflies, and Non-Markovian Couplings
pp. 356
Dynamic Complexity of Directed Reachability and Other Problems
pp. 368
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
pp. 380
Canadians Should Travel Randomly
pp. 392
Efficiency Guarantees in Auctions with Budgets
pp. 405
Parameterized Complexity of Bandwidth on Trees
pp. 417
Testing Equivalence of Polynomials under Shifts
pp. 429
Optimal Analysis of Best Fit Bin Packing
pp. 442
Light Spanners
pp. 453
Semi-Streaming Set Cover
pp. 465
Online Stochastic Reordering Buffer Scheduling
pp. 477
Demand Queries with Preprocessing
pp. 489
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
pp. 502
Public vs Private Coin in Bounded-Round Information
pp. 514
En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
pp. 525
Improved Submatrix Maximum Queries in Monge Matrices
pp. 538
For-All Sparse Recovery in Near-Optimal Time
pp. 551
Families with Infants: A General Approach to Solve Hard Partition Problems
pp. 563
Changing Bases: Multistage Optimization for Matroids and Matchings
pp. 576
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
pp. 588
Nearly Linear-Time Model-Based Compressive Sensing
pp. 600
Breaking the PPSZ Barrier for Unique 3-SAT
pp. 612
Privately Solving Linear Programs
pp. 625
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
pp. 637
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not
pp. 650
Partial Garbling Schemes and Their Applications
pp. 663
On the Complexity of Trial and Error for Constraint Satisfaction Problems
pp. 676
Information Theoretical Cryptogenography
pp. 689
The Complexity of Somewhat Approximation Resistant Predicates
pp. 701
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound
pp. 713
Distance Oracles for Time-Dependent Networks
pp. 726
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
pp. 738
Coloring Relatives of Interval Overlap Graphs via On-line Games
pp. 751
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
pp. 763
Testing Forest-Isomorphism in the Adjacency List Model
pp. 775
Parameterized Approximation Schemes Using Graph Widths
pp. 787
FPTAS for Weighted Fibonacci Gates and Its Applications
pp. 800
Parameterized Algorithms to Preserve Connectivity
pp. 812
Nonuniform Graph Partitioning with Unrelated Weights
pp. 823
Precedence-Constrained Scheduling of Malleable Jobs with Preemption
pp. 835
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability
pp. 847
QCSP on Semicomplete Digraphs
pp. 859
Fast Pseudorandomness for Independence and Load Balancing
pp. 871
Determining Majority in Networks with Local Interactions and Very Small Local Memory
pp. 883
Lower Bounds for Oblivious Subspace Embeddings
pp. 895
On Input Indistinguishable Proof Systems
pp. 907
Secure Computation Using Leaky Tokens
pp. 919
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem
pp. 931
A Faster Parameterized Algorithm for Treedepth
pp. 943
Pseudorandom Graphs in Data Structures
pp. 955
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications
pp. 967
The Mondshein Sequence
pp. 979
Balanced Allocations: A Simple Proof for the Heavily Loaded Case
pp. 991
Close to Uniform Prime Number Generation with Fewer Random Bits
pp. 1003
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
pp. 1015
Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem
pp. 1027
On Learning, Lower Bounds and (un)Keeping Promises
pp. 1039
Certificates in Data Structures
pp. 1051
Optimal Query Complexity for Estimating the Trace of a Matrix
pp. 1063
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
pp. 1075
Spatial Mixing of Coloring Random Graphs
Similar content
3,918
Online recognition of human activities and adaptation to habit changes by means of learning automata and fuzzy temporal windows
Authors:
M Ros
,
M.P. Cuellar
,
M Delgado
…
Sparse thermal data for cellular automata modeling of grain structure in additive manufacturing
Authors:
Matthew Rolchigo
,
Benjamin Stump
,
James Belak
…
Integrated 2D cellular automata-phase field modeling of solidification and microstructure evolution during additive manufacturing of Ti6Al4V
Authors:
Shunyu LIU
,
Yung C. Shin
,
S LIU
…
See all similar
Cited by
1
Separating quantum communication and approximate rank
Authors:
Anurag Anshu
,
Shalev Ben-David
,
Ankit Garg
…
See all cited by