| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(n log n) Algorithm for Abelian Group Isomorphism
|
Vikas, Narayan
|
|
1996
|
53 |
1 |
p. 1-9
9 p.
|
article
|
| 2 |
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets
|
Dietz, Paul F.
|
|
1996
|
53 |
1 |
p. 148-152
5 p.
|
article
|
| 3 |
Automaticity I: Properties of a Measure of Descriptional Complexity
|
Shallit, Jeffrey
|
|
1996
|
53 |
1 |
p. 10-25
16 p.
|
article
|
| 4 |
Concurrent Counting
|
Moran, Shlomo
|
|
1996
|
53 |
1 |
p. 61-78
18 p.
|
article
|
| 5 |
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
|
Gabow, Harold N.
|
|
1996
|
53 |
1 |
p. 129-147
19 p.
|
article
|
| 6 |
Incremental Learning from Positive Data
|
Lange, Steffen
|
|
1996
|
53 |
1 |
p. 88-103
16 p.
|
article
|
| 7 |
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
|
Drewes, Frank
|
|
1996
|
53 |
1 |
p. 33-60
28 p.
|
article
|
| 8 |
Learnability: Admissible, Co-Finite, and Hypersimple Languages
|
Baliga, Ganesh
|
|
1996
|
53 |
1 |
p. 26-32
7 p.
|
article
|
| 9 |
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
|
Fich, Faith E.
|
|
1996
|
53 |
1 |
p. 104-111
8 p.
|
article
|
| 10 |
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
|
Sieling, Detlef
|
|
1996
|
53 |
1 |
p. 79-87
9 p.
|
article
|
| 11 |
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
|
Gao, Feng
|
|
1996
|
53 |
1 |
p. 112-128
17 p.
|
article
|
Journal description