10271 search results - page 530 / 2055 » Computer Science |
189
click to vote
MFCS
1998
Springer
15 years 11 months ago
1998
Springer
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
173
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
155
Voted
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
167
Voted
SOFSEM
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern re...
134
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...