Abstract is missing.
- Differential Privacy: A Survey of ResultsCynthia Dwork. 1-19 [doi]
- On the Complexity of Measurement in Classical PhysicsEdwin J. Beggs, José Félix Costa, Bruno Loff, John Tucker. 20-30 [doi]
- Quantum Walk Based Search AlgorithmsMiklos Santha. 31-46 [doi]
- Propositional Projection Temporal Logic, Bchi Automata and omega-Regular ExpressionsCong Tian, Zhenhua Duan. 47-58 [doi]
- Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) SingletonsXiaowen Lou, Daming Zhu. 59-69 [doi]
- On the Complexity of the Hidden Subgroup ProblemStephen A. Fenner, Yong Zhang. 70-81 [doi]
- An O*(3.523k) Parameterized Algorithm for 3-Set PackingJianxin Wang, Qilong Feng. 82-93 [doi]
- Indistinguishability and First-Order LogicSkip Jordan, Thomas Zeugmann. 94-104 [doi]
- Derandomizing Graph Tests for HomomorphismAngsheng Li, Linqing Tang. 105-115 [doi]
- Definable Filters in the Structure of Bounded Turing ReductionsAngsheng Li, Weilin Li, Yicheng Pan, Linqing Tang. 116-124 [doi]
- Distance Constrained Labelings of TreesJirí Fiala, Petr A. Golovach, Jan Kratochvíl. 125-135 [doi]
- A Characterization of NCkJean-Yves Marion, Romain Péchoux. 136-147 [doi]
- The Structure of Detour DegreesLars Kristiansen, Paul J. Voda. 148-159 [doi]
- Hamiltonicity of Matching Composition Networks with Conditional Edge FaultsSun-Yuan Hsieh, Chia-Wei Lee. 160-169 [doi]
- Local 7-Coloring for Planar Subgraphs of Unit Disk GraphsJurek Czyzowicz, Stefan Dobrev, H. González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. 170-181 [doi]
- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational ComplexityPetr A. Golovach, Jan Kratochvíl. 182-191 [doi]
- More on Weak Bisimilarity of Normed Basic Parallel ProcessesHaiyan Chen. 192-203 [doi]
- Extensions of Embeddings in the Computably Enumerable DegreesJitai Zhao. 204-211 [doi]
- An Improved Parameterized Algorithm for a Generalized Matching ProblemJianxin Wang, Dan Ning, Qilong Feng, Jianer Chen. 212-222 [doi]
- Deterministic Hot-Potato Permutation Routing on the Mesh and the TorusAndre Osterloh. 223-233 [doi]
- Efficient Algorithms for Model-Based Motif Discovery from Multiple SequencesBin Fu, Ming-Yang Kao, Lusheng Wang. 234-245 [doi]
- Ratio Based Stable In-Place MergingPok-Son Kim, Arne Kutzner. 246-257 [doi]
- A Characterisation of the Relations Definable in Presburger ArithmeticMathias Barra. 258-269 [doi]
- Finding Minimum 3-Way Cuts in HypergraphsMingyu Xiao. 270-281 [doi]
- Inapproximability of Maximum Weighted Edge Biclique and Its ApplicationsJinsong Tan. 282-293 [doi]
- Symbolic Algorithm Analysis of Rectangular Hybrid SystemsHaibin Zhang, Zhenhua Duan. 294-305 [doi]
- On the OBDD Complexity of the Most Significant Bit of Integer MultiplicationBeate Bollig. 306-317 [doi]
- Logical Closure Properties of Propositional Proof SystemsOlaf Beyersdorff. 318-329 [doi]
- Graphs of Linear Clique-Width at Most 3Pinar Heggernes, Daniel Meister, Charis Papadopoulos. 330-341 [doi]
- A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type BoundsKazuyuki Amano, Jun Tarui. 342-350 [doi]
- A Logic for Distributed Higher Order pi-CalculusZining Cao. 351-363 [doi]
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite GraphsMarc Demange, Tinaz Ekim. 364-374 [doi]
- A Topological Study of TilingsGrégory Lafitte, Michael Weiss. 375-387 [doi]
- A Denotational Semantics for Total Correctness of Sequential Exact Real ProgramsThomas Anberrée. 388-399 [doi]
- Weak Bisimulations for the Giry Monad (Extended Abstract)Ernst-Erich Doberkat. 400-409 [doi]
- Approximating Border Length for DNA Microarray SynthesisCindy Y. Li, Prudence W. H. Wong, Qin Xin, Fencol C. C. Yung. 410-422 [doi]
- On a Question of Frank StephanKlaus Ambos-Spies, Serikzhan Badaev, Sergey Goncharov 0002. 423-432 [doi]
- A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLFMinzhu Xie, Jianxin Wang, Jianer Chen. 433-444 [doi]
- Improved Algorithms for Bicluster EditingJiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang. 445-456 [doi]
- Generation Complexity Versus Distinction ComplexityRupert Hölzl, Wolfgang Merkle. 457-466 [doi]
- Balancing Traffic Load Using One-Turn Rectilinear RoutingStephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan. 467-478 [doi]
- A Moderately Exponential Time Algorithm for Full Degree Spanning TreeSerge Gaspers, Saket Saurabh, Alexey A. Stepanov. 479-489 [doi]
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring ProblemsOriana Ponta, Falk Hüffner, Rolf Niedermeier. 490-501 [doi]
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room SearchableJohn Z. Zhang, Tsunehiko Kameda. 502-513 [doi]
- Model Theoretic Complexity of Automatic Structures (Extended Abstract)Bakhadyr Khoussainov, Mia Minnes. 514-525 [doi]
- A Separation between Divergence and Holevo Information for EnsemblesRahul Jain, Ashwin Nayak, Yi Su. 526-541 [doi]
- Unary Automatic Graphs: An Algorithmic PerspectiveBakhadyr Khoussainov, Jiamou Liu, Mia Minnes. 542-553 [doi]
- Search Space Reductions for Nearest-Neighbor QueriesMicah Adler, Brent Heeringa. 554-567 [doi]
- Total Degrees and Nonsplitting Properties of Enumeration DegreesMarat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova. 568-578 [doi]
- s-Degrees within e-DegreesThomas F. Kent. 579-587 [doi]
- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable DegreesS. Barry Cooper, Matthew C. Salts, Guohua Wu. 588-596 [doi]