Amotz Bar-Noy

According to our database1, Amotz Bar-Noy authored at least 200 papers between 1985 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Decision-driven scheduling.
Real-Time Systems, 2019

Graph Profile Realizations and Applications to Social Networks.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Dynamic sensor selection for path coverage.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018
Athena: Towards Decision-Centric Anticipatory Sensor Information Delivery.
J. Sensor and Actuator Networks, 2018

Realizability of Graph Specifications: Characterizations and Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2018

Local Algorithms for Sensor Selection.
Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, 2018

Poster: Local Algorithms for Sensor Selection.
Proceedings of the 2018 International Conference on Embedded Wireless Systems and Networks, 2018

Leveraging Knowledge for Path Exposure.
Proceedings of the 14th International Conference on Distributed Computing in Sensor Systems, 2018

Quantifying the Strength of the Friendship Paradox.
Proceedings of the Complex Networks and Their Applications VII, 2018

2017
Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast.
IEEE Trans. Mob. Comput., 2017

Set It and Forget It: Approximating the Set Once Strip Cover Problem.
Algorithmica, 2017

Gathering Information in Sensor Networks for Synchronized Freshness.
Proceedings of the 14th Annual IEEE International Conference on Sensing, 2017

Controlled growth of simplicial complex networks.
Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Decision-Driven Execution: A Distributed Resource Management Paradigm for the Age of IoT.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Sensor Selection for Heterogeneous Coverage Measures.
Proceedings of the 13th International Conference on Distributed Computing in Sensor Systems, 2017

2016
Efficient Mechanism Design for Competitive Carrier Selection and Rate Allocation.
IEEE Trans. Vehicular Technology, 2016

Tight Approximation Bounds for the Seminar Assignment Problem.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Sporadic Decision-Centric Data Scheduling with Normally-off Sensors.
Proceedings of the 2016 IEEE Real-Time Systems Symposium, 2016

On Maximizing Quality of Information for the Internet of Things: A Real-Time Scheduling Perspective (Invited Paper).
Proceedings of the 22nd IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2016

Testing Higher-Order Network Structures in an Online Experiment.
Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing, 2016

2015
Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges.
Algorithmica, 2015

Data Acquisition for Real-Time Decision-Making under Freshness Constraints.
Proceedings of the 2015 IEEE Real-Time Systems Symposium, 2015

Measuring the strength of networks of teams: Metrics and properties.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

Improved Approximation Algorithms for Weighted 2-Path Partitions.
Proceedings of the Algorithms - ESA 2015, 2015

The Price of Incorrectly Aggregating Coverage Values in Sensor Selection.
Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems, 2015

"Green" Barrier Coverage with Mobile Sensors.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Star Search: Effective Subgroups in Collaborative Social Networks.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Peer-Assisted Timely Report Delivery in Social Swarming Applications.
IEEE Trans. Wireless Communications, 2014

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities.
Theor. Comput. Sci., 2014

Should I stay or should I go? Maximizing lifetime with relays.
Computer Networks, 2014

Maximizing the Relevant Diversity of Social Swarming Information.
Proceedings of the SENSORNETS 2014 - Proceedings of the 3rd International Conference on Sensor Networks, Lisbon, Portugal, 7, 2014

To Sample or To Smash? Estimating reachability in large time-varying graphs.
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

Low Expected Latency Routing in Dynamic Networks.
Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

Data Extrapolation in Social Sensing for Disaster Response.
Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2014

2013
Paging mobile users in cellular networks: Optimality versus complexity and simplicity.
Theor. Comput. Sci., 2013

Brief announcement: set it and forget it - approximating the set once strip cover problem.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Extrapolation from participatory sensing data.
Proceedings of the 11th ACM Conference on Embedded Network Sensor Systems, 2013

As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Algorithms for channel assignment in mobile wireless networks using temporal coloring.
Proceedings of the 16th ACM International Conference on Modeling, 2013

Estimating end-to-end delays under changing conditions.
Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks, 2013

Demo abstract: mediascope: selective on-demand media retrieval from mobile devices.
Proceedings of the 12th International Conference on Information Processing in Sensor Networks (co-located with CPS Week 2013), 2013

MediaScope: selective on-demand media retrieval from mobile devices.
Proceedings of the 12th International Conference on Information Processing in Sensor Networks (co-located with CPS Week 2013), 2013

Maximizing Barrier Coverage Lifetime with Mobile Sensors.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Proactive data dissemination to mission sites.
Wireless Networks, 2012

Optimizing Information Credibility in Social Swarming Applications.
IEEE Trans. Parallel Distrib. Syst., 2012

Ordered coloring of grids and related graphs.
Theor. Comput. Sci., 2012

Windows scheduling of arbitrary-length jobs on multiple machines.
J. Scheduling, 2012

Dynamic shortest path algorithms for hypergraphs.
Proceedings of the 10th International Symposium on Modeling and Optimization in Mobile, 2012

Funding Games: The Truth but Not the Whole Truth.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Changing of the Guards: Strip Cover with Duty Cycling.
Proceedings of the Structural Information and Communication Complexity, 2012

Convergecast with aggregatable data classes.
Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, 2012

A Competitive Rate Allocation Game.
Proceedings of the Game Theory for Networks, 2012

Should I Stay or Should I Go? Maximizing Lifetime with Relays.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

Timely Report Delivery in Social Swarming Applications.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

Throughput Maximization in Mobile WSN Scheduling with Power Control and Rate Selection.
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

2011
Broadcasting info-pages to sensors: efficiency versus energy conservation.
Wireless Networks, 2011

Energy peak shaving with local storage.
SUSCOM, 2011

Quality-of-information aware networking for tactical military networks.
Proceedings of the Ninth Annual IEEE International Conference on Pervasive Computing and Communications, 2011

Modeling and analysis of composite network embeddings.
Proceedings of the 14th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2011

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes.
Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

Optimizing information credibility in social swarming applications.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Pan and scan: Configuring cameras for coverage.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Demo: A distributed architecture for heterogeneous multi sensor-task allocation.
Proceedings of the Distributed Computing in Sensor Systems, 2011

A distributed architecture for heterogeneous multi sensor-task allocation.
Proceedings of the Distributed Computing in Sensor Systems, 2011

On sensor selection in linked information networks.
Proceedings of the Distributed Computing in Sensor Systems, 2011

Minimum-Cost Broadcast through Varying-Size Neighborcast.
Proceedings of the Algorithms for Sensor Systems, 2011

Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges.
Proceedings of the Algorithms for Sensor Systems, 2011

2010
Sensor-Mission Assignment in Constrained Environments.
IEEE Trans. Parallel Distrib. Syst., 2010

Sensor-mission assignment in wireless sensor networks.
TOSN, 2010

Online Conflict-Free Colouring for Hypergraphs.
Combinatorics, Probability & Computing, 2010

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: pan and scan.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Finding mobile data under delay constraints with searching costs.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

You can't get there from here: Sensor scheduling with refocusing delays.
Proceedings of the IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, 2010

Sensor Allocation in Diverse Environments.
Proceedings of the Distributed Computing in Sensor Systems, 2010

2009
Ordered Coloring Grids and Related Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

Proactive Data Dissemination to Mission Sites.
Proceedings of the Sixth Annual IEEE Communications Society Conference on Sensor, 2009

Who, When, Where: Timeslot Assignment to Mobile Clients.
Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009

Application of Halftoning Algorithms to Location Dependent Sensor Placement.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

Online Maximum Directed Cut.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

More is More: The Benefits of Denser Sensor Deployment.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Detection and Localization Sensor Assignment with Exact and Fuzzy Locations.
Proceedings of the Distributed Computing in Sensor Systems, 2009

Cheap or Flexible Sensor Coverage.
Proceedings of the Distributed Computing in Sensor Systems, 2009

2008
Deterministic conflict-free coloring for intervals: From offline to online.
ACM Trans. Algorithms, 2008

A general buffer scheme for the windows scheduling problem.
ACM Journal of Experimental Algorithmics, 2008

When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Peak Shaving through Resource Buffering.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Broadcasting Info-Pages to Sensors: Efficiency vs. Energy Conservation.
Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

More is more: The benefits of dense sensor deployment.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

Assigning Sensors to Competing Missions.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

An Ontology-Centric Approach to Sensor-Mission Assignment.
Proceedings of the Knowledge Engineering: Practice and Patterns, 2008

Frugal Sensor Assignment.
Proceedings of the Distributed Computing in Sensor Systems, 2008

2007
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Paging Mobile Users Efficiently and Optimally.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Online Conflict-Free Colorings for Hypergraphs.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Finding Mobile Data: Efficiency vs. Location Inaccuracy.
Proceedings of the Algorithms, 2007

Construction of Initial Neighborhoods for a Course Scheduling Problem Using Tiling.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Assigning Sensors to Missions with Demands.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006
Efficient multicast search under delay and bandwidth constraints.
Wireless Networks, 2006

Online Dynamic Programming Speedups.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Conflict-free coloring for intervals: from offline to online.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.
Proceedings of the Structural Information and Communication Complexity, 2006

2005
Guest Editorial.
MONET, 2005

A General Buffer Scheme for the Windows Scheduling Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Windows scheduling of arbitrary length jobs on parallel machines.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Cellular Networks: Where Are the Mobile Users?
Proceedings of the Structural Information and Communication Complexity, 2005

Stream merging for live continuous broadcast with time-shifting.
Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

2004
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand.
SIAM J. Comput., 2004

Comparison of stream merging algorithms for media-on-demand.
Multimedia Syst., 2004

Efficient algorithms for periodic scheduling.
Computer Networks, 2004

Windows scheduling as a restricted version of Bin Packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Competitive on-line paging strategies for mobile users under delay constraints.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Establishing a Mobile Conference Call Under Delay and Bandwidth Constraints.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
Sharing Video on Demand.
Discrete Applied Mathematics, 2003

Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Scheduling techniques for media-on-demand.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Windows scheduling as a paradigm for pushing information in wireless networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002
Minimizing Service and Operation Costs of Periodic Scheduling.
Math. Oper. Res., 2002

Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations.
J. High Speed Networks, 2002

Windows scheduling problems for broadcast systems.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Throughput maximization of real-time scheduling with batching.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Competitive on-line switching policies.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Establishing wireless conference calls under delay constraints.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Efficient periodic scheduling by trees.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Introduction: Discrete Algorithms and Methods for Mobility.
Wireless Networks, 2001

Approximating the Throughput of Multiple Machines in Real-Time Scheduling.
SIAM J. Comput., 2001

On-Line Load Balancing in a Hierarchical Server Topology.
SIAM J. Comput., 2001

Competitive on-line stream merging algorithms for media-on-demand.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Nearly optimal perfectly-periodic schedules.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Message Multicasting in Heterogeneous Networks.
SIAM J. Comput., 2000

Sum Multicoloring of Graphs.
J. Algorithms, 2000

A unified approach to approximating resource allocation and scheduling.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Pushing dependent data in clients-providers-servers systems.
Proceedings of the MOBICOM 2000, 2000

Broadcast Disks with Polynomial Cost Functions.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
A Matched Approximation Bound for the Sum of a Greedy Coloring.
Inf. Process. Lett., 1999

Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Optimal Broadcasting of Two Files over an Asymmetric Channel.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Sum Multi-coloring of Graphs.
Proceedings of the Algorithms, 1999

On-Line Load Banancing in a Hierarchical Server Topology.
Proceedings of the Algorithms, 1999

1998
Minimum Color Sum of Bipartite Graphs.
J. Algorithms, 1998

On Chromatic Sums and Distributed Resource Allocation.
Inf. Comput., 1998

Multicasting in Heterogeneous Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Competitive Dynamic Bandwidth Allocation.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
The Minimum Color Sum of Bipartite Graphs.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Topology-Based Tracking Strategies for Personal Communication Networks.
MONET, 1996

Efficient Routing in Optical Networks.
J. ACM, 1996

On Chromatic Sums and Distributed Resource Allocation.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Broadcasting Multiple Messages in the Multiport Model.
Proceedings of IPPS '96, 1996

1995
Optimal Amortized Distributed Consensus
Inf. Comput., July, 1995

Mobile users: to update or not to update?
Wireless Networks, 1995

Computing Global Combine Operations in the Multiport Postal Model.
IEEE Trans. Parallel Distrib. Syst., 1995

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.
J. Algorithms, 1995

optimal Computation of Census Functions in the Postal Model.
Discrete Applied Mathematics, 1995

Bandwidth allocation with preemption.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Guaranteeing Fair Service to Persistent Dependent Tasks.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
A New Competitive Algorithm for Group Testing.
Discrete Applied Mathematics, 1994

Optimal multiple message broadcasting in telephone-like communication systems.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Mobile Users: To Uptdate or not to Update?
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1993
Tracking mobile users in wireless communications networks.
IEEE Trans. Information Theory, 1993

An Optimal Algorithm for computing Census Functions in Message-Passing Systems.
Parallel Processing Letters, 1993

A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment.
Mathematical Systems Theory, 1993

Broadcasting Multiple Messages in Simultaneous Send/Receive Systems.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Computing Global Combine Operations in the Multi-Port Postal Model.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

Multiple Message Broadcasting in the Postal Model.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

Tracking Mobile Users in Wireless Communication Networks.
Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
Inf. Comput., April, 1992

A Linear Time Approach to the Set Maxima Problem.
SIAM J. Discrete Math., 1992

Single Round Simulation on Radio Networks.
J. Algorithms, 1992

The Greedy Algorithm is Optimal for On-Line Edge Coloring.
Inf. Process. Lett., 1992

Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

A New Competitive Algorithm for Group Testing.
Proceedings of the Proceedings IEEE INFOCOM '92, 1992

Efficient Minimum Cost Matching Using Quadrangle Inequality
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Fault-Tolerant Critical Section Management in Asynchronous Environments
Inf. Comput., November, 1991

A Lower Bound for Radio Broadcast.
J. Comput. Syst. Sci., 1991

Consensus Algorithms with One-Bit Messages.
Distributed Computing, 1991

Optimal Amortized Distributed Consensus (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

The Canadian Traveller Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Approximate Distributed Bellman-Ford Algorithms.
Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1990
Renaming in an Asynchronous Environment
J. ACM, July, 1990

Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments.
SIAM J. Discrete Math., 1990

Improved Routing Strategies with Succinct Tables.
J. Algorithms, 1990

Topology Distribution Cost vs. Efficient Routing in Large Networks.
Proceedings of the SIGCOMM '90, 1990

Sharing Memory Robustly in Message-Passing Systems.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
Bounds on Universal Sequences.
SIAM J. Comput., 1989

Choice Coordination with Limited Failure.
Distributed Computing, 1989

Fault-Tolerant Critical Section Management in Asynchronous Networks.
Proceedings of the Distributed Algorithms, 1989

Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On the Complexity of Radio Communication (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Square Meshes Are Not Always Optimal.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988
One Bit Algorithms.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Robust multi-agent decision making in faulty environment.
Proceedings of the 9th International Conference on Pattern Recognition, 1988

Families of Consensus Algorithms.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
Choice Coordination with Bounded Failure (a Preliminary Version).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985


  Loading...