no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences
|
Gabow, H.N. |
|
1995 |
50 |
2 |
p. 259-273 15 p. |
article |
2 |
Approximations and Optimal Geometric Divide-and-Conquer
|
Matousek, J. |
|
1995 |
50 |
2 |
p. 203-208 6 p. |
article |
3 |
Competitive Paging with Locality of Reference
|
Borodin, A. |
|
1995 |
50 |
2 |
p. 244-258 15 p. |
article |
4 |
Computing with First-Order Logic
|
Abiteboul, S. |
|
1995 |
50 |
2 |
p. 309-335 27 p. |
article |
5 |
Editors′ Foreword
|
Halpern, J. |
|
1995 |
50 |
2 |
p. 189- 1 p. |
article |
6 |
Effective Noether Irreducibility Forms and Applications
|
Kaltofen, E. |
|
1995 |
50 |
2 |
p. 274-295 22 p. |
article |
7 |
Fast Approximation Algorithms for Multicommodity Flow Problems
|
Leighton, T. |
|
1995 |
50 |
2 |
p. 228-243 16 p. |
article |
8 |
Fast Monte Carlo Algorithms for Permutation Groups
|
Babai, L. |
|
1995 |
50 |
2 |
p. 296-308 13 p. |
article |
9 |
PP Is Closed under Intersection
|
Beigel, R. |
|
1995 |
50 |
2 |
p. 191-202 12 p. |
article |
10 |
Testing Finite State Machines: Fault Detection
|
Yannakakis, M. |
|
1995 |
50 |
2 |
p. 209-227 19 p. |
article |
11 |
When Won′t Membership Queries Help?
|
Angluin, D. |
|
1995 |
50 |
2 |
p. 336-355 20 p. |
article |