Dariusz R. Kowalski

According to our database1, Dariusz R. Kowalski authored at least 189 papers between 1999 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Distributed Online and Stochastic Queueing on a Multiple Access Channel.
ACM Trans. Algorithms, 2018

Information gathering in ad-hoc radio networks with tree topology.
Inf. Comput., 2018

Competitive analysis of fundamental scheduling algorithms on a fault-prone machine and the impact of resource augmentation.
Future Generation Comp. Syst., 2018

Power Constrained Parallel Queuing with Contention.
CoRR, 2018

Routing in Wireless Networks with Interferences.
CoRR, 2018

Broadcasting Spanning Forests on a Multiple-Access Channel.
CoRR, 2018

Maximum Throughput of Multiple Access Channels in Adversarial Environments.
CoRR, 2018

Brief Announcement: Deterministic Contention Resolution on a Shared Channel.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Local Queuing Under Contention.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic Digital Clustering of Wireless Ad Hoc Networks.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Contention resolution in a non-synchronized multiple access channel.
Theor. Comput. Sci., 2017

Adaptive packet scheduling over a wireless channel under constrained jamming.
Theor. Comput. Sci., 2017

Fault tolerant scheduling of tasks of two sizes under resource augmentation.
J. Scheduling, 2017

Routing in Wireless Networks With Interferences.
IEEE Communications Letters, 2017

Doing-it-All with bounded work and communication.
Inf. Comput., 2017

Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel.
CoRR, 2017

Deterministic Digital Clustering of Wireless Ad Hoc Networks.
CoRR, 2017

Deterministic Backbone Creation in an SINR Network without Knowledge of Location.
CoRR, 2017

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations.
CoRR, 2017

Ad-hoc Affectance-selective Families for Layer Dissemination.
CoRR, 2017

Ordered and Delayed Adversaries and How to Work against Them on Shared Channel.
CoRR, 2017

Packet Latency of Deterministic Broadcasting in Adversarial Multiple Access Channels.
CoRR, 2017

Lightweight Robust Framework for Workload Scheduling in Clouds.
CoRR, 2017

Ad-hoc Affectance-selective Families for Layer Dissemination in IoT Subnets: Poster Abstract.
Proceedings of the Second International Conference on Internet-of-Things Design and Implementation, 2017

Lightweight Robust Framework for Workload Scheduling in Clouds.
Proceedings of the IEEE International Conference on Edge Computing, 2017

2016
Wake-Up Problem in Multi-Hop Radio Networks.
Encyclopedia of Algorithms, 2016

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.
Encyclopedia of Algorithms, 2016

Scalable wake-up of multi-channel single-hop radio networks.
Theor. Comput. Sci., 2016

Measuring the impact of adversarial errors on packet scheduling strategies.
J. Scheduling, 2016

Clique Here: On the Distributed Complexity in Fully-Connected Networks.
Parallel Processing Letters, 2016

Randomized mutual exclusion on a multiple access channel.
Distributed Computing, 2016

Universal Routing in Multi-hop Radio Networks.
CoRR, 2016

2015
Message and time efficient multi-broadcast schemes.
Theor. Comput. Sci., 2015

Online parallel scheduling of non-uniform tasks: Trading failures for energy.
Theor. Comput. Sci., 2015

Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel.
SIAM J. Comput., 2015

Stability of adversarial routing with feedback.
Networks, 2015

On the competitiveness of scheduling dynamically injected tasks on processes prone to crashes and restarts.
J. Parallel Distrib. Comput., 2015

Multi-Broadcasting under the SINR Model.
CoRR, 2015

Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model.
CoRR, 2015

Distributed Communication in Bare-Bones Wireless Networks.
CoRR, 2015

Asynchronous Exclusive Selection.
CoRR, 2015

Competitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation.
Proceedings of the Adaptive Resource Management and Scheduling for Cloud Computing, 2015

On setting-up asynchronous ad hoc wireless networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Provable fairness for TDMA scheduling.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Efficient Discovery of Malicious Symptoms in Clouds via Monitoring Virtual Machines.
Proceedings of the 15th IEEE International Conference on Computer and Information Technology, 2015

2014
Performance Analysis and Algorithm Selection for Reliable Multicast in IEEE 802.11aa Wireless LAN.
IEEE Trans. Vehicular Technology, 2014

Scheduling problems in transportation networks of line topology.
Optimization Letters, 2014

On the Impact of Geometry on Ad Hoc Communication in Wireless Networks.
CoRR, 2014

Information Gathering in Ad-Hoc Radio Networks with Tree Topology.
CoRR, 2014

Scalable Wake-up of Multi-Channel Single-Hop Radio Networks.
CoRR, 2014

Doing-it-All with Bounded Work and Communication.
CoRR, 2014

Decomposing broadcast algorithms using abstract MAC layers.
Ad Hoc Networks, 2014

Online Packet Scheduling Under Adversarial Jamming.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

On the impact of geometry on ad hoc communication in wireless networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Scalable Wake-up of Multi-channel Single-Hop Radio Networks.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Dynamic multiple-message broadcast: bounding throughput in the affectance model.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

Universal routing in multi hop radio network.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

Information Gathering in Ad-Hoc Radio Networks with Tree Topology.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness.
Random Struct. Algorithms, 2013

Leader election in ad hoc radio networks: A keen ear helps.
J. Comput. Syst. Sci., 2013

Asynchronous gossip.
J. ACM, 2013

On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up.
Discrete Mathematics & Theoretical Computer Science, 2013

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
CoRR, 2013

Message and time efficient multi-broadcast schemes.
Proceedings of the Proceedings Ninth International Workshop on Foundations of Mobile Computing, 2013

Online Packet Scheduling under Adversarial Jamming.
CoRR, 2013

Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy.
CoRR, 2013

Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.
CoRR, 2013

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies.
Proceedings of the Structural Information and Communication Complexity, 2013

A Multiagent Based Framework for the Simulation of Mammalian Behaviour.
Proceedings of the Research and Development in Intelligent Systems XXX, 2013

Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Stability of Adversarial Routing with Feedback.
Proceedings of the Networked Systems - First International Conference, 2013

Contention Resolution in a Non-synchronized Multiple Access Channel.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Station Assignment with Applications to Sensing.
Proceedings of the Algorithms for Sensor Systems, 2013

Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Adversarial Queuing on the Multiple Access Channel.
ACM Trans. Algorithms, 2012

Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model
CoRR, 2012

Distributed Broadcasting in Wireless Networks under the SINR Model
CoRR, 2012

Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks
CoRR, 2012

Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Distributed Online and Stochastic Queuing on a Multiple Access Channel.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Communication and privacy in dynamic message-passing systems.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Electing a Leader in Multi-hop Radio Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Scheduling of Vehicles in Transportation Networks.
Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012

2011
Coordination Problems in Ad Hoc Radio Networks.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Consensus and Mutual Exclusion in a Multiple Access Channel.
IEEE Trans. Parallel Distrib. Syst., 2011

Meeting the deadline: on the complexity of fault-tolerant continuous gossip.
Distributed Computing, 2011

Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Multi-channel Assignment for Communication in Radio Networks.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Medium Access Control for Adversarial Channels with Jamming.
Proceedings of the Structural Information and Communication Complexity, 2011

Towards Large-Scale Multi-Agent Based Rodent Simulation: The "Mice In A Box" Scenario.
Proceedings of the Research and Development in Intelligent Systems XXVIII, 2011

Time-efficient randomized multiple-message broadcast in radio networks.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Confidential Gossip.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Introduction.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Fast radio broadcasting with advice.
Theor. Comput. Sci., 2010

Emulating shared-memory Do-All algorithms in asynchronous message-passing systems.
J. Parallel Distrib. Comput., 2010

Bounds on Stability and Latency in Wireless Communication.
IEEE Communications Letters, 2010

Bounds on Stability and Latency in Wireless Communication
CoRR, 2010

Dynamic sharing of a multiple access channel
CoRR, 2010

Connectivity Problem in Wireless Networks.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Trusted Computing for Fault-Prone Wireless Networks.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Scalable Quantum Consensus for Crash Failures.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Dynamic Sharing of a Multiple Access Channel.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Distributed Agreement with Optimal Communication Complexity.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Meeting the deadline: on the complexity of fault-tolerant continuous gossip.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Deterministic Broadcast on Multiple Access Channels.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Towards Power-Sensitive Communication on a Multiple-Access Channel.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

Decomposing broadcast algorithms using abstract MAC layers.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2010

2009
Reliability and security in wireless networks.
SIGACT News, 2009

Node discovery in networks.
J. Parallel Distrib. Comput., 2009

Gossiping by processors prone to omission failures.
Inf. Process. Lett., 2009

Maximum throughput of multiple access channels in adversarial environments.
Distributed Computing, 2009

Many-to-Many Communication in Radio Networks.
Algorithmica, 2009

Consensus and Mutual Exclusion in a Multiple Access Channel.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Locally scalable randomized consensus for synchronous crash failures.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Fast scalable deterministic consensus for crash failures.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Interference-Resilient Information Exchange.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
How to meet in anonymous network.
Theor. Comput. Sci., 2008

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.
ACM Trans. Algorithms, 2008

A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms, 2008

Time efficient k-shot broadcasting in known topology radio networks.
Distributed Computing, 2008

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Fast Radio Broadcasting with Advice.
Proceedings of the Structural Information and Communication Complexity, 2008

On the complexity of asynchronous gossip.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Asynchronous exclusive selection.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
The Wake-Up Problem in MultiHop Radio Networks.
SIAM J. Comput., 2007

Optimal Deterministic Broadcasting in Known Topology Radio Networks.
Distributed Computing, 2007

Searching for a Black Hole in Synchronous Tree Networks.
Combinatorics, Probability & Computing, 2007

On the Communication Surplus Incurred by Faulty Processors.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Message Complexity of Indulgent Consensus.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Energy and Time Efficient Broadcasting in Known Topology Radio Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Stability of the Multiple-Access Channel Under Maximum Broadcast Loads.
Proceedings of the Stabilization, 2007

2006
Collective tree exploration.
Networks, 2006

Fast distributed algorithm for convergecast in ad hoc geometric radio networks.
J. Parallel Distrib. Comput., 2006

Robust gossiping with an application to consensus.
J. Comput. Syst. Sci., 2006

Complexity of Searching for a Black Hole.
Fundam. Inform., 2006

Performing work in broadcast networks.
Distributed Computing, 2006

Deterministic Rendezvous in Graphs.
Algorithmica, 2006

Time and Communication Efficient Consensus for Crash Failures.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

How to Meet in Anonymous Network.
Proceedings of the Structural Information and Communication Complexity, 2006

Average-Time Complexity of Gossiping in Radio Networks.
Proceedings of the Structural Information and Communication Complexity, 2006

Adversarial queuing on the multiple-access channel.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Many-to-Many Communication in Packet Radio Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.
Theor. Comput. Sci., 2005

Efficient gossip and robust distributed computation.
Theor. Comput. Sci., 2005

Energy efficient communication in ad hoc networks from user's and designer's perspective.
Mobile Computing and Communications Review, 2005

Performing work with asynchronous processors: Message-delay-sensitive bounds.
Inf. Comput., 2005

Broadcasting in undirected ad hoc radio networks.
Distributed Computing, 2005

Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks.
Proceedings of the 2nd International Conference on Wireless on Demand Network Systems and Service (WONS 2005), 2005

Cooperative asynchronous update of shared memory.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On selection problem in radio networks.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Node Discovery in Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Explicit Combinatorial Structures for Cooperative Distributed Algorithms.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Energy efficient connectivity in ad hoc networks from user's and designer's perspective.
Proceedings of IEEE International Conference on Communications, 2005

On the Wake-Up Problem in Radio Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Almost Optimal Explicit Selectors.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Faster Deterministic Broadcasting in Ad Hoc Radio Networks.
SIAM J. Discrete Math., 2004

Time of Deterministic Broadcasting in Radio Networks with Local Knowledge.
SIAM J. Comput., 2004

Randomization helps to perform independent tasks reliably.
Random Struct. Algorithms, 2004

Collective asynchronous reading with polylogarithmic worst-case overhead.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Writing-all deterministically and optimally using a non-trivial number of asynchronous processors.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

The wake-up problem in multi-hop radio networks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A better wake-up in radio networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Searching for a Black Hole in Tree Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Collective Tree Exploration.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Polynomial Deterministic Rendezvous in Arbitrary Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

The Join Problem in Dynamic Network Algorithms.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.
Proceedings of the Approximation, 2004

2003
Broadcasting Spanning Forests on a Multiple-Access Channel.
Theory Comput. Syst., 2003

Efficient Gossip and Robust Distributed Computation.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Faster Deterministic Broadcasting in Ad Hoc Radio Networks.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Time of Radio Broadcasting.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Performing work with asynchronous processors: message-delay-sensitive bounds.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Broadcasting in undirected ad hoc radio networks.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

2002
Bounding Work and Communication in Robust Cooperative Computation.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Gossiping to reach consensus.
SPAA, 2002

Finding Spanning Forests by Broadcasting.
Proceedings of the SIROCCO 9, 2002

Deterministic Broadcasting Time in Radio Networks of Unknown Topology.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Towards practical deteministic write-all algorithms.
SPAA, 2001

The do-all problem in broadcast networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

1999
Randomization Helps to Perform Tasks on Processors Prone to Failures.
Proceedings of the Distributed Computing, 1999


  Loading...