Prof Dariusz Kowalski

Professor in Computer Science Computer Science

    Publications

    2019

    Ordered and delayed adversaries and how to work against them on a shared channel (Journal article)

    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

    DOI: 10.1007/s00446-018-0341-7

    Polynomial anonymous dynamic distributed computing without a unique leader (Conference Paper)

    Kowalski, D. R., & Mosteiro, M. A. (2019). Polynomial anonymous dynamic distributed computing without a unique leader. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 132. doi:10.4230/LIPIcs.ICALP.2019.147

    DOI: 10.4230/LIPIcs.ICALP.2019.147

    Energy efficient adversarial routing in shared channels (Conference Paper)

    Chlebus, B. S., Hradovich, E., Jurdziński, T., Klonowski, M., & Kowalski, D. R. (2019). Energy efficient adversarial routing in shared channels. In Annual ACM Symposium on Parallelism in Algorithms and Architectures (pp. 191-200). doi:10.1145/3323165.3323190

    DOI: 10.1145/3323165.3323190

    Mmwave wireless backhaul scheduling of stochastic packet arrivals (Conference Paper)

    Garncarek, P., Jurdzinski, T., Kowalski, D. R., & Mosteiro, M. A. (2019). Mmwave wireless backhaul scheduling of stochastic packet arrivals. In Proceedings - 2019 IEEE 33rd International Parallel and Distributed Processing Symposium, IPDPS 2019 (pp. 708-717). doi:10.1109/IPDPS.2019.00079

    DOI: 10.1109/IPDPS.2019.00079

    Optimal Channel Utilization with Limited Feedback (Conference Paper)

    De Marco, G., Jurdziński, T., & Kowalski, D. R. (2019). Optimal Channel Utilization with Limited Feedback. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11651 LNCS (pp. 140-152). doi:10.1007/978-3-030-25027-0_10

    DOI: 10.1007/978-3-030-25027-0_10

    Reaching Consensus in Ad-Hoc Diffusion Networks (Conference Paper)

    Kowalski, D. R., & Mirek, J. (2019). Reaching Consensus in Ad-Hoc Diffusion Networks. In Unknown Conference (pp. 180-192). Springer International Publishing. doi:10.1007/978-3-030-14094-6_12

    DOI: 10.1007/978-3-030-14094-6_12

    Testing Methods to Minimise Range-shifting Time with Conservation Actions (Conference Paper)

    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 Proceedings of the 2019 11th International Conference on Bioinformatics and Biomedical Technology - ICBBT'19. ACM Press. doi:10.1145/3340074.3340076

    DOI: 10.1145/3340074.3340076

    The impact of the transversion/transition ratio on the optimal genetic code graph partition (Conference Paper)

    Aloqalaa, D. A., Kowalski, D. R., Błazej, P., Wnetrzak, M., Mackiewicz, D., & Mackiewicz, P. (2019). The impact of the transversion/transition ratio on the optimal genetic code graph partition. In BIOINFORMATICS 2019 - 10th International Conference on Bioinformatics Models, Methods and Algorithms, Proceedings; Part of 12th International Joint Conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2019 (pp. 55-65).

    Token traversal in ad hoc wireless networks via implicit carrier sensing (Journal article)

    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

    DOI: 10.1016/j.tcs.2019.09.016

    2018

    Randomized Rumor Spreading in Ad Hoc Networks with Buffers (Internet publication)

    Kowalski, D. R., & Caro, C. T. (n.d.). Randomized Rumor Spreading in Ad Hoc Networks with Buffers. Retrieved from http://arxiv.org/abs/1812.11903v1

    Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees (Journal article)

    Anta, A. F., 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), 1-19. doi:10.1145/3291529

    DOI: 10.1145/3291529

    Brief announcement: Deterministic contention resolution on a shared channel (Conference Paper)

    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

    DOI: 10.4230/LIPIcs.DISC.2018.44

    Local queuing under contention (Conference Paper)

    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

    DOI: 10.4230/LIPIcs.DISC.2018.28

    Estimating Invasion Time in Real Landscapes: Supplementary Materials (Other)

    Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., & Wong, P. W. H. (n.d.). Estimating Invasion Time in Real Landscapes: Supplementary Materials.

    Deterministic Digital Clustering of Wireless Ad Hoc Networks (Conference Paper)

    Jurdzinski, T., Kowalski, D. R., Rozanski, M., Stachowiak, G., & Machinery, A. C. (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

    DOI: 10.1145/3212734.3212752

    Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations (Conference Paper)

    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. doi:10.4230/LIPIcs.ICALP.2018.156

    DOI: 10.4230/LIPIcs.ICALP.2018.156

    Distributed Online and Stochastic Queueing on a Multiple Access Channel (Journal article)

    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

    DOI: 10.1145/3182396

    Effective use of congestion in complex networks (Journal article)

    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

    DOI: 10.1016/j.physa.2017.11.159

    Information gathering in ad-hoc radio networks with tree topology (Journal article)

    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

    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 (Journal article)

    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

    DOI: 10.1016/j.future.2016.05.042

    Estimating Invasion Time in Real Landscapes (Conference Paper)

    Aloqalaa, D. A., Hodgson, J. A., Kowalski, D. R., Wong, P. W. H., & Machinery, A. C. (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

    DOI: 10.1145/3290818.3290825

    Packet latency of deterministic broadcasting in adversarial multiple access channels (Journal article)

    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

    DOI: 10.1016/j.jcss.2018.07.001

    2017

    Fault tolerant scheduling of tasks of two sizes under resource augmentation (Journal article)

    Kowalski, D. R., Wong, P. W. H., & 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

    DOI: 10.1007/s10951-017-0541-1

    Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel (Journal article)

    Klonowski, M., Kowalski, D. R., Mirek, J., & Wong, P. W. H. (n.d.). Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel. Retrieved from http://arxiv.org/abs/1710.07380v4

    Adaptive packet scheduling over a wireless channel under constrained jamming (Journal article)

    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

    DOI: 10.1016/j.tcs.2017.06.020

    Contention resolution in a non-synchronized multiple access channel (Journal article)

    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

    DOI: 10.1016/j.tcs.2017.05.014

    Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds (Conference Paper)

    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). IEEE. doi:10.1109/icccn.2017.8038506

    DOI: 10.1109/icccn.2017.8038506

    Routing in Wireless Networks With Interferences (Journal article)

    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

    DOI: 10.1109/LCOMM.2017.2716348

    Doing-it-All with bounded work and communication (Journal article)

    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

    DOI: 10.1016/j.ic.2017.02.003

    Doing-it-All with bounded work and communication. (Journal article)

    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

    DOI: 10.1016/j.ic.2017.02.003

    Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets (Conference Paper)

    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 - IoTDI '17. ACM Press. doi:10.1145/3054977.3057292

    DOI: 10.1145/3054977.3057292

    The Impact of Hierarchical Structure on Efficiency of Cloud Monitoring (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Lightweight Robust Framework for Workload Scheduling in Clouds (Conference Paper)

    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

    DOI: 10.1109/IEEE.EDGE.2017.36

    2016

    Performance Analysis of Molecular Communication Model (Conference Paper)

    Juhi, A., Kowalski, D. R., Lisitsa, A., & IEEE. (2016). Performance Analysis of Molecular Communication Model. In 2016 IEEE 16TH INTERNATIONAL CONFERENCE ON NANOTECHNOLOGY (IEEE-NANO) (pp. 826-829). Retrieved from http://gateway.webofknowledge.com/

    Distributed Broadcasting in Wireless Networks under the SINR Model (Chapter)

    Jurdzinski, T., Kowalski, D. R., Maciejewski, T., & Stachowiak, G. (n.d.). Distributed Broadcasting in Wireless Networks under the SINR Model. Retrieved from http://arxiv.org/abs/1207.6732v2

    Wake-Up Problem in Multi-Hop Radio Networks (Chapter)

    Kowalski, D. R., & Jurdzinski, T. (2016). Wake-Up Problem in Multi-Hop Radio Networks. In Encyclopedia of Algorithms (pp. 2352-2354). Springer.

    Measuring the impact of adversarial errors on packet scheduling strategies (Journal article)

    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

    DOI: 10.1007/s10951-015-0451-z

    Clique Here: On the Distributed Complexity in Fully-Connected Networks (Journal article)

    Applebaum, B., Kowalski, D. R., Patt-Shamir, B., & Rosén, A. (2016). Clique Here: On the Distributed Complexity in Fully-Connected Networks. Parallel Processing Letters, 26(01), 1650004. doi:10.1142/S0129626416500043

    DOI: 10.1142/S0129626416500043

    Randomized mutual exclusion on a multiple access channel (Journal article)

    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

    DOI: 10.1007/s00446-016-0265-z

    Scalable wake-up of multi-channel single-hop radio networks (Journal article)

    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

    DOI: 10.1016/j.tcs.2015.11.046

    Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation (Conference Paper)

    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

    DOI: 10.1007/978-3-319-28448-4_1

    Balancing Mobility Algorithm for Monitoring Virtual Machines in Clouds (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Failure or Denial of Service? A Rethink of the Cloud Recovery Model (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid (Conference Paper)

    Arikiez, M., Grasso, F., Kowalski, D., Zito, M., & IEEE. (2016). Heuristic Algorithm for Minimizing the Electricity Cost of Air Conditioners on a Smart Grid. In 2016 IEEE INTERNATIONAL ENERGY CONFERENCE (ENERGYCON). Retrieved from http://gateway.webofknowledge.com/

    2015

    On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts (Journal article)

    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

    DOI: 10.1016/j.jpdc.2015.07.007

    Provable fairness for TDMA scheduling (Conference Paper)

    Bienkowski, M., Byrka, J., Chrobak, K., Jurdzinski, T., & Kowalski, D. (2015). Provable fairness for TDMA scheduling. In 2015 IEEE Conference on Computer Communications (INFOCOM). IEEE. doi:10.1109/infocom.2015.7218508

    DOI: 10.1109/infocom.2015.7218508

    Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines (Conference Paper)

    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

    DOI: 10.1109/CIT/IUCC/DASC/PICOM.2015.257

    FAST NONADAPTIVE DETERMINISTIC ALGORITHM FOR CONFLICT RESOLUTION IN A DYNAMIC MULTIPLE-ACCESS CHANNEL (Journal article)

    De Marco, G., & Kowalski, D. R. (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

    DOI: 10.1137/140982763

    Fault Tolerant Scheduling of Non-uniform Tasks under Resource Augmentation (Conference Paper)

    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 (Conference Paper)

    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 (Journal article)

    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

    DOI: 10.1016/j.tcs.2014.12.006

    On Setting-Up Asynchronous Ad Hoc Wireless Networks (Conference Paper)

    Jurdzinski, T., Kowalski, D. R., Rozanski, M., Stachowiak, G., & IEEE. (2015). On Setting-Up Asynchronous Ad Hoc Wireless Networks. In 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM). Retrieved from http://gateway.webofknowledge.com/

    Online Packet Scheduling Under Adversarial Jamming (Conference Paper)

    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

    DOI: 10.1007/978-3-319-18263-6_17

    Online parallel scheduling of non-uniform tasks: Trading failures for energy (Journal article)

    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

    DOI: 10.1016/j.tcs.2015.01.027

    Stability of adversarial routing with feedback (Journal article)

    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

    DOI: 10.1002/net.21607

    2014

    Decomposing broadcast algorithms using abstract MAC layers (Journal article)

    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

    DOI: 10.1016/j.adhoc.2011.12.001

    Dynamic multiple-message broadcast (Conference Paper)

    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 - FOMC '14. ACM Press. doi:10.1145/2634274.2634279

    DOI: 10.1145/2634274.2634279

    Information Gathering in Ad-Hoc Radio Networks with Tree Topology (Journal article)

    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

    DOI: 10.1007/978-3-319-12691-3_11

    Information Gathering in Ad-Hoc Radio Networks with Tree Topology. (Conference Paper)

    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

    On the impact of geometry on ad hoc communication in wireless networks (Conference Paper)

    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. ACM Press. doi:10.1145/2611462.2611487

    DOI: 10.1145/2611462.2611487

    Performance Analysis and Algorithm Selection for Reliable Multicast in IEEE 802.11aa Wireless LAN (Journal article)

    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

    DOI: 10.1109/TVT.2014.2306014

    Scalable Wake-up of Multi-channel Single-Hop Radio Networks (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Scheduling problems in transportation networks of line topology (Journal article)

    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

    DOI: 10.1007/s11590-013-0613-x

    The Wake-Up Problem in Multi-Hop Radio Networks (Journal article)

    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

    DOI: 10.1007/978-3-642-27848-8_536-1

    Universal routing in multi hop radio network (Conference Paper)

    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 - FOMC '14. ACM Press. doi:10.1145/2634274.2634278

    DOI: 10.1145/2634274.2634278

    2013

    Station Assignment with Applications to Sensing (Conference Paper)

    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

    DOI: 10.1007/978-3-642-45346-5_12

    Distributed Randomized Broadcasting in Wireless Networks under the SINR Model (Conference Paper)

    Jurdzinski, T., Kowalski, D. R., Rozanski, M., & Stachowiak, G. (2013). Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. In Unknown Conference (pp. 373-387). Springer Berlin Heidelberg. doi:10.1007/978-3-642-41527-2_26

    DOI: 10.1007/978-3-642-41527-2_26

    Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies (Conference Paper)

    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

    DOI: 10.1007/978-3-319-03578-9_22

    On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups (Journal article)

    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 (Journal article)

    Levin, L., Kowalski, D. R., & Segal, M. (n.d.). Message and time efficient multi-broadcast schemes. EPTCS 132, 2013, pp. 21-37. doi:10.4204/EPTCS.132.3

    DOI: 10.4204/EPTCS.132.3

    Contention Resolution in a Non-synchronized Multiple Access Channel (Conference Paper)

    De Marco, G., & Kowalski, D. R. (2013). Contention Resolution in a Non-synchronized Multiple Access Channel. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing. IEEE. doi:10.1109/ipdps.2013.68

    DOI: 10.1109/ipdps.2013.68

    Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-39247-4_21

    Synchronous byzantine agreement with nearly a cubic number of communication bits (Conference Paper)

    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 - PODC '13. ACM Press. doi:10.1145/2484239.2484271

    DOI: 10.1145/2484239.2484271

    Stability of Adversarial Routing with Feedback (Conference Paper)

    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

    DOI: 10.1007/978-3-642-40148-0_15

    Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices (Conference Paper)

    Jurdzinski, T., Kowalski, D. R., & Stachowiak, G. (2013). Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices. In Unknown Conference (pp. 632-644). Springer Berlin Heidelberg. doi:10.1007/978-3-642-39212-2_55

    DOI: 10.1007/978-3-642-39212-2_55

    A Multiagent Based Framework for the Simulation of Mammalian Behaviour (Conference Paper)

    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.

    Asynchronous gossip (Journal article)

    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

    DOI: 10.1145/2450142.2450147

    Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-40164-0_20

    Leader election in ad hoc radio networks: A keen ear helps (Journal article)

    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

    DOI: 10.1016/j.jcss.2013.04.003

    Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy (Conference Paper)

    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

    DOI: 10.1007/978-3-642-40164-0_16

    Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness (Journal article)

    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

    DOI: 10.1002/rsa.20417

    2012

    Electing a Leader in Multi-hop Radio Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-35476-2_8

    On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-35476-2_15

    Distributed Online and Stochastic Queuing on a Multiple Access Channel (Conference Paper)

    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

    DOI: 10.1007/978-3-642-33651-5_9

    Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks (Conference Paper)

    Jurdzinski, T., & Kowalski, D. R. (n.d.). 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 (Conference Paper)

    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

    DOI: 10.1007/978-3-642-29667-3_11

    Adversarial Queuing on the Multiple Access Channel (Conference Paper)

    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). doi:10.1145/2071379.2071384

    DOI: 10.1145/2071379.2071384

    2011

    Towards large-scale multi-agent based rodent simulation: The "mice in a box" scenario (Conference Paper)

    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

    DOI: 10.1007/978-1-4471-2318-7-28

    Introduction (Conference Paper)

    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

    DOI: 10.1007/978-3-642-23400-2_51

    Confidential Gossip (Conference Paper)

    Georgiou, C., Gilbert, S., & Kowalski, D. R. (2011). Confidential Gossip. In 2011 31st International Conference on Distributed Computing Systems. IEEE. doi:10.1109/icdcs.2011.71

    DOI: 10.1109/icdcs.2011.71

    Multi-channel Assignment for Communication in Radio Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-19754-3_19

    'Proceedings of the Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing' (Conference Paper)

    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

    Consensus and Mutual Exclusion in a Multiple Access Channel (Journal article)

    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

    DOI: 10.1109/TPDS.2010.162

    Efficient Distributed Communication in Ad-Hoc Radio Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-22012-8_49

    Medium Access Control for Adversarial Channels with Jamming (Conference Paper)

    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

    DOI: 10.1007/978-3-642-22212-2_9

    Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Journal article)

    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

    DOI: 10.1007/s00446-011-0144-6

    Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts (Conference Paper)

    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

    DOI: 10.1007/978-3-642-24100-0_15

    Time-efficient randomized multiple-message broadcast in radio networks (Conference Paper)

    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 - PODC '11. ACM Press. doi:10.1145/1993806.1993884

    DOI: 10.1145/1993806.1993884

    2010

    Bounds on Stability and Latency in Wireless Communication (Journal article)

    Cholvi, V., & Kowalski, D. R. (n.d.). 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 (Journal article)

    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

    DOI: 10.1016/j.jpdc.2009.12.002

    Distributed agreement with optimal communication complexity (Conference Paper)

    Gilbert, S., & Kowalski, D. R. (2010). Distributed agreement with optimal communication complexity. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 965-977).

    Fast radio broadcasting with advice (Journal article)

    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

    DOI: 10.1016/j.tcs.2010.01.004

    Deterministic Broadcast on Multiple Access Channels (Conference Paper)

    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

    DOI: 10.1109/infcom.2010.5462256

    Dynamic sharing of a multiple access channel (Conference Paper)

    Bienkowski, M., Klonowski, M., Korzeniowski, M., & Kowalski, D. R. (n.d.). Dynamic sharing of a multiple access channel. Retrieved from http://arxiv.org/abs/1001.3044v2

    Connectivity Problem in Wireless Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-15763-9_32

    Decomposing broadcast algorithms using abstract MAC layers (Conference Paper)

    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 - DIALM-POMC '10. ACM Press. doi:10.1145/1860684.1860690

    DOI: 10.1145/1860684.1860690

    Meeting the deadline (Conference Paper)

    Georgiou, C., Gilbert, S., & Kowalski, D. R. (2010). Meeting the deadline. In Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10. ACM Press. doi:10.1145/1835698.1835759

    DOI: 10.1145/1835698.1835759

    Scalable Quantum Consensus for Crash Failures (Conference Paper)

    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

    DOI: 10.1007/978-3-642-15763-9_24

    Towards Power-Sensitive Communication on a Multiple-Access Channel (Conference Paper)

    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. IEEE. doi:10.1109/icdcs.2010.50

    DOI: 10.1109/icdcs.2010.50

    Trusted Computing for Fault-Prone Wireless Networks (Conference Paper)

    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

    DOI: 10.1007/978-3-642-15763-9_33

    2009

    Maximum throughput of multiple access channels in adversarial environments (Journal article)

    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

    DOI: 10.1007/s00446-009-0086-4

    Reliable distributed computing on unreliable radio channels (Conference Paper)

    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. ACM Press. doi:10.1145/1540358.1540360

    DOI: 10.1145/1540358.1540360

    Many-to-Many Communication in Radio Networks (Journal article)

    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

    DOI: 10.1007/s00453-007-9123-5

    Interference-Resilient Information Exchange (Conference Paper)

    Gilbert, S., Guerraoui, R., Kowalski, D. R., & Newport, C. (2009). Interference-Resilient Information Exchange. In IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. IEEE. doi:10.1109/infcom.2009.5062150

    DOI: 10.1109/infcom.2009.5062150

    Node discovery in networks (Journal article)

    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

    DOI: 10.1016/j.jpdc.2008.11.006

    Gossiping by processors prone to omission failures (Journal article)

    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

    DOI: 10.1016/j.ipl.2007.11.022

    Consensus and Mutual Exclusion in a Multiple Access Channel (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Fast scalable deterministic consensus for crash failures (Conference Paper)

    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 - PODC '09. ACM Press. doi:10.1145/1582716.1582738

    DOI: 10.1145/1582716.1582738

    Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps (Conference Paper)

    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

    DOI: 10.1007/978-3-642-02930-1_43

    Locally scalable randomized consensus for synchronous crash failures (Conference Paper)

    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 - SPAA '09. ACM Press. doi:10.1145/1583991.1584063

    DOI: 10.1145/1583991.1584063

    2008

    Asynchronous exclusive selection (Conference Paper)

    Chlebus, B. S., & Kowalski, D. R. (2008). Asynchronous exclusive selection. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 375-384).

    Fast Radio Broadcasting with Advice (Conference Paper)

    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

    DOI: 10.1007/978-3-540-69355-0_24

    Time efficient k-shot broadcasting in known topology radio networks (Journal article)

    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

    DOI: 10.1007/s00446-008-0058-0

    How to meet in anonymous network (Journal article)

    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

    DOI: 10.1016/j.tcs.2008.02.010

    Writing-all deterministically and optimally using a nontrivial number of asynchronous processors (Journal article)

    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

    DOI: 10.1145/1367064.1367073

    A robust randomized algorithm to perform independent tasks (Journal article)

    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

    DOI: 10.1016/j.jda.2008.03.001

    Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Conference Paper)

    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 http://gateway.webofknowledge.com/

    On the complexity of asynchronous gossip (Conference Paper)

    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 - PODC '08. ACM Press. doi:10.1145/1400751.1400771

    DOI: 10.1145/1400751.1400771

    2007

    On the communication surplus incurred by faulty processors (Conference Paper)

    Kowalski, D. R., & Strojnowski, M. (2007). On the communication surplus incurred by faulty processors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4731 LNCS (pp. 328-342).

    On the message complexity of indulgent consensus (Conference Paper)

    Gilbert, S., Guerraoui, R., & Kowalski, D. R. (2007). On the message complexity of indulgent consensus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4731 LNCS (pp. 283-297).

    Stability of the multiple-access channel under maximum broadcast loads (Conference Paper)

    Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2007). Stability of the multiple-access channel under maximum broadcast loads. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4838 LNCS (pp. 124-138).

    Energy and time efficient broadcasting in known topology radio networks (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Optimal Deterministic Broadcasting in Known Topology Radio Networks (Journal article)

    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

    DOI: 10.1007/s00446-006-0007-8

    Searching for a Black Hole in Synchronous Tree Networks (Journal article)

    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

    DOI: 10.1017/S0963548306008133

    THE WAKE-UP PROBLEM IN MULTIHOP RADIO NETWORKS (Journal article)

    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

    DOI: 10.1137/S0097539704442726

    2006

    Time and communication efficient consensus for crash failures (Conference Paper)

    Chlebus, B. S., & Kowalski, D. R. (2006). Time and communication efficient consensus for crash failures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4167 LNCS (pp. 314-328).

    Node Discovery in Networks (Conference Paper)

    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

    DOI: 10.1007/11795490_17

    On many-to-many communication in packet radio networks (Conference Paper)

    Chlebus, B. S., Kowalski, D. R., & Radzik, T. (2006). On many-to-many communication in packet radio networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4305 LNCS (pp. 260-274). doi:10.1007/11945529-19

    DOI: 10.1007/11945529-19

    Adversarial queuing on the multiple-access channel (Conference Paper)

    Chlebus, B. S., Kowalski, D. R., & Rokicki, M. A. (2006). Adversarial queuing on the multiple-access channel. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing Vol. 2006 (pp. 92-101).

    Deterministic Rendezvous in Graphs (Conference Paper)

    Dessmark, A., Fraigniaud, P., Kowalski, D. R., & Pelc, A. (2006). Deterministic Rendezvous in Graphs. In Algorithmica Vol. 46 (pp. 69-96). doi:10.1007/s00453-006-0074-2

    DOI: 10.1007/s00453-006-0074-2

    Complexity of searching for a black hole (Journal article)

    Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2006). Complexity of searching for a black hole. Fundamenta Informaticae, 71(2-3), 229-242.

    Average-Time Complexity of Gossiping in Radio Networks (Conference Paper)

    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

    DOI: 10.1007/11780823_20

    Collective tree exploration (Journal article)

    Fraigniaud, P., Gasieniec, L., Kowalski, D. R., & Pelc, A. (2006). Collective tree exploration. NETWORKS, 48(3), 166-177. doi:10.1002/net.20127

    DOI: 10.1002/net.20127

    Fast distributed algorithm for convergecast in ad hoc geometric radio networks (Journal article)

    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

    DOI: 10.1016/j.jpdc.2005.11.004

    How to meet in anonymous network (Conference Paper)

    Kowalski, D. R., & Malinowski, A. (2006). How to meet in anonymous network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 4056 LNCS (pp. 44-58).

    Performing work in broadcast networks (Journal article)

    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

    DOI: 10.1007/s00446-005-0153-4

    Robust gossiping with an application to consensus (Journal article)

    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

    DOI: 10.1016/j.jcss.2006.08.001

    2005

    Almost optimal explicit selectors (Conference Paper)

    Chlebus, B. S., & Kowalski, D. R. (2005). Almost optimal explicit selectors. In Lecture Notes in Computer Science Vol. 3623 (pp. 270-280).

    Searching for a black hole in tree networks (Conference Paper)

    Czyzowicz, J., Kowalski, D., Markou, E., & Pelc, A. (2005). Searching for a black hole in tree networks. In Lecture Notes in Computer Science Vol. 3544 (pp. 67-80).

    Energy efficient connectivity in ad hoc networks from user's and designer's perspective (Conference Paper)

    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).

    Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks (Conference Paper)

    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. IEEE. doi:10.1109/wons.2005.17

    DOI: 10.1109/wons.2005.17

    Broadcasting in undirected ad hoc radio networks (Journal article)

    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

    DOI: 10.1007/s00446-005-0126-7

    Cooperative asynchronous update of shared memory (Conference Paper)

    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 - STOC '05. ACM Press. doi:10.1145/1060590.1060698

    DOI: 10.1145/1060590.1060698

    Efficient gossip and robust distributed computation (Journal article)

    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

    DOI: 10.1016/j.tcs.2005.05.019

    Energy efficient communication in ad hoc networks from user's and designer's perspective (Journal article)

    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 (Conference Paper)

    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 selection problem in radio networks (Conference Paper)

    Kowalski, D. R. (2005). On selection problem in radio networks. In Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05. ACM Press. doi:10.1145/1073814.1073843

    DOI: 10.1145/1073814.1073843

    On the wake-up problem in radio networks (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Performing work with asynchronous processors: Message-delay-sensitive bounds (Journal article)

    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

    DOI: 10.1016/j.ic.2005.08.002

    Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Journal article)

    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

    DOI: 10.1016/j.tcs.2004.04.017

    2004

    A better wake-up in radio networks (Conference Paper)

    Chlebus, B. S., & Kowalski, D. R. (2004). A better wake-up in radio networks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing Vol. 23 (pp. 266-274).

    Centralized deterministic broadcasting in undirected multi-hop radio networks (Conference Paper)

    Kowalski, D. R., & Pelc, A. (2004). Centralized deterministic broadcasting in undirected multi-hop radio networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 3122 (pp. 171-182).

    Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Conference Paper)

    Kowalski, D. R., Momenzadeh, M., & Shvartsman, A. A. (2004). Emulating shared-memory do-all algorithms in asynchronous message-passing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 3144 (pp. 210-222).

    Polynomial deterministic rendezvous in arbitrary graphs (Conference Paper)

    Kowalski, D. R., & Pelc, A. (2004). Polynomial deterministic rendezvous in arbitrary graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 3341 (pp. 644-656).

    Writing-all deterministically and optimally using a non-trivial number of asynchronous processors (Conference Paper)

    Kowalski, D. R., & Shvartsman, A. A. (2004). Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. In Annual ACM Symposium on Parallel Algorithms and Architectures Vol. 16 (pp. 311-320).

    The join problem in dynamic network algorithms (Conference Paper)

    Konwar, K. M., Kowalski, D. R., & Shvartsman, A. A. (2004). The join problem in dynamic network algorithms. In Proceedings of the International Conference on Dependable Systems and Networks (pp. 315-324).

    Collective asynchronous reading with polylogarithmic worst-case overhead (Conference Paper)

    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).

    The Wake-Up Problem in Multi-Hop Radio Networks (Conference Paper)

    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).

    Collective asynchronous reading with polylogarithmic worst-case overhead (Conference Paper)

    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 - STOC '04. ACM Press. doi:10.1145/1007352.1007406

    DOI: 10.1145/1007352.1007406

    Collective tree exploration (Conference Paper)

    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

    DOI: 10.1007/978-3-540-24698-5_18

    Faster Deterministic Broadcasting in Ad Hoc Radio Networks (Journal article)

    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

    DOI: 10.1137/S089548010342464X

    Randomization helps to perform independent tasks reliably (Journal article)

    Chlebus, B. S., & Kowalski, D. R. (2004). Randomization helps to perform independent tasks reliably. Random Structures and Algorithms, 24(1), 11-41. doi:10.1002/rsa.10104

    DOI: 10.1002/rsa.10104

    The wake-up problem in multi-hop radio networks. (Conference Paper)

    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

    Time of Deterministic Broadcasting in Radio Networks with Local Knowledge (Journal article)

    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

    DOI: 10.1137/S0097539702419339

    2003

    Broadcasting in Undirected Ad hoc Radio Networks (Conference Paper)

    Kowalski, D. R., & Pelc, A. (2003). Broadcasting in Undirected Ad hoc Radio Networks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing Vol. 22 (pp. 73-82).

    Efficient gossip and robust distributed computation (Conference Paper)

    Georgiou, C., Kowalski, D. R., & Shvartsman, A. A. (2003). Efficient gossip and robust distributed computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 2848 (pp. 224-238).

    Faster deterministic broadcasting in Ad Hoc radio retworks (Conference Paper)

    Kowalski, D. R., & Pelc, A. (2003). Faster deterministic broadcasting in Ad Hoc radio retworks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 2607 (pp. 109-120).

    Performing Work with Asynchronous Processors: Message-Delay-Sensitive Bounds (Conference Paper)

    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 (Journal article)

    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

    DOI: 10.1007/s00224-003-1149-8

    Time of Radio Broadcasting (Conference Paper)

    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 (Conference Paper)

    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 (Conference Paper)

    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 http://gateway.webofknowledge.com/

    Finding Spanning Forests by Broadcasting (Conference Paper)

    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 (Conference Paper)

    Chlebus, B. S., & Kowalski, D. R. (2002). Gossiping to reach consensus. In Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 220-229).

    2001

    The Do-All problem in broadcast networks (Conference Paper)

    Chlebus, B. S., Kowalski, D. R., & Lingas, A. (2001). The Do-All problem in broadcast networks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 117-126).

    Towards practical deterministic Write-All algorithms (Conference Paper)

    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 (Conference Paper)

    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).