Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Przemyslaw Uznanski"'
Autor:
Adrian Kosowski, Przemyslaw Uznanski, Leszek Gasieniec, Jurek Czyzowicz, Paul G. Spirakis, Evangelos Kranakis
Publikováno v:
Journal of Computer and System Sciences
Lecture Notes in Computer Science
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Proceedings, Part I
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Proceedings, Part I, Jul 2015, Kyoto, Japan. pp.393-405, ⟨10.1007/978-3-662-47672-7_32⟩
Automata, Languages, and Programming ISBN: 9783662476710
ICALP (1)
Lecture Notes in Computer Science
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Proceedings, Part I
42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Proceedings, Part I, Jul 2015, Kyoto, Japan. pp.393-405, ⟨10.1007/978-3-662-47672-7_32⟩
Automata, Languages, and Programming ISBN: 9783662476710
ICALP (1)
International audience; In this work we focus on a natural class of population protocols whose dynamics are modelled by the discrete version of Lotka-Volterra equations. In such protocols, when an agent $a$ of type (species) $i$ interacts with an age
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e49397060b5517e9cc5c6c537a94aa9
http://livrepository.liverpool.ac.uk/3156594/1/population-final.pdf
http://livrepository.liverpool.ac.uk/3156594/1/population-final.pdf
Autor:
Leszek Gąsieniec, Mahsa Eftekhari, Grzegorz Stachowiak, Przemyslaw Uznanski, David Doty, Eric E. Severson
Publikováno v:
PODC
We study population protocols, a model of distributed computing where agents exchange information in pairwise interactions, but have no control over their schedule of interaction partners. The well-studied majority problem is that of determining in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4de083f7b60b3f5a11ad3e63272b03bb
https://doi.org/10.1145/3465084.3467942
https://doi.org/10.1145/3465084.3467942
Publikováno v:
PODC
There has recently been a surge of interest in the computational and complexity properties of the population model, which assumes n anonymous, computationally-bounded nodes, interacting at random, with the goal of jointly computing global predicates.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca6cf4722d1822c53af55b7b0ba96cf8
https://doi.org/10.1145/3465084.3467915
https://doi.org/10.1145/3465084.3467915
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
WADS
A distance labeling scheme is an assignment of labels, that is, binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their labels without any additional information about the graph. The goal is to m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06fec22d8bfef10a31efdf1d18027705
https://doi.org/10.1007/978-3-030-83508-8_31
https://doi.org/10.1007/978-3-030-83508-8_31
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
Consider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e3c3a443a70f5be7a0425c3858d10b3
https://doi.org/10.1007/978-3-030-79987-8_19
https://doi.org/10.1007/978-3-030-79987-8_19
Autor:
Przemyslaw Uznanski
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030514655
CiE
CiE
Computing text-to-pattern distances is a fundamental problem in pattern matching. Given a text of length n and a pattern of length m, we are asked to output the distance between the pattern and every n-substring of the text. A basic variant of this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4700a1e74d8909224dad021354123716
https://doi.org/10.1007/978-3-030-51466-2_32
https://doi.org/10.1007/978-3-030-51466-2_32
Publikováno v:
Information Processing Letters. 127:17-20
We consider the problem of exploration of an anonymous, port-labeled, undirected graph with n nodes, m edges and diameter D , by a single mobile agent. Initially the agent does not know the graph topology nor any of the global parameters. Moreover, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef9e9c9f0bbecd2e033b7e326dcd01ed
https://doi.org/10.1016/j.ipl.2017.06.010
https://doi.org/10.1016/j.ipl.2017.06.010
Publikováno v:
The 31st ACM Symposium on Parallelism in Algorithms and Architectures
SPAA
SPAA
The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called {\em agents}. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leade
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82eba1acbb1cf5517cd918c3dfcb819a
http://livrepository.liverpool.ac.uk/3045572/1/spaa.pdf
http://livrepository.liverpool.ac.uk/3045572/1/spaa.pdf
Autor:
Adrian Kosowski, Przemyslaw Uznanski
Publikováno v:
PODC
A population protocol describes a set of state change rules for a population of n indistinguishable finite-state agents (automata), undergoing random pairwise interactions. Within this very basic framework, it is possible to resolve a number of funda
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b13c5ae0ebeb4796c45733b842543c7
https://doi.org/10.1145/3212734.3212788
https://doi.org/10.1145/3212734.3212788
Publikováno v:
LNCS
DNA 2017-23rd International Conference DNA Computing and Molecular Programming
DNA 2017-23rd International Conference DNA Computing and Molecular Programming, Sep 2017, Austin, TX, United States. pp.155-171, ⟨10.1007/978-3-319-66799-7_11⟩
Lecture Notes in Computer Science ISBN: 9783319667980
DNA
DNA 2017-23rd International Conference DNA Computing and Molecular Programming
DNA 2017-23rd International Conference DNA Computing and Molecular Programming, Sep 2017, Austin, TX, United States. pp.155-171, ⟨10.1007/978-3-319-66799-7_11⟩
Lecture Notes in Computer Science ISBN: 9783319667980
DNA
International audience; In contrast to electronic computation, chemical computation is noisy and susceptible to a variety of sources of error, which has prevented the construction of robust complex systems. To be effective, chemical algorithms must b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06d1e4d19a15c61995a67ac6c65b79be
https://hal.inria.fr/hal-01669203
https://hal.inria.fr/hal-01669203