Volume 28; Issue 3

Journal of the ACM

Volume 28; Issue 3
1

Should Tables Be Sorted?

Year:
1981
Language:
english
File:
PDF, 782 KB
english, 1981
2

The Complexity of the Finite Containment Problem for Petri Nets

Year:
1981
Language:
english
File:
PDF, 874 KB
english, 1981
3

Fast Algorithms for Solving Path Problems

Year:
1981
Language:
english
File:
PDF, 1.29 MB
english, 1981
5

Optimal Time Minimal Space Selection Algorithms

Year:
1981
Language:
english
File:
PDF, 465 KB
english, 1981
6

On J-maximal and J-minimal Flow-Shop Schedules

Year:
1981
Language:
english
File:
PDF, 766 KB
english, 1981
7

On Optimal Scheduling Algorithms for Time-Shared Systems

Year:
1981
Language:
english
File:
PDF, 459 KB
english, 1981
8

The Area-Time Complexity of Binary Multiplication

Year:
1981
Language:
english
File:
PDF, 694 KB
english, 1981
9

Probabilistic Aspects of Boolean Switching Functions via a New Transform

Year:
1981
Language:
english
File:
PDF, 772 KB
english, 1981
10

A Unified Approach to Path Problems

Year:
1981
Language:
english
File:
PDF, 1.01 MB
english, 1981
11

The Complexity of the Equivalence Problem for Simple Programs

Year:
1981
Language:
english
File:
PDF, 1.33 MB
english, 1981
12

Connected Component Labeling Using Quadtrees

Year:
1981
Language:
english
File:
PDF, 823 KB
english, 1981
13

Corrigendum: `` Mean-Value Analysis of Closed Multichain Queuing Networks''

Year:
1981
Language:
english
File:
PDF, 218 KB
english, 1981
14

A Unification Algorithm for Associative-Commutative Functions

Year:
1981
Language:
english
File:
PDF, 814 KB
english, 1981