< previous issue
next issue >
Finitistic proofs of 0-1 laws for fragments of second-order logic
A pursuit-evasion problem on a grid
Iterative deepening multiobjective A
Harikumar, S.; Kumar, S.
Design and analysis of a generalized multi-ring architecture
Krishnamachari, B.R.; Mittal, R.
On approximation algorithms for the minimum satisfiability problem
Marathe, M.V.; Ravi, S.S.
A note on a theorem of Barrington, Straubing and Therien
Functions computable with limited access to NP
On proving that a graph has no large clique: A connection with Ramsey theory
On path equivalence of nondeterministic finite automata
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Kirousis, L.M.; Spirakis, P.; Tsigas, P.
Here are a few pages on the site that we think you may find useful: