Costas Busch

According to our database1, Costas Busch authored at least 113 papers between 1994 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Graph representation of random signal and its application for sparse signal detection.
Digital Signal Processing, 2020

2019
Proteus: A Scalable BFT Consesus Protocol for Blockchains.
CoRR, 2019

Balanced Parallel Exploration of Orthogonal Regions.
Algorithms, 2019

CUDA-DTM: Distributed Transactional Memory for GPU Clusters.
Proceedings of the Networked Systems - 7th International Conference, 2019

An Experimental Evaluation of BFT Protocols for Blockchains.
Proceedings of the Blockchain - ICBC 2019, 2019

Consistent BFT Performance for Blockchains.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

Proteus: A Scalable BFT Consensus Protocol for Blockchains.
Proceedings of the IEEE International Conference on Blockchain, 2019

2018
Approximate Consistency in Transactional Memory.
IJNC, 2018

Time-communication impossibility results for distributed transactional memory.
Distributed Computing, 2018

Load Balanced Distributed Directories.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Polynomial Time Equilibria in Bottleneck Congestion Games.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Complete Visibility for Oblivious Robots in 풪(N) Time.
Proceedings of the Networked Systems - 6th International Conference, 2018

Distributed garbage collection for general graphs.
Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management, 2018

Window Based BFT Blockchain Consensus.
Proceedings of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, 2018

How to Make Fat Autonomous Robots See all Others Fast?
Proceedings of the 2018 IEEE International Conference on Robotics and Automation, 2018

The Complete Visibility Problem for Fat Robots with Lights.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Tight Analysis of a Collisionless Robot Gathering Algorithm.
TAAS, 2017

The Bursty Steiner Tree Problem.
Int. J. Found. Comput. Sci., 2017

Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Fast Scheduling in Distributed Transactional Memory.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

O(log N)-Time Complete Visibility for Asynchronous Robots with Lights.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Approximate Count and Queue Objects in Transactional Memory.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016
Direct Routing Algorithms.
Encyclopedia of Algorithms, 2016

Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks.
TOSN, 2016

Complete Visibility for Robots with Lights in O(1) Time.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Transactional Memory Scheduling Using Machine Learning Techniques.
Proceedings of the 24th Euromicro International Conference on Parallel, 2016

Approximately Opaque Multi-version Permissive Transactional Memory.
Proceedings of the 45th International Conference on Parallel Processing Workshops, 2016

Novel Fast User-Placement Ushering Algorithms for Indoor Femtocell Networks.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Optimal nearest neighbor queries in sensor networks.
Theor. Comput. Sci., 2015

Distributed Queuing in Dynamic Networks.
Parallel Processing Letters, 2015

A load balanced directory for distributed shared memory objects.
J. Parallel Distrib. Comput., 2015

Near-Optimal Location Tracking Using Sensor Networks.
IJNC, 2015

Efficient transformations for Klee's measure problem in the streaming model.
Comput. Geom., 2015

An Analysis Framework for Distributed Hierarchical Directories.
Algorithmica, 2015

Impossibility Results for Distributed Transactional Memory.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Logarithmic-Time Complete Visibility for Robots with Lights.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Bounds on Mutual Visibility Algorithms.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Mutual Visibility with an Optimal Number of Colors.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Transactional memory: models and algorithms.
SIGACT News, 2014

Distributed transactional memory for general networks.
Distributed Computing, 2014

Sparse Covers for Planar Graphs and Graphs that Exclude a Fixed Minor.
Algorithmica, 2014

Scheduling Multiple Objects in Distributed Transactional Memory.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Concurrent, parallel garbage collection in linear time.
Proceedings of the International Symposium on Memory Management, 2014

Work-Efficient Load Balancing.
Proceedings of the 43rd International Conference on Parallel Processing Workshops, 2014

A Note on Online Steiner Tree Problems.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
The Price of Anarchy is Unbounded for Congestion Games with Superpolynomial Latency Costs.
CoRR, 2013

2012
An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs.
IEEE Trans. Computers, 2012

Approximating Congestion + Dilation in Networks via "Quality of Routing" Games.
IEEE Trans. Computers, 2012

Window-based greedy contention management for transactional memory: theory and practice.
Distributed Computing, 2012

A Competitive Analysis for Balanced Transactional Memory Workloads.
Algorithmica, 2012

Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Distributed Transactional Memory for General Networks.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Split and Join: Strong Partitions and Universal Steiner Trees for Graphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

Towards Load Balanced Distributed Transactional Memory.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Stretch in Bottleneck Games.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

An Efficient Transformation for the Klee's Measure Problem in the Streaming Model.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Oblivious Routing for Sensor Network Topologies.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Oblivious Buy-at-Bulk in Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

On the Performance of Window-Based Contention Managers for Transactional Memory.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Optimal Price of Anarchy of Polynomial and Super-Polynomial Bottleneck Congestion Games.
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

Bottleneck Routing Games on Grids.
Proceedings of the Game Theory for Networks - 2nd International ICST Conference, 2011

2010
Concurrent counting is harder than queuing.
Theor. Comput. Sci., 2010

An efficient counting network.
Theor. Comput. Sci., 2010

Polynomial Bottleneck Congestion Games with Optimal Price of Anarchy
CoRR, 2010

An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
CoRR, 2010

Bottleneck Routing Games with Low Price of Anarchy
CoRR, 2010

Window-Based Greedy Contention Management for Transactional Memory.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Bottleneck Congestion Games with Logarithmic Price of Anarchy.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Optimal Oblivious Routing in Hole-Free Networks.
Proceedings of the Quality, Reliability, Security and Robustness in Heterogeneous Networks, 2010

2009
Atomic routing games on maximum congestion.
Theor. Comput. Sci., 2009

The Impact of Exponential Utility Costs in Bottleneck Routing Games
CoRR, 2009

Online Algorithms for Maximizing Quality of Link Transmissions over a Jammed Wireless Channel.
Proceedings of the Seventh Annual IEEE International Conference on Pervasive Computing and Communications, 2009

Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Direct Routing Algorithms.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Optimal Oblivious Path Selection on the Mesh.
IEEE Trans. Computers, 2008

Sketching asynchronous data streams over sliding windows.
Distributed Computing, 2008

Contention-free MAC protocols for asynchronous wireless sensor networks.
Distributed Computing, 2008

Bicretieria Optimization in Routing Games
CoRR, 2008

Quality of routing congestion games in wireless sensor networks.
Proceedings of the 4th Annual International Conference on Wireless Internet, 2008

2007
Universal Bufferless Packet Switching.
SIAM J. Comput., 2007

Efficient bufferless packet switching on trees and leveled networks.
J. Parallel Distrib. Comput., 2007

A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window.
Proceedings of the STACS 2007, 2007

Improved sparse covers for graphs excluding a fixed minor.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Eight Open Problems in Distributed Computing.
Bulletin of the EATCS, 2006

Direct Routing: Algorithms and Complexity.
Algorithmica, 2006

Sketching asynchronous streams over a sliding window.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

2005
The cost of concurrent, low-contention Read&Modify&Write.
Theor. Comput. Sci., 2005

Analysis of Link Reversal Routing Algorithms.
SIAM J. Comput., 2005

An Application of the Monotone Linearizability Lemma.
Bulletin of the EATCS, 2005

Hardness Results for Cake Cutting.
Bulletin of the EATCS, 2005

Oblivious routing on geometric networks.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Efficient Bufferless Routing on Leveled Networks.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks.
Theory Comput. Syst., 2004

Contention-Free MAC Protocols for Wireless Sensor Networks.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Universal Bufferless Routing.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Near-Optimal Hot-Potato Routing on Trees.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Cake-Cutting Is Not a Piece of Cake.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Analysis of link reversal routing algorithms for mobile ad hoc networks.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Threshold counters with increments and decrements.
Theor. Comput. Sci., 2002

Sorting and Counting Networks of Arbitrary Width and Small Depth.
Theory Comput. Syst., 2002

2001
Routing without flow control.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
A Combinatorial Characterization of Properties Preserved by Antitokens.
Bulletin of the EATCS, 2000

Supporting Increment and Decrement Operations in Balancing Networks.
Chicago J. Theor. Comput. Sci., 2000

Hard-Potato routing.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Randomized greedy hot-potato routing.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Sorting and Counting Networks of Small Depth and Arbitrary Width.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998
A Survey on Counting Networks.
Proceedings of the Distributed Data & Structures, 1998

1997
Impossibility Results for Weak Threshold Networks.
Inf. Process. Lett., 1997

1996
A Combinatorial Treatment of Balancing Networks.
J. ACM, 1996

The Strength of Counting Networks (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
A Logarithmic Depth Counting Network (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994
Contention in Counting Networks.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Proving Correctness for Balancing Networks.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994


  Loading...