The power of reconfiguration

Y. Ben-Asher, D. Peleg, R. Ramaswami, A. Schuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper concerns the computational aspects of the reconfigurable network model. The computational power of the model is investigated under several network topologies and assuming several variants of the model. In particular, it is shown that there are reconfigurable machines based on simple network topologies, that are capable of solving large classes of problems in constant time. These classes depend on the kinds of switches assumed for the network nodes. Reconfigurable networks are also compared with various other models of parallel computation, like PRAM’s and Branching Programs.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 18th International Colloquium, Proceedings
EditorsJavier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540542339
StatePublished - 1991
Externally publishedYes
Event18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain
Duration: 8 Jul 199112 Jul 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume510 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The power of reconfiguration'. Together they form a unique fingerprint.

Cite this