Journal of Computer and System Sciences （JCSS） - Volume 51, Issue 3 论文列表
| 点击这里查看 Journal of Computer and System Sciences 的JCR分区、影响因子等信息 |
| 卷期号： Volume 51, Issue 3 |
| 发布时间： December 1995 |
| 卷期年份： 1995 |
| 卷期官网： https://www.sciencedirect.com/journal/journal-of-computer-and-system-sciences/vol/51/issue/3 |
本期论文列表
Editor′s Foreword
Competitive Algorithms for Distributed Data Management
New Algorithms for an Ancient Scheduling Problem
Fast Learning of k-Term DNF Formulas with Queries
Planar Separators and Parallel Polygon Triangulation
Entropy and Sorting
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information
Method Schemas
On Comparison and Analysis of Algorithms for Multiplication in GF(2m)
Continuous Algebras Revisited
Emptiness Problems of eNCE Graph Languages
The Best Nondeterministic Representations of Finite Orderings
Decision Trees with Boolean Threshold Queries
An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
On the Feasibility of Checking Temporal Integrity Constraints
Author Index for Volume 51