Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarCATS 2008: Wollongong, NSW, Australia
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookJames Harland, Prabhu Manyem:
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
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
Xiaowei Huang, Li Jiao, Weiming Lu:
Weak Parametric Failure Equivalences and Their Congruence Formats. 15-26
Weak Parametric Failure Equivalences and Their Congruence Formats. 15-26
Samuel Huston, Jakob Puchinger, Peter J. Stuckey:
The Core Concept for 0/1 Integer Programming. 39-47
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
An ILP for the metro-line crossing problem. 49-56
Nita H. Shah, Ajay S. Gor, Hui Wee:
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value. 63-66
Optimal Joint Vendor-Buyer Inventory Strategy for Deteriorating Items with Salvage Value. 63-66
Luke Mathieson, Stefan Szeider:
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. 79-86
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. 79-86
Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-Villavicencio:
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2. 93-95
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
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
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. 107-115
Shi Bai, Richard P. Brent:
On the Efficiency of Pollard's Rho Method for Discrete Logarithms. 125-131
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
Verifying Michael and Scott's Lock-Free Queue Algorithm using Trace Reduction. 133-142
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-19 22:29 CEST by the dblp team