Publications
2025
On the Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference
Kowalski, D. R., & Mosteiro, M. A. (2025). On the Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference. IEEE Transactions on Information Theory, 71(4), 3157-3166. doi:10.1109/tit.2025.3542767
2024
Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?
Hajiaghayi, M., Kowalski, D., & Olkowski, J. (2024). Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why a Lot of Randomness is Needed?. In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (pp. 321-331). ACM. doi:10.1145/3662158.3662826
Sparse Spanners with Small Distance and Congestion Stretches
Busch, C., Kowalski, D. R., & Robinson, P. (2024). Sparse Spanners with Small Distance and Congestion Stretches. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 383-393). ACM. doi:10.1145/3626183.3659954
Stable Blockchain Sharding under Adversarial Transaction Generation
Adhikari, R., Busch, C., & Kowalski, D. R. (2024). Stable Blockchain Sharding under Adversarial Transaction Generation. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 451-461). ACM. doi:10.1145/3626183.3659970
Locally Balanced Allocations Under Strong Byzantine Influence
Busch, C., Garncarek, P., & Kowalski, D. R. (2024). Locally Balanced Allocations Under Strong Byzantine Influence. In Unknown Conference (pp. 262-280). Springer Nature Switzerland. doi:10.1007/978-3-031-60603-8_15
2023
Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks
Kamenev, A., Kowalski, D. R., & Mosteiro, M. A. (2023). Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks. ACM Transactions on Parallel Computing, 10(2), 1-35. doi:10.1145/3593426
Brief Announcement: Improved Consensus in Quantum Networks
Hajiaghayi, M., Kowalski, D. R., & Olkowski, J. (2023). Brief Announcement: Improved Consensus in Quantum Networks. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (pp. 286-289). ACM. doi:10.1145/3583668.3594600
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
Chlebus, B., Kowalski, D. R., & Olkowski, J. (2023). Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (pp. 344-354). ACM. doi:10.1145/3583668.3594599
Efficient Protective Jamming in 2D SINR Networks
Bojko, D., Klonowski, M., Kowalski, D. R., & Marciniak, M. (2023). Efficient Protective Jamming in 2D SINR Networks. In Unknown Conference (pp. 533-546). Springer Nature Switzerland. doi:10.1007/978-3-031-39698-4_36
2021
Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader
Kowalski, D. R., & Mosteiro, M. A. (2021). Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader. Retrieved from http://arxiv.org/abs/2104.02937v1
New View on Adversarial Queueing on MAC
Hradovich, E., Klonowski, M., & Kowalski, D. R. (2021). New View on Adversarial Queueing on MAC. IEEE Communications Letters, 25(4), 1144-1148. doi:10.1109/lcomm.2020.3047997
Generic Framework for Optimization of Local Dissemination in Wireless Networks
Kowalski, D. R., Mosteiro, M. A., & Wadhwa, K. (2021). Generic Framework for Optimization of Local Dissemination in Wireless Networks. In Unknown Conference (pp. 244-260). Springer International Publishing. doi:10.1007/978-3-030-67087-0_16
2020
Subquadratic non-adaptive threshold group testing
De Marco, G., Jurdziński, T., Kowalski, D. R., Różański, M., & Stachowiak, G. (2020). Subquadratic non-adaptive threshold group testing. Journal of Computer and System Sciences, 111, 42-56. doi:10.1016/j.jcss.2020.02.002
2019
Token traversal in ad hoc wireless networks via implicit carrier sensing
Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2019). Token traversal in ad hoc wireless networks via implicit carrier sensing. Theoretical Computer Science. doi:10.1016/j.tcs.2019.09.016
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel
Kowalski, D. R., Mirek, J. D., & Wong, P. W. H. (2019). Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel. Lecture Notes in Computer Science. Retrieved from http://arxiv.org/abs/1710.07380v3
Testing Methods to Minimise Range-shifting Time with Conservation Actions
Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (2019). Testing Methods to Minimise Range-shifting Time with Conservation Actions. In ICBBT 2019: 2019 11TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL TECHNOLOGY (pp. 32-39). doi:10.1145/3340074.3340076
Packet latency of deterministic broadcasting in adversarial multiple access channels
Anantharamu, L., Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2019). Packet latency of deterministic broadcasting in adversarial multiple access channels. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 99, 27-52. doi:10.1016/j.jcss.2018.07.001
Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel.
Klonowski, M., Kowalski, D. R., Mirek, J., & Wong, P. W. H. (2019). Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel.. In L. A. Gasieniec, J. Jansson, & C. Levcopoulos (Eds.), FCT Vol. 11651 (pp. 306-321). Springer. Retrieved from https://doi.org/10.1007/978-3-030-25027-0
Optimal Channel Utilization with Limited Feedback
De Marco, G., Jurdziński, T., & Kowalski, D. R. (2019). Optimal Channel Utilization with Limited Feedback. In Unknown Conference (pp. 140-152). Springer International Publishing. doi:10.1007/978-3-030-25027-0_10
Reaching Consensus in Ad-Hoc Diffusion Networks
Kowalski, D. R., & Mirek, J. (2019). Reaching Consensus in Ad-Hoc Diffusion Networks. In ALGORITHMS FOR SENSOR SYSTEMS, ALGOSENSORS 2018 Vol. 11410 (pp. 180-192). doi:10.1007/978-3-030-14094-6_12
The Impact of the Transversion/Transition Ratio on the Optimal Genetic Code Graph Partition
Aloqalaa, D. A., Kowalski, D. R., Blazej, P., Wnetrzak, M., Mackiewicz, D., & Mackiewicz, P. (2019). The Impact of the Transversion/Transition Ratio on the Optimal Genetic Code Graph Partition. In PROCEEDINGS OF THE 12TH INTERNATIONAL JOINT CONFERENCE ON BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, VOL 3 (BIOINFORMATICS) (pp. 55-65). doi:10.5220/0007381000550065
2018
Randomized Rumor Spreading in Ad Hoc Networks with Buffers
Kowalski, D. R., & Caro, C. T. (2018). Randomized Rumor Spreading in Ad Hoc Networks with Buffers. Retrieved from http://arxiv.org/abs/1812.11903v1
Stability of adversarial routing with feedback
Chlebus, B. S., Cholvi, V., & Kowalski, D. R. (2015). Stability of adversarial routing with feedback. NETWORKS, 66(2), 88-97. doi:10.1002/net.21607
Estimating Invasion Time in Real Landscapes
Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (2018). Estimating Invasion Time in Real Landscapes. In ICCBB 2018: PROCEEDINGS OF THE 2018 2ND INTERNATIONAL CONFERENCE ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS (pp. 55-62). doi:10.1145/3290818.3290825
Brief announcement: Deterministic contention resolution on a shared channel
De Marco, G., Kowalski, D. R., & Stachowiak, G. (2018). Brief announcement: Deterministic contention resolution on a shared channel. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 121. doi:10.4230/LIPIcs.DISC.2018.44
Local queuing under contention
Garncarek, P., Jurdziński, T., & Kowalski, D. R. (2018). Local queuing under contention. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 121. doi:10.4230/LIPIcs.DISC.2018.28
Estimating Invasion Time in Real Landscapes: Supplementary Materials
Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (n.d.). Estimating Invasion Time in Real Landscapes: Supplementary Materials.
Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
Kowalski, D. R., & Mosteiro, M. A. (2018). Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 107 (pp. 156:1-156:14). doi:10.4230/LIPIcs.ICALP.2018.156
Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees
Fernandez Anta, A., Kowalski, D. R., Mosteiro, M. A., & Wong, P. W. H. (2018). Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees. ACM TRANSACTIONS ON PARALLEL COMPUTING, 5(2). doi:10.1145/3291529
Distributed Online and Stochastic Queueing on a Multiple Access Channel
Bienkowski, M., Jurdzinski, T., Korzeniowski, M., & Kowalski, D. R. (2018). Distributed Online and Stochastic Queueing on a Multiple Access Channel. ACM TRANSACTIONS ON ALGORITHMS, 14(2). doi:10.1145/3182396
Effective use of congestion in complex networks
Echaguee, J., Cholvi, V., & Kowalski, D. R. (2018). Effective use of congestion in complex networks. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 494, 574-580. doi:10.1016/j.physa.2017.11.159
Information gathering in ad-hoc radio networks with tree topology
Chrobak, M., Costello, K. P., Gasieniec, L., & Kowalski, D. R. (2018). Information gathering in ad-hoc radio networks with tree topology. Information and Computation, 258, 1-27. doi:10.1016/j.ic.2017.11.003
Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation
Anta, A. F., Georgiou, C., Kowalski, D. R., & Zavou, E. (2018). Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 78, 245-256. doi:10.1016/j.future.2016.05.042
2017
Fault Tolerant Scheduling of Tasks of Two Sizes under Resource Augmentation
Kowalski., Wong, P. W., & Zavou, E. (2017). Fault Tolerant Scheduling of Tasks of Two Sizes under Resource Augmentation. Journal of Scheduling, 20(6), 695-711. doi:10.1007/s10951-017-0541-1
Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds
Abdulazeez, M., Garncarek, P., & Wong, P. W. H. (2017). Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds. In 2017 26th International Conference on Computer Communication and Networks (ICCCN) (pp. 1-6). IEEE. doi:10.1109/icccn.2017.8038506
Adaptive packet scheduling over a wireless channel under constrained jamming
Fernandez Anta, A., Georgiou, C., Kowalski, D. R., & Zavou, E. (2017). Adaptive packet scheduling over a wireless channel under constrained jamming. THEORETICAL COMPUTER SCIENCE, 692, 72-89. doi:10.1016/j.tcs.2017.06.020
Deterministic Digital Clustering of Wireless Ad Hoc Networks
Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2018). Deterministic Digital Clustering of Wireless Ad Hoc Networks. In PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (pp. 105-114). doi:10.1145/3212734.3212752
Contention resolution in a non-synchronized multiple access channel
De Marco, G., & Kowalski, D. R. (2017). Contention resolution in a non-synchronized multiple access channel. THEORETICAL COMPUTER SCIENCE, 689, 1-13. doi:10.1016/j.tcs.2017.05.014
Ordered and delayed adversaries and how to work against them on a shared channel
Klonowski, M., Kowalski, D. R., & Mirek, J. (2019). Ordered and delayed adversaries and how to work against them on a shared channel. DISTRIBUTED COMPUTING, 32(5), 379-403. doi:10.1007/s00446-018-0341-7
Routing in Wireless Networks With Interferences
Chlebus, B. S., Cholvi, V., Garncarek, P., Jurdzinski, T., & Kowalski, D. R. (2017). Routing in Wireless Networks With Interferences. IEEE COMMUNICATIONS LETTERS, 21(9), 2105-2108. doi:10.1109/LCOMM.2017.2716348
Doing-it-All with bounded work and communication.
Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Schwarzmann, A. A. (2017). Doing-it-All with bounded work and communication.. Information and Computation, 254, 1-40. doi:10.1016/j.ic.2017.02.003
Lightweight Robust Framework for Workload Scheduling in Clouds
Abdulazeez, M., Garncarek, P., Kowalski, D. R., & Wong, P. W. H. (2017). Lightweight Robust Framework for Workload Scheduling in Clouds. In 2017 IEEE 1ST INTERNATIONAL CONFERENCE ON EDGE COMPUTING (IEEE EDGE) (pp. 206-209). doi:10.1109/IEEE.EDGE.2017.36
Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets
Kowalski, D. R., Kudaravalli, H., & Mosteiro, M. A. (2017). Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets. In Proceedings of the Second International Conference on Internet-of-Things Design and Implementation (pp. 313-314). ACM. doi:10.1145/3054977.3057292
The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring
Alshamrani, S., Kowalski, D., & Gasieniec, L. (2016). The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring. In 2016 2ND INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGIES AND APPLICATIONS (CLOUDTECH) (pp. 40-46). Retrieved from https://www.webofscience.com/
2016
Performance Analysis of Molecular Communication Model
Juhi, A., Kowalski, D. R., & Lisitsa, A. (2016). Performance Analysis of Molecular Communication Model. In 2016 IEEE 16TH INTERNATIONAL CONFERENCE ON NANOTECHNOLOGY (IEEE-NANO) (pp. 826-829). Retrieved from https://www.webofscience.com/
Randomized mutual exclusion on a multiple access channel
Bienkowski, M., Klonowski, M., Korzeniowski, M., & Kowalski, D. R. (2016). Randomized mutual exclusion on a multiple access channel. DISTRIBUTED COMPUTING, 29(5), 341-359. doi:10.1007/s00446-016-0265-z
Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid
Arikiez, M., Grasso, F., Kowalski, D., & Zito, M. (2016). Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid. In 2016 IEEE INTERNATIONAL ENERGY CONFERENCE (ENERGYCON). Retrieved from https://www.webofscience.com/
Wake-Up Problem in Multi-Hop Radio Networks
Jurdziński, T., & Kowalski, D. R. (2016). Wake-Up Problem in Multi-Hop Radio Networks. In Encyclopedia of Algorithms (pp. 2352-2354). Springer New York. doi:10.1007/978-1-4939-2864-4_536
Measuring the impact of adversarial errors on packet scheduling strategies
Fernandez Anta, A., Georgiou, C., Kowalski, D. R., Widmer, J., & Zavou, E. (2016). Measuring the impact of adversarial errors on packet scheduling strategies. JOURNAL OF SCHEDULING, 19(2), 135-152. doi:10.1007/s10951-015-0451-z
Clique Here: On the Distributed Complexity in Fully-Connected Networks
Applebaum, B., Kowalski, D. R., Patt-Shamir, B., & Rosen, A. (2016). Clique Here: On the Distributed Complexity in Fully-Connected Networks. PARALLEL PROCESSING LETTERS, 26(1). doi:10.1142/S0129626416500043
Scalable wake-up of multi-channel single-hop radio networks
Chlebus, B. S., De Marco, G., & Kowalski, D. R. (2016). Scalable wake-up of multi-channel single-hop radio networks. THEORETICAL COMPUTER SCIENCE, 615, 23-44. doi:10.1016/j.tcs.2015.11.046
Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds
Alshamrani, S., Kowalski, D., Gasieniec, L., & Abdulazeez, M. (2016). Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds. In PROCEEDINGS OF THE 15TH EUROPEAN CONFERENCE ON CYBER WARFARE AND SECURITY (ECCWS 2016) (pp. 9-17). Retrieved from https://www.webofscience.com/
Failure or Denial of Service? A Rethink of the Cloud Recovery Model
Abdulazeez, M. B., Kowalski, D., Lisista, A., & Alshamrani, S. (2016). Failure or Denial of Service? A Rethink of the Cloud Recovery Model. In PROCEEDINGS OF THE 15TH EUROPEAN CONFERENCE ON CYBER WARFARE AND SECURITY (ECCWS 2016) (pp. 1-8). Retrieved from https://www.webofscience.com/
2015
Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines
Alshamrani, S. S., Kowalski, D. R., & Gasieniec, L. A. (2015). Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines. In CIT/IUCC/DASC/PICOM 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - UBIQUITOUS COMPUTING AND COMMUNICATIONS - DEPENDABLE, AUTONOMIC AND SECURE COMPUTING - PERVASIVE INTELLIGENCE AND COMPUTING (pp. 1704-1711). doi:10.1109/CIT/IUCC/DASC/PICOM.2015.257
On setting-up asynchronous ad hoc wireless networks
Jurdzinski, T., Kowalski, D., Rozanski, M., & Stachowiak, G. (2015). On setting-up asynchronous ad hoc wireless networks. In INFOCOM 2015 (pp. 2191-2199). doi:10.1109/INFOCOM.2015.7218605
Provable fairness for TDMA scheduling
Bienkowski, M., Byrka, J., Chrobak, K., Jurdzinski, T., & Kowalski, D. (2015). Provable fairness for TDMA scheduling. In 2015 IEEE Conference on Computer Communications (INFOCOM) (pp. 1320-1327). IEEE. doi:10.1109/infocom.2015.7218508
On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts
Georgiou, C., & Kowalski, D. R. (2015). On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 84, 94-107. doi:10.1016/j.jpdc.2015.07.007
Online parallel scheduling of non-uniform tasks: Trading failures for energy
Fernandez Anta, A., Georgiou, C., Kowalski, D. R., & Zavou, E. (2015). Online parallel scheduling of non-uniform tasks: Trading failures for energy. THEORETICAL COMPUTER SCIENCE, 590, 129-146. doi:10.1016/j.tcs.2015.01.027
Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation
Fernández Anta, A., Georgiou, C., Kowalski, D. R., & Zavou, E. (2015). Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation. In Unknown Conference (pp. 1-16). Springer International Publishing. doi:10.1007/978-3-319-28448-4_1
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
De Marco, G., & Kowalski, D. (2015). Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel. SIAM Journal on Computing, 44(3), 868-888. doi:10.1137/140982763
Fault Tolerant Scheduling of Non-uniform Tasks under Resource Augmentation
Kowalski, D., Wong, P., & Zavou, E. (2015). Fault Tolerant Scheduling of Non-uniform Tasks under Resource Augmentation. In The 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP).
Hierarchical model for intrusion detection systems in the cloud environment
Abdulazeez, M., & Kowalski, D. (2015). Hierarchical model for intrusion detection systems in the cloud environment. In European Conference on Information Warfare and Security, ECCWS Vol. 2015-January (pp. 319-327).
Message and time efficient multi-broadcast schemes
Levin, L., Kowalski, D. R., & Segal, M. (2015). Message and time efficient multi-broadcast schemes. THEORETICAL COMPUTER SCIENCE, 569, 13-23. doi:10.1016/j.tcs.2014.12.006
Online Packet Scheduling Under Adversarial Jamming
Jurdzinski, T., Kowalski, D. R., & Lorys, K. (2015). Online Packet Scheduling Under Adversarial Jamming. In APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014 Vol. 8952 (pp. 193-206). doi:10.1007/978-3-319-18263-6_17
2014
Performance Analysis and Algorithm Selection for Reliable Multicast in IEEE 802.11aa Wireless LAN
Banchs, A., de la Oliva, A., Eznarriaga, L., Kowalski, D. R., & Serrano, P. (2014). Performance Analysis and Algorithm Selection for Reliable Multicast in IEEE 802.11aa Wireless LAN. IEEE Transactions on Vehicular Technology, 63(8), 3875-3891. doi:10.1109/tvt.2014.2306014
Doing-it-All with bounded work and communication
Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Schwarzmann, A. A. (2017). Doing-it-All with bounded work and communication. INFORMATION AND COMPUTATION, 254, 1-40. doi:10.1016/j.ic.2017.02.003
Dynamic multiple-message broadcast
Kowalski, D. R., Mosteiro, M. A., & Rouse, T. (2014). Dynamic multiple-message broadcast. In Proceedings of the 10th ACM international workshop on Foundations of mobile computing (pp. 39-46). ACM. doi:10.1145/2634274.2634279
Universal routing in multi hop radio network
Chlebus, B. S., Cholvi, V., & Kowalski, D. R. (2014). Universal routing in multi hop radio network. In Proceedings of the 10th ACM international workshop on Foundations of mobile computing (pp. 19-28). ACM. doi:10.1145/2634274.2634278
On the Impact of Geometry on Ad Hoc Communication in Wireless Networks
Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2014). On the Impact of Geometry on Ad Hoc Communication in Wireless Networks. In PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14) (pp. 357-366). doi:10.1145/2611462.2611487
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
Chrobak, M., Costello, K., Gasieniec, L., & Kowalski, D. R. (2014). Information Gathering in Ad-Hoc Radio Networks with Tree Topology. COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014), 8881, 129-145. doi:10.1007/978-3-319-12691-3_11
Scheduling problems in transportation networks of line topology
Kowalski, D. R., Nussbaum, E., Segal, M., & Milyeykovsky, V. (2014). Scheduling problems in transportation networks of line topology. OPTIMIZATION LETTERS, 8(2), 777-799. doi:10.1007/s11590-013-0613-x
Decomposing broadcast algorithms using abstract MAC layers
Khabbazian, M., Kowalski, D. R., Kuhn, F., & Lynch, N. (2014). Decomposing broadcast algorithms using abstract MAC layers. AD HOC NETWORKS, 12, 219-242. doi:10.1016/j.adhoc.2011.12.001
Information Gathering in Ad-Hoc Radio Networks with Tree Topology.
Chrobak, M., Costello, K. P., Gasieniec, L., & Kowalski, D. (2014). Information Gathering in Ad-Hoc Radio Networks with Tree Topology.. In Z. Zhang, L. Wu, W. Xu, & D. -Z. Du (Eds.), COCOA Vol. 8881 (pp. 129-145). Springer. Retrieved from https://doi.org/10.1007/978-3-319-12691-3
Scalable Wake-up of Multi-channel Single-Hop Radio Networks
Chlebus, B. S., De Marco, G., & Kowalski, D. R. (2014). Scalable Wake-up of Multi-channel Single-Hop Radio Networks. In PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS 2014 Vol. 8878 (pp. 186-201). Retrieved from https://www.webofscience.com/
The Wake-Up Problem in Multi-Hop Radio Networks
Jurdzinski, T., & Kowalski, D. R. (2014). The Wake-Up Problem in Multi-Hop Radio Networks. Unknown Journal, 1-5. doi:10.1007/978-3-642-27848-8_536-1
2013
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model
Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2013). Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. In DISTRIBUTED COMPUTING Vol. 8205 (pp. 373-387). Retrieved from https://www.webofscience.com/
Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies
Fernández Anta, A., Georgiou, C., Kowalski, D. R., Widmer, J., & Zavou, E. (2013). Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies. In Unknown Conference (pp. 261-273). Springer International Publishing. doi:10.1007/978-3-319-03578-9_22
On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
Kowalski, D. R., & Krzywdziński, K. (2013). On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups. Discrete Mathematics and Theoretical Computer Science, 15(3), 101-118.
Message and time efficient multi-broadcast schemes
Levin, L., Kowalski, D. R., & Segal, M. (2013). Message and time efficient multi-broadcast schemes. EPTCS 132, 2013, pp. 21-37. Retrieved from http://dx.doi.org/10.4204/EPTCS.132.3
Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks
Kowalski, D. R., & Thraves Caro, C. (2013). Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks. In Unknown Conference (pp. 245-256). Springer Berlin Heidelberg. doi:10.1007/978-3-642-39247-4_21
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
Jurdzinski, T., Kowalski, D. R., & Stachowiak, G. (2013). Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. In Unknown Conference (pp. 195-209). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40164-0_20
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy
Fernández Anta, A., Georgiou, C., Kowalski, D. R., & Zavou, E. (2013). Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy. In Unknown Conference (pp. 145-158). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40164-0_16
Stability of Adversarial Routing with Feedback
Chlebus, B. S., Cholvi, V., & Kowalski, D. R. (2013). Stability of Adversarial Routing with Feedback. In Unknown Conference (pp. 206-220). Springer Berlin Heidelberg. doi:10.1007/978-3-642-40148-0_15
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices
Jurdzinski, T., Kowalski, D. R., & Stachowiak, G. (2013). Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices. In AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II Vol. 7966 (pp. 632-644). Retrieved from https://www.webofscience.com/
Synchronous byzantine agreement with nearly a cubic number of communication bits
Kowalski, D. R., & Mostéfaoui, A. (2013). Synchronous byzantine agreement with nearly a cubic number of communication bits. In Proceedings of the 2013 ACM symposium on Principles of distributed computing (pp. 84-91). ACM. doi:10.1145/2484239.2484271
Contention Resolution in a Non-Synchronized Multiple Access Channel
De Marco, G., & Kowalski, D. R. (2013). Contention Resolution in a Non-Synchronized Multiple Access Channel. In IEEE 27TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2013) (pp. 525-533). doi:10.1109/IPDPS.2013.68
Asynchronous gossip
Georgiou, C., Gilbert, S., Guerraoui, R., & Kowalski, D. R. (2013). Asynchronous gossip. Journal of the ACM, 60(2), 1-42. doi:10.1145/2450142.2450147
A Multiagent Based Framework for the Simulation of Mammalian Behaviour
Agiriga, E., Coenen, F., Hurst, J., & Kowalsk, D. (2013). A Multiagent Based Framework for the Simulation of Mammalian Behaviour. In BCS-SGASI AI2013 (pp. TBA). Cambridge: Springer.
Leader election in ad hoc radio networks: A keen ear helps
Kowalski, D. R., & Pelc, A. (2013). Leader election in ad hoc radio networks: A keen ear helps. Journal of Computer and System Sciences, 79(7), 1164-1180. doi:10.1016/j.jcss.2013.04.003
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
De Marco, G., & Kowalski, D. R. (2013). Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness. Random Structures & Algorithms, 42(1), 97-109. doi:10.1002/rsa.20417
Station Assignment with Applications to Sensing
Fernández Anta, A., Kowalski, D. R., Mosteiro, M. A., & Wong, P. W. H. (2014). Station Assignment with Applications to Sensing. In Unknown Conference (pp. 155-169). Springer Berlin Heidelberg. doi:10.1007/978-3-642-45346-5_12
2012
Electing a Leader in Multi-hop Radio Networks
Chlebus, B. S., Kowalski, D. R., & Pelc, A. (2012). Electing a Leader in Multi-hop Radio Networks. In Unknown Conference (pp. 106-120). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35476-2_8
On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks
Jurdzinski, T., & Kowalski, D. R. (2012). On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks. In Unknown Conference (pp. 209-223). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35476-2_15
Distributed Online and Stochastic Queuing on a Multiple Access Channel
Bienkowski, M., Jurdzinski, T., Korzeniowski, M., & Kowalski, D. R. (2012). Distributed Online and Stochastic Queuing on a Multiple Access Channel. In Unknown Conference (pp. 121-135). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33651-5_9
Distributed Broadcasting in Wireless Networks under the SINR Model
Jurdzinski, T., Kowalski, D. R., Maciejewski, T., & Stachowiak, G. (2012). Distributed Broadcasting in Wireless Networks under the SINR Model. Retrieved from http://arxiv.org/abs/1207.6732v2
Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks
Jurdzinski, T., & Kowalski, D. R. (2012). Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks. Retrieved from http://arxiv.org/abs/1207.0602v2
Scheduling of Vehicles in Transportation Networks
Kowalski, D., Nutov, Z., & Segal, M. (2012). Scheduling of Vehicles in Transportation Networks. In Unknown Conference (pp. 124-136). Springer Berlin Heidelberg. doi:10.1007/978-3-642-29667-3_11
Adversarial Queuing on the Multiple Access Channel
Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2012). Adversarial Queuing on the Multiple Access Channel. In ACM Transactions on Algorithms Vol. 8 (pp. 1-31). Association for Computing Machinery (ACM). doi:10.1145/2071379.2071384
2011
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Georgiou, C., Gilbert, S., & Kowalski, D. R. (2011). Meeting the deadline: on the complexity of fault-tolerant continuous gossip. Distributed Computing, 24(5), 223-244. doi:10.1007/s00446-011-0144-6
Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
Georgiou, C., & Kowalski, D. R. (2011). Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts. In Unknown Conference (pp. 165-180). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24100-0_15
Introduction
Kowalski, D., Sens, P., Anta, A. F., & Pierre, G. (2011). Introduction. In Unknown Conference (pp. 554). Springer Berlin Heidelberg. doi:10.1007/978-3-642-23400-2_51
Confidential Gossip
Georgiou, C., Gilbert, S., & Kowalski, D. R. (2011). Confidential Gossip. In 2011 31st International Conference on Distributed Computing Systems (pp. 603-612). IEEE. doi:10.1109/icdcs.2011.71
Medium Access Control for Adversarial Channels with Jamming
Anantharamu, L., Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2011). Medium Access Control for Adversarial Channels with Jamming. In Unknown Conference (pp. 89-100). Springer Berlin Heidelberg. doi:10.1007/978-3-642-22212-2_9
Efficient Distributed Communication in Ad-Hoc Radio Networks
Chlebus, B. S., Kowalski, D. R., Pelc, A., & Rokicki, M. A. (2011). Efficient Distributed Communication in Ad-Hoc Radio Networks. In Unknown Conference (pp. 613-624). Springer Berlin Heidelberg. doi:10.1007/978-3-642-22012-8_49
Time-efficient randomized multiple-message broadcast in radio networks
Khabbazian, M., & Kowalski, D. R. (2011). Time-efficient randomized multiple-message broadcast in radio networks. In Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (pp. 373-380). ACM. doi:10.1145/1993806.1993884
Multi-channel Assignment for Communication in Radio Networks
Kowalski, D. R., & Rokicki, M. A. (2011). Multi-channel Assignment for Communication in Radio Networks. In Unknown Conference (pp. 181-192). Springer Berlin Heidelberg. doi:10.1007/978-3-642-19754-3_19
Consensus and Mutual Exclusion in a Multiple Access Channel
Czyzowicz, J., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2011). Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 22(7), 1092-1104. doi:10.1109/TPDS.2010.162
'Proceedings of the Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing'
Chaintreau, A., & Kowalski, D. R. (Eds.) (2011). 'Proceedings of the Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing'. In 7th ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (FOMC 2011) (pp. 76). San Diego: ACM. Retrieved from http://dl.acm.org/citation.cfm?id=1998476&picked=prox
Towards large-scale multi-agent based rodent simulation: The "mice in a box" scenario
Agiriga, E., Coenen, F., Hurst, J., Beynon, R., & Kowalski, D. (2011). Towards large-scale multi-agent based rodent simulation: The "mice in a box" scenario. In Res. and Dev. in Intelligent Syst. XXVIII: Incorporating Applications and Innovations in Intel. Sys. XIX - AI 2011, 31st SGAI Int. Conf. on Innovative Techniques and Applications of Artificial Intel. (pp. 369-382). doi:10.1007/978-1-4471-2318-7_28
2010
Connectivity Problem in Wireless Networks
Kowalski, D. R., & Rokicki, M. A. (2010). Connectivity Problem in Wireless Networks. In Unknown Conference (pp. 344-358). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15763-9_32
Scalable Quantum Consensus for Crash Failures
Chlebus, B. S., Kowalski, D. R., & Strojnowski, M. (2010). Scalable Quantum Consensus for Crash Failures. In Unknown Conference (pp. 236-250). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15763-9_24
Trusted Computing for Fault-Prone Wireless Networks
Gilbert, S., & Kowalski, D. R. (2010). Trusted Computing for Fault-Prone Wireless Networks. In Unknown Conference (pp. 359-373). Springer Berlin Heidelberg. doi:10.1007/978-3-642-15763-9_33
Decomposing broadcast algorithms using abstract MAC layers
Khabbazian, M., Kuhn, F., Kowalski, D. R., & Lynch, N. (2010). Decomposing broadcast algorithms using abstract MAC layers. In Proceedings of the 6th International Workshop on Foundations of Mobile Computing (pp. 13-22). ACM. doi:10.1145/1860684.1860690
Towards Power-Sensitive Communication on a Multiple-Access Channel
Marco, G. D., & Kowalski, D. R. (2010). Towards Power-Sensitive Communication on a Multiple-Access Channel. In 2010 IEEE 30th International Conference on Distributed Computing Systems (pp. 728-735). IEEE. doi:10.1109/icdcs.2010.50
Meeting the deadline
Georgiou, C., Gilbert, S., & Kowalski, D. R. (2010). Meeting the deadline. In Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (pp. 247-256). ACM. doi:10.1145/1835698.1835759
Deterministic Broadcast on Multiple Access Channels
Anantharamu, L., Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2010). Deterministic Broadcast on Multiple Access Channels. In 2010 Proceedings IEEE INFOCOM. IEEE. doi:10.1109/infcom.2010.5462256
Bounds on Stability and Latency in Wireless Communication
Cholvi, V., & Kowalski, D. R. (2010). Bounds on Stability and Latency in Wireless Communication. Retrieved from http://arxiv.org/abs/1006.1345v1
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Kowalski, D. R., Momenzadeh, M., & Shvartsman, A. A. (2010). Emulating shared-memory Do-All algorithms in asynchronous message-passing systems. Journal of Parallel and Distributed Computing, 70(6), 699-705. doi:10.1016/j.jpdc.2009.12.002
Fast radio broadcasting with advice
Ilcinkas, D., Kowalski, D. R., & Pelc, A. (2010). Fast radio broadcasting with advice. Theoretical Computer Science, 411(14-15), 1544-1557. doi:10.1016/j.tcs.2010.01.004
Dynamic sharing of a multiple access channel
Bienkowski, M., Klonowski, M., Korzeniowski, M., & Kowalski, D. R. (2010). Dynamic sharing of a multiple access channel. Retrieved from http://arxiv.org/abs/1001.3044v2
Distributed Agreement with Optimal Communication Complexity
Gilbert, S., & Kowalski, D. R. (2010). Distributed Agreement with Optimal Communication Complexity. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 965-977). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973075.78
2009
Consensus and Mutual Exclusion in a Multiple Access Channel
Czyzowicz, J., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2009). Consensus and Mutual Exclusion in a Multiple Access Channel. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5805 (pp. 512-+). Retrieved from https://www.webofscience.com/
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
Kowalski, D. R., & Pelc, A. (2009). Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. In Unknown Conference (pp. 521-533). Springer Berlin Heidelberg. doi:10.1007/978-3-642-02930-1_43
Interference-Resilient Information Exchange
Gilbert, S., Guerraoui, R., Kowalski, D. R., & Newport, C. (2009). Interference-Resilient Information Exchange. In IEEE INFOCOM 2009 (pp. 2249-2257). IEEE. doi:10.1109/infcom.2009.5062150
Maximum throughput of multiple access channels in adversarial environments
Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2009). Maximum throughput of multiple access channels in adversarial environments. Distributed Computing, 22(2), 93-116. doi:10.1007/s00446-009-0086-4
Locally scalable randomized consensus for synchronous crash failures
Chlebus, B. S., & Kowalski, D. R. (2009). Locally scalable randomized consensus for synchronous crash failures. In Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures (pp. 290-299). ACM. doi:10.1145/1583991.1584063
Fast scalable deterministic consensus for crash failures
Chlebus, B. S., Kowalski, D. R., & Strojnowski, M. (2009). Fast scalable deterministic consensus for crash failures. In Proceedings of the 28th ACM symposium on Principles of distributed computing (pp. 111-120). ACM. doi:10.1145/1582716.1582738
Reliable distributed computing on unreliable radio channels
Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D. R., Newport, C., Kohn, F., & Lynch, N. (2009). Reliable distributed computing on unreliable radio channels. In Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3 - MobiHoc S3 '09 (pp. 1). ACM Press. doi:10.1145/1540358.1540360
Many-to-Many Communication in Radio Networks
Chlebus, B. S., Kowalski, D. R., & Radzik, T. (2009). Many-to-Many Communication in Radio Networks. Algorithmica, 54(1), 118-139. doi:10.1007/s00453-007-9123-5
Node discovery in networks
Konwar, K. M., Kowalski, D., & Shvartsman, A. A. (2009). Node discovery in networks. Journal of Parallel and Distributed Computing, 69(4), 337-348. doi:10.1016/j.jpdc.2008.11.006
Gossiping by processors prone to omission failures
Kowalski, D. R., & Strojnowski, M. (2009). Gossiping by processors prone to omission failures. Information Processing Letters, 109(6), 308-314. doi:10.1016/j.ipl.2007.11.022
2008
A robust randomized algorithm to perform independent tasks
Chlebus, B. S., Ga̧sieniec, L., Kowalski, D. R., & Shvartsman, A. A. (2008). A robust randomized algorithm to perform independent tasks. Journal of Discrete Algorithms, 6(4), 651-665. doi:10.1016/j.jda.2008.03.001
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
Gasieniec, L., Kowalski, D. R., Lingas, A., & Wahlen, M. (2008). Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 5218 (pp. 274-+). Retrieved from https://www.webofscience.com/
Asynchronous exclusive selection
Chlebus, B. S., & Kowalski, D. R. (2008). Asynchronous exclusive selection. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (pp. 375-384). ACM. doi:10.1145/1400751.1400801
On the complexity of asynchronous gossip
Georgiou, C., Gilbert, S., Guerraoui, R., & Kowalski, D. R. (2008). On the complexity of asynchronous gossip. In Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (pp. 135-144). ACM. doi:10.1145/1400751.1400771
Fast Radio Broadcasting with Advice
Ilcinkas, D., Kowalski, D. R., & Pelc, A. (n.d.). Fast Radio Broadcasting with Advice. In Unknown Conference (pp. 291-305). Springer Berlin Heidelberg. doi:10.1007/978-3-540-69355-0_24
Time efficient k-shot broadcasting in known topology radio networks
Gasieniec, L., Kantor, E., Kowalski, D. R., Peleg, D., & Su, C. (2008). Time efficient k-shot broadcasting in known topology radio networks. DISTRIBUTED COMPUTING, 21(2), 117-127. doi:10.1007/s00446-008-0058-0
How to meet in anonymous network
Kowalski, D. R., & Malinowski, A. (2008). How to meet in anonymous network. Theoretical Computer Science, 399(1-2), 141-156. doi:10.1016/j.tcs.2008.02.010
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
Kowalski, D. R., & Shvartsman, A. A. (2008). Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. ACM Transactions on Algorithms, 4(3), 1-22. doi:10.1145/1367064.1367073
2007
Searching for a Black Hole in Synchronous Tree Networks
CZYZOWICZ, J., KOWALSKI, D., MARKOU, E., & PELC, A. (2007). Searching for a Black Hole in Synchronous Tree Networks. Combinatorics, Probability and Computing, 16(04), 595. doi:10.1017/s0963548306008133
Energy and time efficient broadcasting in known topology radio networks
Gasieniec, L., Kantor, E., Kowalski, D. R., Peleg, D., & Su, C. (2007). Energy and time efficient broadcasting in known topology radio networks. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 4731 (pp. 253-+). Retrieved from https://www.webofscience.com/
On the Communication Surplus Incurred by Faulty Processors
Kowalski, D. R., & Strojnowski, M. (2007). On the Communication Surplus Incurred by Faulty Processors. In Unknown Conference (pp. 328-342). Springer Berlin Heidelberg. doi:10.1007/978-3-540-75142-7_26
On the Message Complexity of Indulgent Consensus
Gilbert, S., Guerraoui, R., & Kowalski, D. R. (2007). On the Message Complexity of Indulgent Consensus. In Unknown Conference (pp. 283-297). Springer Berlin Heidelberg. doi:10.1007/978-3-540-75142-7_23
Stability of the Multiple-Access Channel Under Maximum Broadcast Loads
Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (n.d.). Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. In Unknown Conference (pp. 124-138). Springer Berlin Heidelberg. doi:10.1007/978-3-540-76627-8_12
2006
Collective tree exploration
Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2006). Collective tree exploration. NETWORKS, 48(3), 166-177. doi:10.1002/net.20127
Node Discovery in Networks
Konwar, K. M., Kowalski, D., & Shvartsman, A. A. (2006). Node Discovery in Networks. In Unknown Conference (pp. 206-220). Springer Berlin Heidelberg. doi:10.1007/11795490_17
THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS
Chrobak, M., Gasieniec, L., & Kowalski, D. R. (2007). THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS. SIAM JOURNAL ON COMPUTING, 36(5), 1453-1471. doi:10.1137/S0097539704442726
Optimal Deterministic Broadcasting in Known Topology Radio Networks
Kowalski, D. R., & Pelc, A. (2006). Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Computing, 19(3), 185-195. doi:10.1007/s00446-006-0007-8
Adversarial queuing on the multiple-access channel
Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2006). Adversarial queuing on the multiple-access channel. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (pp. 92-101). ACM. doi:10.1145/1146381.1146398
Complexity of searching for a black hole
Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2006). Complexity of searching for a black hole. Fundamenta Informaticae, 71(2-3), 229-242.
Performing work in broadcast networks
Chlebus, B. S., Kowalski, D. R., & Lingas, A. (2006). Performing work in broadcast networks. Distributed Computing, 18(6), 435-451. doi:10.1007/s00446-005-0153-4
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Kesselman, A., & Kowalski, D. R. (2006). Fast distributed algorithm for convergecast in ad hoc geometric radio networks. Journal of Parallel and Distributed Computing, 66(4), 578-585. doi:10.1016/j.jpdc.2005.11.004
Average-Time Complexity of Gossiping in Radio Networks
Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2006). Average-Time Complexity of Gossiping in Radio Networks. In Unknown Conference (pp. 253-267). Springer Berlin Heidelberg. doi:10.1007/11780823_20
Deterministic Rendezvous in Graphs
Dessmark, A., Fraigniaud, P., Kowalski, D. R., & Pelc, A. (2006). Deterministic Rendezvous in Graphs. In Algorithmica Vol. 46 (pp. 69-96). Springer Science and Business Media LLC. doi:10.1007/s00453-006-0074-2
How to Meet in Anonymous Network
Kowalski, D. R., & Malinowski, A. (2006). How to Meet in Anonymous Network. In Unknown Conference (pp. 44-58). Springer Berlin Heidelberg. doi:10.1007/11780823_5
On Many-to-Many Communication in Packet Radio Networks
Chlebus, B. S., Kowalski, D. R., & Radzik, T. (2006). On Many-to-Many Communication in Packet Radio Networks. In Unknown Conference (pp. 260-274). Springer Berlin Heidelberg. doi:10.1007/11945529_19
Robust gossiping with an application to consensus
Chlebus, B. S., & Kowalski, D. R. (2006). Robust gossiping with an application to consensus. Journal of Computer and System Sciences, 72(8), 1262-1281. doi:10.1016/j.jcss.2006.08.001
Time and Communication Efficient Consensus for Crash Failures
Chlebus, B. S., & Kowalski, D. R. (2006). Time and Communication Efficient Consensus for Crash Failures. In Unknown Conference (pp. 314-328). Springer Berlin Heidelberg. doi:10.1007/11864219_22
2005
Performing work with asynchronous processors: Message-delay-sensitive bounds
Kowalski, D. R., & Shvartsman, A. A. (2005). Performing work with asynchronous processors: Message-delay-sensitive bounds. Information and Computation, 203(2), 181-210. doi:10.1016/j.ic.2005.08.002
Efficient gossip and robust distributed computation
Georgiou, C., Kowalski, D. R., & Shvartsman, A. A. (2005). Efficient gossip and robust distributed computation. Theoretical Computer Science, 347(1-2), 130-166. doi:10.1016/j.tcs.2005.05.019
Energy efficient connectivity in ad hoc networks from user's and designer's perspective
Kesselman, A., Kowalski, D., & Segal, M. (2005). Energy efficient connectivity in ad hoc networks from user's and designer's perspective. In IEEE International Conference on Communications Vol. 5 (pp. 3161-3165).
On selection problem in radio networks
Kowalski, D. R. (2005). On selection problem in radio networks. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (pp. 158-166). ACM. doi:10.1145/1073814.1073843
Broadcasting in undirected ad hoc radio networks
Kowalski, D. R., & Pelc, A. (2005). Broadcasting in undirected ad hoc radio networks. Distributed Computing, 18(1), 43-57. doi:10.1007/s00446-005-0126-7
Cooperative asynchronous update of shared memory
Chlebus, B. S., & Kowalski, D. R. (2005). Cooperative asynchronous update of shared memory. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (pp. 733-739). ACM. doi:10.1145/1060590.1060698
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
Kowalski, D. R., & Pelc, A. (2005). Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science, 333(3), 355-371. doi:10.1016/j.tcs.2004.04.017
Almost Optimal Explicit Selectors
Chlebus, B. S., & Kowalski, D. R. (2005). Almost Optimal Explicit Selectors. In Unknown Conference (pp. 270-280). Springer Berlin Heidelberg. doi:10.1007/11537311_24
Energy efficient communication in ad hoc networks from user's and designer's perspective
Kesselman, A., Kowalski, D. R., & Segal, M. (2005). Energy efficient communication in ad hoc networks from user's and designer's perspective. Mobile Computing and Communications Review, 9, 15-26.
Explicit combinatorial structures for cooperative distributed algorithms
Kowalski, D., Musiał, P. M., & Shvartsman, A. A. (2005). Explicit combinatorial structures for cooperative distributed algorithms. In Proceedings - International Conference on Distributed Computing Systems (pp. 49-58).
On the wake-up problem in radio networks
Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Radzik, T. (2005). On the wake-up problem in radio networks. In AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS Vol. 3580 (pp. 347-359). Retrieved from https://www.webofscience.com/
Searching for a Black Hole in Tree Networks
Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2005). Searching for a Black Hole in Tree Networks. In Unknown Conference (pp. 67-80). Springer Berlin Heidelberg. doi:10.1007/11516798_5
2004
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
Kesselman, A., & Kowalski, D. (n.d.). Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In Second Annual Conference on Wireless On-demand Network Systems and Services (pp. 119-124). IEEE. doi:10.1109/wons.2005.17
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
Kowalski, D. R., & Pelc, A. (2004). Faster Deterministic Broadcasting in Ad Hoc Radio Networks. SIAM Journal on Discrete Mathematics, 18(2), 332-346. doi:10.1137/s089548010342464x
A better wake-up in radio networks
Chlebus, B. S., & Kowalski, D. R. (2004). A better wake-up in radio networks. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (pp. 266-274). ACM. doi:10.1145/1011767.1011806
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors
Kowalski, D. R., & Shvartsman, A. A. (2004). Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (pp. 311-320). ACM. doi:10.1145/1007912.1007964
Collective asynchronous reading with polylogarithmic worst-case overhead
Chlebus, B. S., Kowalski, D. R., & Shvartsman, A. A. (2004). Collective asynchronous reading with polylogarithmic worst-case overhead. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (pp. 321-330). ACM. doi:10.1145/1007352.1007406
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
Kowalski, D. R., & Pelc, A. (2004). Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. SIAM Journal on Computing, 33(4), 870-891. doi:10.1137/s0097539702419339
The Wake-Up Problem in Multi-Hop Radio Networks
Chrobak, M., Ga̧sieniec, L., & Kowalski, D. (2004). The Wake-Up Problem in Multi-Hop Radio Networks. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Vol. 15 (pp. 985-993).
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks
Kowalski, D. R., & Pelc, A. (2004). Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. In Unknown Conference (pp. 171-182). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27821-4_16
Collective asynchronous reading with polylogarithmic worst-case overhead
Chlebus, B. S., Kowalski, D. R., & Shvartsman, A. A. (2004). Collective asynchronous reading with polylogarithmic worst-case overhead. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 321-330). doi:10.1145/1007352.1007406
Collective tree exploration
Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2004). Collective tree exploration. In LATIN 2004: THEORETICAL INFORMATICS Vol. 2976 (pp. 141-151). doi:10.1007/978-3-540-24698-5_18
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
Kowalski, D. R., Momenzadeh, M., & Shvartsman, A. A. (2004). Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems. In Unknown Conference (pp. 210-222). Springer Berlin Heidelberg. doi:10.1007/978-3-540-27860-3_20
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Kowalski, D. R., & Pelc, A. (2004). Polynomial Deterministic Rendezvous in Arbitrary Graphs. In Unknown Conference (pp. 644-656). Springer Berlin Heidelberg. doi:10.1007/978-3-540-30551-4_56
Randomization helps to perform independent tasks reliably
Chlebus, B. S., & Kowalski, D. R. (2004). Randomization helps to perform independent tasks reliably. Random Structures & Algorithms, 24(1), 11-41. doi:10.1002/rsa.10104
The join problem in dynamic network algorithms
Konwar, K. M., Kowalski, D. R., & Shvartsman, A. A. (2004). The join problem in dynamic network algorithms. In International Conference on Dependable Systems and Networks, 2004 (pp. 315-324). IEEE. doi:10.1109/dsn.2004.1311901
The wake-up problem in multi-hop radio networks.
Chrobak, M., Gasieniec, L., & Kowalski, D. R. (2004). The wake-up problem in multi-hop radio networks.. In J. I. Munro (Ed.), SODA (pp. 992-1000). SIAM. Retrieved from http://dl.acm.org/citation.cfm?id=982792
2003
Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds
Kowalski, D. R., & Shvartsman, A. A. (2003). Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing Vol. 22 (pp. 265-274).
Broadcasting Spanning Forests on a Multiple-Access Channel
Chlebus, B. S., Golab, K., & Kowalski, D. R. (2003). Broadcasting Spanning Forests on a Multiple-Access Channel. Theory of Computing Systems, 36(6), 711-733. doi:10.1007/s00224-003-1149-8
Broadcasting in undirected ad hoc radio networks
Kowalski, D. R., & Pelc, A. (2003). Broadcasting in undirected ad hoc radio networks. In Proceedings of the twenty-second annual symposium on Principles of distributed computing (pp. 73-82). ACM. doi:10.1145/872035.872045
Efficient Gossip and Robust Distributed Computation
Georgiou, C., Kowalski, D. R., & Shvartsman, A. A. (2003). Efficient Gossip and Robust Distributed Computation. In Unknown Conference (pp. 224-238). Springer Berlin Heidelberg. doi:10.1007/978-3-540-39989-6_16
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
Kowalski, D. R., & Pelc, A. (2003). Faster Deterministic Broadcasting in Ad Hoc Radio Networks. In Unknown Conference (pp. 109-120). Springer Berlin Heidelberg. doi:10.1007/3-540-36494-3_11
Time of Radio Broadcasting
Kowalski, D. R., & Pelc, A. (2003). Time of Radio Broadcasting. In Internaltional Colloquium on Structural Information Complexity (SIROCCO) (pp. 195-210). Umea: Carleton Scientific.
2002
Deterministic broadcasting time in radio networks of unknown topology
Kowalski, D. R., & Pelc, A. (2002). Deterministic broadcasting time in radio networks of unknown topology. In Annual Symposium on Foundations of Computer Science - Proceedings (pp. 63-72).
Bounding work and communication in robust cooperative computation
Chlebus, B. S., Gasieniec, L., Kowalski, D. R., & Shvartsman, A. A. (2002). Bounding work and communication in robust cooperative computation. In DISTRIBUTED COMPUTING, PROCEEDINGS Vol. 2508 (pp. 295-310). Retrieved from https://www.webofscience.com/
Finding Spanning Forests by Broadcasting
Chlebus, B. S., Golab, K., & Kowalski, D. R. (2002). Finding Spanning Forests by Broadcasting. In International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 41-56). Andros: Carleton Scientific.
Gossiping to reach consensus
Chlebus, B. S., & Kowalski, D. R. (2002). Gossiping to reach consensus. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02. ACM Press. doi:10.1145/564905.564908
2001
The do-all problem in broadcast networks
Chlebus, B. S., Kowalski, D. R., & Lingas, A. (2001). The do-all problem in broadcast networks. In Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (pp. 117-127). ACM. doi:10.1145/383962.384000
Towards practical deterministic Write-All algorithms
Chlebus, B. S., Malewicz, G., Dobrev, S., Shvartsman, A., Kowalski, D. R., & Vrto, I. (2001). Towards practical deterministic Write-All algorithms. In Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 271-280).
1999
Randomization helps to perform tasks on processors prone to failures
Chlebus, B. S., & Kowalski, D. R. (1999). Randomization helps to perform tasks on processors prone to failures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 1693 (pp. 284-296).