Bruno Durand, Anne-Cécile Fabret  Home/Search
Context
Related
| enslyon.fr/pub/LIP/Rapp...RR9522.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math...ftp.enslyon.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We are interested in some properties of massively parallel computers that we model by finite automata connected together as a 2-dimensional grid. We wonder whether it is possible to anticipate a possible appearance of a deadlock in such nets. Thus, we look for efficient algorithms to predict whether deadlocks can appear in grids of bounded size. From the point of view of worst-case complexity, we prove that this problem is NPcomplete whereas it is quadratic for linear structures. The... (Update)
Active bibliography (related documents): More All
0.3: Randomized Reductions and Isomorphisms - Wang (1999) (Correct)
0.3: Average-Case Intractable NP Problems - Wang (1997) (Correct)
0.2: Average-case Computational Complexity Theory - Wang (1996) (Correct)
Similar documents based on text: More All
0.3: Do Most Strong Definitions of Randomness Exist? - Durand, Kanovei, Uspensky.. (1998) (Correct)
0.3: The Game of Life: universality revisited - Durand, Roka (1998) (Correct)
0.3: Kolmogorov Complexity and Cellular Automata Classification - Dubacq, Durand, Formenti (1997) (Correct)
BibTeX entry: (Update)
@article{ durand99complexity,
author = "Bruno Durand and Anne-C{\'e}cile Fabret",
title = "On the complexity of deadlock detection in families of planar nets",
journal = "Theoretical Computer Science",
volume = "215",
number = "1--2",
pages = "225--237",
year = "1999",
url = "citeseer.ist.psu.edu/durand95complexity.html" }
Citations (may not include all citations):112 Average case complete problems (context) - Levin - 1986
49 Average case completeness - Gurevich - 1991
47 Undecidability and nonperiodicity for tilings of the plane (context) - Robinson - 1971
29 the theory of average case complexity - Ben-David, Chor et al. - 1989
21 Memoirs of the American Mathematical Society (context) - Berger, of et al. - 1966
12 Matrix transformation is complete for the average case - Blass, Gurevich
12 Complexity of solvable cases of the decision problem for the.. (context) - Lewis - 1978
10 Complete and incomplete randomized NP problems (context) - Gurevich - 1987
10 A linear speed-up theorem for cellular automata (context) - Mazoyer, Reimen - 1992
9 Randomizing reductions of search problems - Blass, Gurevich - 1993
7 Simulations between cellular automata on Cayley graphs (context) - R'oka - 1995
2 A Random NP-complete problem for inversion of 2D cellular au.. (context) - Durand - 1995
2 A Random NP-complete problem for inversion of 2D cellular au.. (context) - Durand - 1995
1 Automates cellulaires: r'eversibilit'e et complexit'e (context) - Durand - 1994
1 Detection of deadlocks in an infinite family of nets (context) - Beauquier, Choquet et al. - 1991
1 the undecidability of deadlock detection in families of nets (context) - Fabret, Petit - 1995
1 Dominoes are forever (context) - Boas - 1983
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ens-lyon.fr.html): More
Un Calcul De Constructions Infinies Et Son Application A La.. - Giménez (1996) (Correct)
Parallel Approximation of Optimization Problems.. - Bovet, Clementi.. (Correct)
MasPar Programming Language (ANSI C compatible MPL) User Guide - Software Version (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC