ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1408.5963
  4. Cited By
Infinite Networks, Halting and Local Algorithms

Infinite Networks, Halting and Local Algorithms

International Symposium on Games, Automata, Logics and Formal Verification (GandALF), 2014
26 August 2014
Antti Kuusisto
ArXiv (abs)PDFHTML

Papers citing "Infinite Networks, Halting and Local Algorithms"

4 / 4 papers shown
Descriptive complexity for distributed computing with circuits
Descriptive complexity for distributed computing with circuitsInternational Symposium on Mathematical Foundations of Computer Science (MFCS), 2023
Veeti Ahvonen
Damian Heiman
L. Hella
Antti Kuusisto
281
4
0
08 Mar 2023
Constant Space and Non-Constant Time in Distributed Computing
Constant Space and Non-Constant Time in Distributed Computing
Tuomo Lempiäinen
Jukka Suomela
209
0
0
10 May 2017
Emptiness Problems for Distributed Automata
Emptiness Problems for Distributed Automata
Antti Kuusisto
Fabian Reiter
159
7
0
07 May 2017
Asynchronous Distributed Automata: A Characterization of the Modal
  Mu-Fragment
Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment
Fabian Reiter
178
17
0
25 Nov 2016
1
Page 1 of 1