Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCATS 1998: Perth, WA, Australia
- Xuemin Lin:
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998. Australian Computer Science Communications 20(3), Springer-Verlag Singapore Pte. Ltd. 1998
Keynote Address
- Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS 1998: 1-4
Keynote Address
- Takeshi Tokuyama:
Application of Algorithm Theory to Data Mining. CATS 1998: 5-20
Session 1
- Toru Hasunuma, Hiroshi Nagamochi:
Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS 1998: 21-36 - Weifa Liang, George Havas:
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. CATS 1998: 37-50 - Chang-Biau Yang, Tung-Hsing Liu:
Wormhole Routing on the Star Graph Interconnection Network. CATS 1998: 51-66 - Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin:
Inferring Ordered Trees from Local Constraints. CATS 1998: 67-76
Session 2
- Tadao Takaoka:
A New Measure of Disorder in Sorting - Entropy. CATS 1998: 77-86 - Jyrki Katajainen:
The Ultimate Heapsort. CATS 1998: 87-96 - Frank Albers, Peter Damaschke:
Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. CATS 1998: 97-106
Session 3
- Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Default-Sensitive PreProcessings for Finding Maxima. CATS 1998: 107-120 - Steve Callaghan, Gerard Ellis, James Harland:
Filters for Graph Matching. CATS 1998: 121-136 - Ying Teh Tsai, Chuan Yi Tang:
An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems. CATS 1998: 137-150
Session 4
- John Maraist:
Separating Weakening and Contraction in a Linear Lambda Calculus. CATS 1998: 151-166 - Ernie Ong:
Optimisation Nets. CATS 1998: 167-182 - Yukiyoshi Kameyama, Masahiko Sato:
A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability. CATS 1998: 183-198
Session 5
- Brian Murphy, Richard P. Brent:
On Quadratic Polynomials for the Number Field Sieve. CATS 1998: 199-214 - David R. Powell, Lloyd Allison, Trevor I. Dix, David L. Dowe:
Alignment of Low Information Sequences. CATS 1998: 215-230 - L. Yohanes Stefanus, Ronald N. Goldman:
On the Linear Independence of the Bivariate Discrete Convolution Blending Functions. CATS 1998: 231-244
Session 6
- Alessandra Di Pierro, Herbert Wiklicky:
A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming. CATS 1998: 245-260 - A. J. Field, Peter G. Harrison, K. Kanani:
Automatic Generation of Verifiable Cache Coherence Simulation Models from High-Level Specifications. CATS 1998: 261-276 - Cristian S. Calude, Marjo Lipponen:
Computational Complementarity and Sofic Shifts. CATS 1998: 277-290 - A. Pgourtzis, K. Sharma, Efstathios K. Zachos:
Tree Models and Probabilistic Polynomial Time Computations. CATS 1998: 291-304
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 20:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
