Journal of the ACM （JOLACM） - Issue 125 论文列表
| 点击这里查看 Journal of the ACM 的JCR分区、影响因子等信息 |
| 卷期号： Issue 125 |
| 发布时间： |
| 卷期年份： 1985 |
| 卷期官网： |
本期论文列表
Uniform Hashing Is Optimal
The Complexity of Propositional Linear Temporal Logics
Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains
Generating Binary Trees Using Rotations
Self-Adjusting Binary Search Trees
Enumeration of Structured Flowcharts
Generalized Best-First Search Strategies and the Optimality of A*
Adding Range Restriction Capability to Dynamic Data Structures
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels
A Mean Value Performance Model for Locking in Databases: The No-Waiting Case
Optimal Attach and Reinforcement of a Network
A Model of Computation for VLSI with Related Complexity Results
A Simple On-Line Bin-Packing Algorithm
Correction to "A Theorem in Database Concurrency Control"