Sciweavers

ERSHOV
1989
Springer
14 years 22 days ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
CAAP
1990
14 years 22 days ago
Coherence of Subsumption
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypings A 6 B are interpreted via conversion functions A B. ...
Pierre-Louis Curien, Giorgio Ghelli
CAAP
1990
14 years 22 days ago
A Markovian Concurrency Measure
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
Dominique Geniet, René Schott, Loÿs Th...
ACMSE
1990
ACM
14 years 22 days ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms
MFCS
1992
Springer
14 years 22 days ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
MFCS
1992
Springer
14 years 22 days ago
On Range Searching with Semialgebraic Sets
Pankaj K. Agarwal, Jirí Matousek
WG
1994
Springer
14 years 22 days ago
Complexity of Graph Covering Problems
Jan Kratochvíl, Andrzej Proskurowski, Jan A...
WG
1994
Springer
14 years 22 days ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...