|
|
|
Differential Privacy: A Survey of Results |
|
|
1 | (19) |
|
|
|
|
On the Complexity of Measurement in Classical Physics |
|
|
20 | (11) |
|
|
|
|
|
Quantum Walk Based Search Algorithms |
|
|
31 | (16) |
|
|
|
|
Propositional Projection Temporal Logic, Buchi Automata and ω-Regular Expressions |
|
|
47 | (12) |
|
|
|
Genome Rearrangement Algorithms for Unsigned Permutations with O(log n) Singletons |
|
|
59 | (11) |
|
|
|
On the Complexity of the Hidden Subgroup Problem |
|
|
70 | (12) |
|
|
|
An O*(3.523k) Parameterized Algorithm for 3-Set Packing |
|
|
82 | (12) |
|
|
|
Indistinguishability and First-Order Logic |
|
|
94 | (11) |
|
|
|
Derandomizing Graph Tests for Homomorphism |
|
|
105 | (11) |
|
|
|
Definable Filters in the Structure of Bounded Turing Reductions |
|
|
116 | (9) |
|
|
|
|
|
Distance Constrained Labelings of Trees |
|
|
125 | (11) |
|
|
|
|
A Characterization of NCk by First Order Functional Programs |
|
|
136 | (12) |
|
|
|
The Structure of Detour Degrees |
|
|
148 | (12) |
|
|
|
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults |
|
|
160 | (10) |
|
|
|
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs |
|
|
170 | (12) |
|
|
|
|
|
|
|
|
|
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity |
|
|
182 | (10) |
|
|
|
More on Weak Bisimilarity of Normed Basic Parallel Processes |
|
|
192 | (12) |
|
|
Extensions of Embeddings in the Computably Enumerable Degrees |
|
|
204 | (8) |
|
|
An Improved Parameterized Algorithm for a Generalized Matching Problem |
|
|
212 | (11) |
|
|
|
|
|
Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus |
|
|
223 | (11) |
|
|
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences |
|
|
234 | (12) |
|
|
|
|
Ratio Based Stable In-Place Merging |
|
|
246 | (12) |
|
|
|
A Characterisation of the Relations Definable in Presburger Arithmetic |
|
|
258 | (12) |
|
|
Finding Minimum 3-Way Cuts in Hypergraphs |
|
|
270 | (12) |
|
|
Inapproximability of Maximum Weighted Edge Biclique and Its Applications |
|
|
282 | (12) |
|
|
Symbolic Algorithm Analysis of Rectangular Hybrid Systems |
|
|
294 | (12) |
|
|
|
On the OBDD Complexity of the Most Significant Bit of Integer Multiplication |
|
|
306 | (12) |
|
|
Logical Closure Properties of Propositional Proof Systems |
|
|
318 | (12) |
|
|
Graphs of Linear Clique-Width at Most 3 |
|
|
330 | (12) |
|
|
|
|
A Well-Mixed Function with Circuit Complexity 5n ± o(n): Tightness of the Lachish-Raz-Type Bounds |
|
|
342 | (9) |
|
|
|
A Logic for Distributed Higher Order πCalculus |
|
|
351 | (13) |
|
|
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs |
|
|
364 | (11) |
|
|
|
A Topological Study of Tilings |
|
|
375 | (13) |
|
|
|
A Denotational Semantics for Total Correctness of Sequential Exact Real Programs |
|
|
388 | (12) |
|
|
Weak Bisimulations for the Giry Monad (Extended Abstract) |
|
|
400 | (10) |
|
|
Approximating Border Length for DNA Microarray Synthesis |
|
|
410 | (13) |
|
|
|
|
|
On a Question of Frank Stephan |
|
|
423 | (10) |
|
|
|
|
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF |
|
|
433 | (12) |
|
|
|
|
Improved Algorithms for Bicluster Editing |
|
|
445 | (12) |
|
|
|
|
|
Generation Complexity Versus Distinction Complexity |
|
|
457 | (10) |
|
|
|
Balancing Traffic Load Using One-Turn Rectilinear Routing |
|
|
467 | (12) |
|
|
|
|
|
A Moderately Exponetial Time Algorithm for Full Degree Spanning Tree |
|
|
479 | (11) |
|
|
|
|
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems |
|
|
490 | (12) |
|
|
|
|
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Extended Abstract) |
|
|
502 | (12) |
|
|
|
Model Theoretic Complexity of Automatic Structures (Extended Abstract) |
|
|
514 | (12) |
|
|
|
A Separation between Divergence and Holevo Information for Ensembles |
|
|
526 | (16) |
|
|
|
|
Unary Automatic Graphs: An Algorithmic Perspective |
|
|
542 | (12) |
|
|
|
|
Search Space Reductions for Nearest-Neighbor Queries |
|
|
554 | (14) |
|
|
|
Total Degrees and Nonsplitting Properties of Σ02 Enumeration Degrees |
|
|
568 | (11) |
|
|
|
|
|
s-Degrees within e-Degrees |
|
|
579 | (9) |
|
|
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees |
|
|
588 | (9) |
|
|
|
Author Index |
|
597 | |