TAMC C

52 papers

YearTitle / Authors
2008A Characterisation of the Relations Definable in Presburger Arithmetic.
Mathias Barra
2008A Characterization of NCk.
Jean-Yves Marion, Romain Péchoux
2008A Denotational Semantics for Total Correctness of Sequential Exact Real Programs.
Thomas Anberrée
2008A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable.
John Z. Zhang, Tsunehiko Kameda
2008A Logic for Distributed Higher Order pi-Calculus.
Zining Cao
2008A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.
Serge Gaspers, Saket Saurabh, Alexey A. Stepanov
2008A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF.
Minzhu Xie, Jianxin Wang, Jianer Chen
2008A Separation between Divergence and Holevo Information for Ensembles.
Rahul Jain, Ashwin Nayak, Yi Su
2008A Topological Study of Tilings.
Grégory Lafitte, Michael Weiss
2008A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds.
Kazuyuki Amano, Jun Tarui
2008An Improved Parameterized Algorithm for a Generalized Matching Problem.
Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen
2008An O*(3.523k) Parameterized Algorithm for 3-Set Packing.
Jianxin Wang, Qilong Feng
2008Approximating Border Length for DNA Microarray Synthesis.
Cindy Y. Li, Prudence W. H. Wong, Qin Xin, Fencol C. C. Yung
2008Balancing Traffic Load Using One-Turn Rectilinear Routing.
Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan
2008Definable Filters in the Structure of Bounded Turing Reductions.
Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang
2008Derandomizing Graph Tests for Homomorphism.
Angsheng Li, Linqing Tang
2008Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus.
Andre Osterloh
2008Differential Privacy: A Survey of Results.
Cynthia Dwork
2008Distance Constrained Labelings of Trees.
Jirí Fiala, Petr A. Golovach, Jan Kratochvíl
2008Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.
Bin Fu, Ming-Yang Kao, Lusheng Wang
2008Extensions of Embeddings in the Computably Enumerable Degrees.
Jitai Zhao
2008Finding Minimum 3-Way Cuts in Hypergraphs.
Mingyu Xiao
2008Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity.
Petr A. Golovach, Jan Kratochvíl
2008Generation Complexity Versus Distinction Complexity.
Rupert Hölzl, Wolfgang Merkle
2008Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons.
Xiaowen Lou, Daming Zhu
2008Graphs of Linear Clique-Width at Most 3.
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2008Hamiltonicity of Matching Composition Networks with Conditional Edge Faults.
Sun-Yuan Hsieh, Chia-Wei Lee
2008Improved Algorithms for Bicluster Editing.
Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang
2008Inapproximability of Maximum Weighted Edge Biclique and Its Applications.
Jinsong Tan
2008Indistinguishability and First-Order Logic.
Skip Jordan, Thomas Zeugmann
2008Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs.
Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia
2008Logical Closure Properties of Propositional Proof Systems.
Olaf Beyersdorff
2008Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs.
Marc Demange, Tínaz Ekim
2008Model Theoretic Complexity of Automatic Structures (Extended Abstract).
Bakhadyr Khoussainov, Mia Minnes
2008More on Weak Bisimilarity of Normed Basic Parallel Processes.
Haiyan Chen
2008On a Question of Frank Stephan.
Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov
2008On the Complexity of Measurement in Classical Physics.
Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker
2008On the Complexity of the Hidden Subgroup Problem.
Stephen A. Fenner, Yong Zhang
2008On the OBDD Complexity of the Most Significant Bit of Integer Multiplication.
Beate Bollig
2008Propositional Projection Temporal Logic, Bchi Automata and omega-Regular Expressions.
Cong Tian, Zhenhua Duan
2008Quantum Walk Based Search Algorithms.
Miklos Santha
2008Ratio Based Stable In-Place Merging.
Pok-Son Kim, Arne Kutzner
2008Search Space Reductions for Nearest-Neighbor Queries.
Micah Adler, Brent Heeringa
2008Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.
Oriana Ponta, Falk Hüffner, Rolf Niedermeier
2008Symbolic Algorithm Analysis of Rectangular Hybrid Systems.
Haibin Zhang, Zhenhua Duan
2008The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.
S. Barry Cooper, Matthew C. Salts, Guohua Wu
2008The Structure of Detour Degrees.
Lars Kristiansen, Paul J. Voda
2008Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings
Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li
2008Total Degrees and Nonsplitting Properties of Enumeration Degrees.
Marat M. Arslanov, S. Barry Cooper, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
2008Unary Automatic Graphs: An Algorithmic Perspective.
Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes
2008Weak Bisimulations for the Giry Monad (Extended Abstract).
Ernst-Erich Doberkat
2008s-Degrees within e-Degrees.
Thomas F. Kent