Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Tomasz Radzik"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031322952
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2a010139e661ff416c5dd7c7082d83
https://doi.org/10.1007/978-3-031-32296-9_11
https://doi.org/10.1007/978-3-031-32296-9_11
Publikováno v:
Algorithmica. 84(10)
Autor:
Petra Berenbrink, Peter Kling, Robert Elsässer, Dominik Kaaser, Tomasz Radzik, Tom Friedetzky
Publikováno v:
Distributed Computing
Distributed computing, 2021, Vol.34(2), pp.91-111 [Peer Reviewed Journal]
Distributed computing, 2021, Vol.34(2), pp.91-111 [Peer Reviewed Journal]
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of n identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion w
Publikováno v:
Current Neuropharmacology
Background: Balance in neurotransmission is essential for the proper functioning of the nervous system and even a small, but prolonged disturbance, can induce the negative feedback mechanisms leading to various neuropathologies. Neurodegenerative and
Publikováno v:
International Journal of Molecular Sciences, Vol 21, Iss 4, p 1428 (2020)
International Journal of Molecular Sciences
International Journal of Molecular Sciences
Background: Neurodegenerative and mood disorders represent growing medical and social problems, many of which are provoked by oxidative stress, disruption in the metabolism of various neurotransmitters, and disturbances in calcium homeostasis. Biolog
Publikováno v:
Random Structures & Algorithms. 53:561-585
This book constitutes revised selected papers from the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, held in Lisbon, Portugal•, in September 2021. The 10 full papers presented in this vol
Publikováno v:
Cooper, C D, Radzik, T & Rivera Aburto, N 2019, ' New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs ', ACM Transactions on Parallel Computing, vol. 6, no. 3, 16, pp. 1-24 . https://doi.org/10.1145/3364206
We present new bounds on the cover time of the coalescing-branching random walk process COBRA. The COBRA process, introduced in Dutta et al. [9], can be viewed as spreading a single item of information throughout an undirected graph in synchronised r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8511bd379402f27d731de833aee33265
https://kclpure.kcl.ac.uk/ws/files/122130627/New_Cover_Time_Bounds_COOPER_Acc5Aug2019Epub30Nov2019_GREEN_AAM.pdf
https://kclpure.kcl.ac.uk/ws/files/122130627/New_Cover_Time_Bounds_COOPER_Acc5Aug2019Epub30Nov2019_GREEN_AAM.pdf
Autor:
Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Grzegorz Stachowiak, Tomasz Jurdzinski, Tomasz Radzik, Alfredo Navarra
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Algorithms and Complexity
Algorithms and Complexity-11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
Lecture Notes in Computer Science-Algorithms and Complexity
Algorithms and Complexity-11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings
Lecture Notes in Computer Science ISBN: 9783030174019
CIAC
Given a set \(V=\{v_1,\ldots , v_n\}\) of n elements and a family \(\mathcal{{S}} = \{ S_1, S_2, \ldots , S_m\}\) of (possibly intersecting) subsets of V, we consider a scheduling problem of perpetual monitoring (attending) these subsets. In each tim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac208f185d7eca68a8626a732c9bb5c4
http://hdl.handle.net/11697/142229
http://hdl.handle.net/11697/142229
Autor:
Lukasz Pulaski, Tomasz Radzik, Tomasz Boczek, Ludmila Zylinska, Bozena Ferenc, Maciej Studzian
Publikováno v:
BioMed Research International
BioMed Research International, Vol 2019 (2019)
BioMed Research International, Vol 2019 (2019)
Background. Plasma membrane Ca2+-ATPase (PMCA) is the most sensitive cellular calcium detector. It exists in four main isoforms (PMCA1-4), among which PMCA2 and PMCA3 are considered as fast-acting neuron-specific forms. In the brain, PMCA function de