The complexity of reconfiguring network models

Y. Benasher, K. J. Lange, D. Peleg, A. Schuster

Research output: Contribution to journalArticlepeer-review


This paper concerns some of the theoretical complexity aspects of the reconfigurable network model. The computational power of the model is investigated under several variants, depending on the type of switches (or switch operations) assumed by the network nodes. Computational power is evaluated by focusing on the set of problems computable in constant time in each variant. A hierarchy of such problem classes corresponding to different variants is shown to exist and is placed relative to traditional classes of complexity theory.

Original languageEnglish
Pages (from-to)41-58
Number of pages18
JournalInformation and Computation
Issue number1
StatePublished - 15 Aug 1995

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'The complexity of reconfiguring network models'. Together they form a unique fingerprint.

Cite this