CORR
2008
Springer
14 years 16 days ago
2008
Springer
This paper presents a formalized proof of a discrete form of the Jordan Curve Theorem. It is based on a hypermap model of planar subdivisions, formal specifications and proofs assi...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...