Descriptive Complexity for Distributed Computing with Circuits

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

2 Citations (Scopus)
11 Downloads (Pure)

Abstract

We consider distributed algorithms in the realistic scenario where distributed message passing is operated by circuits. We show that within this setting, modal substitution calculus MSC precisely captures the expressive power of circuits. The result is established via constructing translations that are highly efficient in relation to size. We also observe that the coloring algorithm based on Cole-Vishkin can be specified by logarithmic size programs (and thus also logarithmic size circuits) in the bounded-degree scenario.

Original languageEnglish
Title of host publication48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
EditorsJerome Leroux, Sylvain Lombardy, David Peleg
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISBN (Electronic)9783959772921
DOIs
Publication statusPublished - Aug 2023
Publication typeA4 Article in conference proceedings
EventInternational Symposium on Mathematical Foundations of Computer Science - Bordeaux, France
Duration: 28 Aug 20231 Sept 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume272
ISSN (Electronic)1868-8969

Conference

ConferenceInternational Symposium on Mathematical Foundations of Computer Science
Country/TerritoryFrance
CityBordeaux
Period28/08/231/09/23

Keywords

  • Descriptive complexity
  • distributed computing
  • graph coloring
  • logic

Publication forum classification

  • Publication forum level 1

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Descriptive Complexity for Distributed Computing with Circuits'. Together they form a unique fingerprint.

Cite this