Sciweavers

12697 search results - page 2391 / 2540
» Call for Papers
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
14 years 1 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
WG
1994
Springer
14 years 1 months 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...
CTRS
1990
14 years 1 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
STACS
1992
Springer
14 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
WMRD
1990
14 years 1 months ago
Replication in Ficus Distributed File Systems
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...
Gerald J. Popek, Richard G. Guy, Thomas W. Page Jr...
« Prev « First page 2391 / 2540 Last » Next »