Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Ivan Rapaport"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 1, Iss Proc. CSP 2008, Pp 81-92 (2009)
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability o
Externí odkaz:
https://doaj.org/article/c99e0187f83c4ca0aa369b354d650d23
Publikováno v:
International Journal of Parallel, Emergent and Distributed Systems. 38:85-97
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e6c21da3e7bf7f45ff5e52ef43d9315
https://doi.org/10.1007/978-3-031-32733-9_21
https://doi.org/10.1007/978-3-031-32733-9_21
Publikováno v:
International Journal of Modern Physics C. 34
The density classification problem on graphs consists in finding a local dynamics such that, given a graph and an initial configuration of 0’s and 1’s assigned to the nodes of the graph, the dynamics converge to the fixed point configuration of a
Autor:
Raimundo Briceño, Ivan Rapaport
Publikováno v:
Natural Computing. 20:307-320
A natural way to interpret a cellular automaton (CA) is as a mechanism that computes, in a distributed way, some function f. In other words, from a computer science point of view, CAs can be seen as distributed systems where the cells of the CAs are
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:682-700
The broadcast congested clique model (BClique) is a message-passing model of distributed computation where $n$ nodes communicate with each other in synchronous rounds. First, in this paper we prove...
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031099922
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db3ff9c1bddb2b5a0c964e5e6f1af9fd
https://doi.org/10.1007/978-3-031-09993-9_12
https://doi.org/10.1007/978-3-031-09993-9_12
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031099922
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21131d154646b819d0cf1500773fac8f
https://doi.org/10.1007/978-3-031-09993-9_7
https://doi.org/10.1007/978-3-031-09993-9_7
Autor:
Antonio Lizama, Ivan Rapaport
Publikováno v:
Automata and Complexity ISBN: 9783030925505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2fbcc326d71a05f38a5862f3a1f4d38f
https://doi.org/10.1007/978-3-030-92551-2_6
https://doi.org/10.1007/978-3-030-92551-2_6
Publikováno v:
SOFSEM 2021: Theory and Practice of Computer Science ISBN: 9783030677305
SOFSEM
SOFSEM
Given (i) a set of \(N+1\) vertices, that corresponds to N clients and 1 depot, (ii) the travel time between each pair of vertices and (iii) a number m of salespersons, the multiple traveling salesman problem consists in finding m tours such that, st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a10a524dd59b0b30c53ad922497ccc6
https://doi.org/10.1007/978-3-030-67731-2_24
https://doi.org/10.1007/978-3-030-67731-2_24