| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
|
Creignou, N.
|
|
1995
|
51 |
3 |
p. 511-522
12 p.
|
article
|
| 2 |
An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees
|
Asano, T.
|
|
1995
|
51 |
3 |
p. 503-510
8 p.
|
article
|
| 3 |
Author Index for Volume 51
|
|
|
1995
|
51 |
3 |
p. 536-
1 p.
|
article
|
| 4 |
Competitive Algorithms for Distributed Data Management
|
Bartal, Y.
|
|
1995
|
51 |
3 |
p. 341-358
18 p.
|
article
|
| 5 |
Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information
|
Imielinski, T.
|
|
1995
|
51 |
3 |
p. 405-432
28 p.
|
article
|
| 6 |
Continuous Algebras Revisited
|
Adamek, J.
|
|
1995
|
51 |
3 |
p. 460-471
12 p.
|
article
|
| 7 |
Decision Trees with Boolean Threshold Queries
|
Benasher, Y.
|
|
1995
|
51 |
3 |
p. 495-502
8 p.
|
article
|
| 8 |
Editor′s Foreword
|
Maass, W.
|
|
1995
|
51 |
3 |
p. 339-
1 p.
|
article
|
| 9 |
Emptiness Problems of eNCE Graph Languages
|
Skodinis, K.
|
|
1995
|
51 |
3 |
p. 472-485
14 p.
|
article
|
| 10 |
Entropy and Sorting
|
Kahn, J.
|
|
1995
|
51 |
3 |
p. 390-399
10 p.
|
article
|
| 11 |
Fast Learning of k-Term DNF Formulas with Queries
|
Blum, A.
|
|
1995
|
51 |
3 |
p. 367-373
7 p.
|
article
|
| 12 |
Method Schemas
|
Abiteboul, S.
|
|
1995
|
51 |
3 |
p. 433-455
23 p.
|
article
|
| 13 |
New Algorithms for an Ancient Scheduling Problem
|
Bartal, Y.
|
|
1995
|
51 |
3 |
p. 359-366
8 p.
|
article
|
| 14 |
On Comparison and Analysis of Algorithms for Multiplication in GF(2 m )
|
Seo, C.
|
|
1995
|
51 |
3 |
p. 456-459
4 p.
|
article
|
| 15 |
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
|
Seidel, R.
|
|
1995
|
51 |
3 |
p. 400-403
4 p.
|
article
|
| 16 |
On the Feasibility of Checking Temporal Integrity Constraints
|
Chomicki, J.
|
|
1995
|
51 |
3 |
p. 523-535
13 p.
|
article
|
| 17 |
Planar Separators and Parallel Polygon Triangulation
|
Goodrich, M.T.
|
|
1995
|
51 |
3 |
p. 374-389
16 p.
|
article
|
| 18 |
The Best Nondeterministic Representations of Finite Orderings
|
Vela, C.R.
|
|
1995
|
51 |
3 |
p. 486-494
9 p.
|
article
|
Journal description