Sciweavers

LCC
1994
209views Algorithms» more  LCC 1994»
14 years 2 months ago
On Herbrand's Theorem
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
Samuel R. Buss
LCC
1994
200views Algorithms» more  LCC 1994»
14 years 2 months ago
Program Extraction from Classical Proofs
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
Ulrich Berger, Helmut Schwichtenberg
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
14 years 2 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
ISAAC
1994
Springer
82views Algorithms» more  ISAAC 1994»
14 years 2 months ago
Parallel h-v Drawings of Binary Trees
Panagiotis Takis Metaxas, Grammati E. Pantziou, An...
ISAAC
1994
Springer
95views Algorithms» more  ISAAC 1994»
14 years 2 months ago
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
Dimitris J. Kavvadias, Grammati E. Pantziou, Paul ...
ISAAC
1994
Springer
91views Algorithms» more  ISAAC 1994»
14 years 2 months ago
A New Problem in String Searching
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...
George Havas, Jin Xian Lian
ISAAC
1994
Springer
93views Algorithms» more  ISAAC 1994»
14 years 2 months ago
Are Fibonacci Heaps Optimal?
Diab Abuaiadh, Jeffrey H. Kingston
ISAAC
1994
Springer
83views Algorithms» more  ISAAC 1994»
14 years 2 months ago
On Helping and Interactive Proof Systems
Vikraman Arvind, Johannes Köbler, Rainer Schu...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 2 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
14 years 2 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...