The complexity of reconfiguring network models

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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
Title of host publicationTheory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings
EditorsDanny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540555537
StatePublished - 1992
EventIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel
Duration: 27 May 199228 May 1992

Publication series

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


ConferenceIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


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

Cite this