Zobrazeno 1 - 10
of 330
pro vyhledávání: '"Kowalski, Dariusz R."'
Autor:
Banihashem, Kiarash, Hajiaghayi, MohammadTaghi, Kowalski, Dariusz R., Olkowski, Jan, Springer, Max
We give the first non-trivial decremental dynamic embedding of a weighted, undirected graph $G$ into $\ell_p$ space. Given a weighted graph $G$ undergoing a sequence of edge weight increases, the goal of this problem is to maintain a (randomized) map
Externí odkaz:
http://arxiv.org/abs/2406.17210
We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive, full-infor
Externí odkaz:
http://arxiv.org/abs/2405.04762
Sharding is used to improve the scalability and performance of blockchain systems. We investigate the stability of blockchain sharding, where transactions are continuously generated by an adversarial model. The system consists of $n$ processing nodes
Externí odkaz:
http://arxiv.org/abs/2404.04438
We develop deterministic algorithms for the problems of consensus, gossiping and checkpointing with nodes prone to failing. Distributed systems are modeled as synchronous complete networks. Failures are represented either as crashes or authenticated
Externí odkaz:
http://arxiv.org/abs/2305.11644
Fault-tolerant consensus is about reaching agreement on some of the input values in a limited time by non-faulty autonomous processes, despite of failures of processes or communication medium. This problem is particularly challenging and costly again
Externí odkaz:
http://arxiv.org/abs/2305.10618
A number of stations, independently activated over time, is able to communicate by transmitting and listening to a shared channel in discrete time slots, and a message is successfully delivered to all stations if and only if its source station is the
Externí odkaz:
http://arxiv.org/abs/2209.14140
In a multiple access channel, autonomous stations are able to transmit and listen to a shared device. A fundamental problem, called \textit{contention resolution}, is to allow any station to successfully deliver its message by resolving the conflicts
Externí odkaz:
http://arxiv.org/abs/2209.13423
We study computer systems with transactions executed on a set of shared objects. Transactions arrive continually subjects to constrains that are framed as an adversarial model and impose limits on the average rate of transaction generation and the nu
Externí odkaz:
http://arxiv.org/abs/2208.07359
Suppose we are given integer $k \leq n$ and $n$ boxes labeled $1,\ldots, n$ by an adversary, each containing a number chosen from an unknown distribution. We have to choose an order to sequentially open these boxes, and each time we open the next box
Externí odkaz:
http://arxiv.org/abs/2207.10703
Autor:
Kowalski, Dariusz R., Pajak, Dominik
When facing a very large stream of data, it is often desirable to extract most important statistics online in a short time and using small memory. For example, one may want to quickly find the most influential users generating posts online or check i
Externí odkaz:
http://arxiv.org/abs/2203.15043