E-Books durchsuchen

New Developments in Quantum Algorithms

Persistent Homology under Non-uniform Error

Information Complexity of Online Problems

Algorithmic Lower Bounds for Problems on Decomposable Graphs

Do We Really Understand the Crossing Numbers?

Balanced Queries: Divide and Conquer

Slowly Synchronizing Automata and Digraphs

Weights of Exact Threshold Functions

Proof Systems and Transformation Games

Scheduling Real-Time Mixed-Criticality Jobs

A <Emphasis Type="SmallCaps">dexptime</Emphasis>-Complete Dolev-Yao Theory with Distributive Encryption

On Problem Kernels for Possible Winner Determination under the <Emphasis Type="Italic">k</Emphasis>-Approval Protocol

Counting Minimum (<Emphasis Type="Italic">s</Emphasis>,<Emphasis Type="Italic">t</Emphasis>)-Cuts in Weighted Planar Graphs in Polynomial Time

Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree

Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems

Distance Constraint Satisfaction Problems

Faster Algorithms on Branch and Clique Decompositions

Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks

Robust Computations with Dynamical Systems

On Factor Universality in Symbolic Spaces

Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity

Resource Combinatory Algebras

Randomness for Free

Qualitative Analysis of Partially-Observable Markov Decision Processes

All Symmetric Predicates in <Emphasis Type="Italic">NSPACE</Emphasis>(<Emphasis Type="Italic">n</Emphasis> <Superscript>2</Superscript>) Are Stably Computable by the Mediated Population Protocol Model

Online Clustering with Variable Sized Clusters

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains

Counting Classes and the Fine Structure between <Emphasis FontCategory="SansSerif">NC</Emphasis> <Superscript>1</Superscript> and <Emphasis FontCategory="SansSerif">L</Emphasis>

The Average Complexity of Moore’s State Minimization Algorithm Is <Emphasis Type="Italic">O</Emphasis>( <Emphasis Type="Italic">n</Emphasis> loglog<Emphasis Type="Italic">n</Emphasis>)

Connected Searching of Weighted Trees

Iterated Regret Minimization in Game Graphs

Properties of Visibly Pushdown Transducers

Second-Order Algebraic Theories

Frame Definability for Classes of Trees in the <Emphasis Type="Italic">μ</Emphasis>-calculus

Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model

Finding and Counting Vertex-Colored Subtrees

Limiting Negations in Bounded Treewidth and Upward Planar Circuits

On the Topological Complexity of MSO+U and Related Automata Models

Least and Greatest Solutions of Equations over Sets of Integers

Improved Simulation of Nondeterministic Turing Machines

The Prize-Collecting Edge Dominating Set Problem in Trees

The Multivariate Resultant Is <Emphasis FontCategory="SansSerif">NP</Emphasis>-hard in Any Characteristic

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

Meta-Envy-Free Cake-Cutting Protocols

Two Variables and Two Successors

Harnessing <Emphasis FontCategory="SansSerif">ML</Emphasis> <Superscript>F</Superscript> with the Power of System <Emphasis FontCategory="SansSerif">F</Emphasis>

Describing Average- and Longtime-Behavior by Weighted MSO Logics

Solving <Emphasis Type="SmallCaps">minones-2-sat</Emphasis> as Fast as <Emphasis Type="SmallCaps">vertex cover</Emphasis>

Unambiguous Finite Automata over a Unary Alphabet

The Complexity of Finding Reset Words in Finite Automata

Does Treewidth Help in Modal Satisfiability?

Asynchronous Omega-Regular Games with Partial Information

Parity Games with Partial Information Played on Graphs of Bounded Complexity

Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets

Enumeration of the Monomials of a Polynomial and Related Complexity Classes

Faster Approximation Schemes and Parameterized Algorithms on <Emphasis Type="Italic">H</Emphasis>-Minor-Free and Odd-Minor-Free Graphs

Semi-linear Parikh Images of Regular Expressions via Reduction

Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds

Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences

Counting Dependent and Independent Strings

Impossibility of Independence Amplification in Kolmogorov Complexity Theory