CATS 2008:
Wollongong,
NSW,
Australia
James Harland, Prabhu Manyem (Eds.):
Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia, January 22-25, 2008. Proceedings.
CRPIT 77 Australian Computer Society 2008, ISBN 978-1-920682-58-3 
- Eric Allender:
Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds?
3
- Martin W. Bunder:
The Inhabitation Problem for Intersection Types.
7-14
- Xiaowei Huang, Li Jiao, Weiming Lu:
Weak Parametric Failure Equivalences and Their Congruence Formats.
15-26
- Olga Ohrimenko, Peter J. Stuckey:
Modelling for Lazy Clause Generation.
27-37
- Samuel Huston, Jakob Puchinger, Peter J. Stuckey:
The Core Concept for 0/1 Integer Programming.
39-47
- Matthew Asquith, Joachim Gudmundsson, Damian Merrick:
An ILP for the metro-line crossing problem.
49-56
- Elena Morozova:
A Multidimensional Bisection Method for Unconstrained Minimization Problem.
57-62
- Nita H. Shah, Ajay S. Gor, Hui Wee:
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value.
63-66
- Marko Samer, Stefan Szeider:
Tractable Cases of the Extended Global Cardinality Constraint.
67-74
- Egbert Mujuni, Frances A. Rosamond:
Parameterized Complexity of the Clique Partition Problem.
75-78
- Luke Mathieson, Stefan Szeider:
The Parameterized Complexity of Regular Subgraph Problems and Generalizations.
79-86
- Vadim E. Levit, Eugen Mandrescu:
Well-covered Graphs and Greedoids.
87-91
- Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-Villavicencio:
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2.
93-95
- Yuichi Asahiro, Eiji Miyano, Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.
97-106
- Frank Ruskey, Aaron Williams:
Generating Balanced Parentheses and Binary Trees by Prefix Shifts.
107-115
- Ching-Lueh Chang, Yen-Wu Ti, Yuh-Dauh Lyuu:
Testing Embeddability Between Metric Spaces.
117-124
- Shi Bai, Richard P. Brent:
On the Efficiency of Pollard's Rho Method for Discrete Logarithms.
125-131
- Lindsay Groves:
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction.
133-142
Last update Tue May 22 23:23:21 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
