Sciweavers

Share
ICALP
1992
Springer
9 years 4 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
ICALP
1992
Springer
9 years 4 months ago
Barbed Bisimulation
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
Robin Milner, Davide Sangiorgi
ICALP
1992
Springer
9 years 4 months ago
Logic Programming Semantics Made Easy
Els Laenens, Dirk Vermeir, Carlo Zaniolo
ICALP
1992
Springer
9 years 4 months ago
What Good Are Digital Clocks?
Real-time systems operate in \real," continuous time and state changes may occur at any real-numbered time point. Yet many veri cation methods are based on the assumption that...
Thomas A. Henzinger, Zohar Manna, Amir Pnueli
ICALP
1992
Springer
9 years 4 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
ICALP
1992
Springer
9 years 4 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
ICALP
1992
Springer
9 years 4 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
ICALP
1992
Springer
9 years 4 months ago
Reductions to Sets of Low Information Content
Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, J...
books