The SCEAS System
Navigation Menu

Conferences in DBLP

Computing: The Australasian Theory Symposium (cats)
1998 (conf/cats/1998)


  1. Average-Case Analysis Using Kolgomorov Complexity (Abstract). [Citation Graph (, )][DBLP]


  2. Application of Algorithm Theory to Data Mining. [Citation Graph (, )][DBLP]


  3. Independent Spanning Trees with Small Depths in Iterated Line Digraphs. [Citation Graph (, )][DBLP]


  4. Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3. [Citation Graph (, )][DBLP]


  5. Wormhole Routing on the Star Graph Interconnection Network. [Citation Graph (, )][DBLP]


  6. Inferring Ordered Trees from Local Constraints. [Citation Graph (, )][DBLP]


  7. A New Measure of Disorder in Sorting - Entropy. [Citation Graph (, )][DBLP]


  8. The Ultimate Heapsort. [Citation Graph (, )][DBLP]


  9. Delayed Correction - Binary Search with Errors Made Very Simple but Efficient. [Citation Graph (, )][DBLP]


  10. Default-Sensitive PreProcessings for Finding Maxima. [Citation Graph (, )][DBLP]


  11. Filters for Graph Matching. [Citation Graph (, )][DBLP]


  12. An Average Case Analysis of the Branching Algorithm for Solving $k$-Satisfiability Problems. [Citation Graph (, )][DBLP]


  13. Separating Weakening and Contraction in a Linear Lambda Calculus. [Citation Graph (, )][DBLP]


  14. Optimisation Nets. [Citation Graph (, )][DBLP]


  15. A Classical Catch/Throw Calculus with Tag Abstractions and its Strong Normalizability. [Citation Graph (, )][DBLP]


  16. On Quadratic Polynomials for the Number Field Sieve. [Citation Graph (, )][DBLP]


  17. Alignment of Low Information Sequences. [Citation Graph (, )][DBLP]


  18. On the Linear Independence of the Bivariate Discrete Convolution Blending Functions. [Citation Graph (, )][DBLP]


  19. A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming. [Citation Graph (, )][DBLP]


  20. Automatic Generation of Verifiable Cache Coherence Simulation Models from High-Level Specifications. [Citation Graph (, )][DBLP]


  21. Computational Complementarity and Sofic Shifts. [Citation Graph (, )][DBLP]


  22. Tree Models and Probabilistic Polynomial Time Computations. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002