Amotz Bar-Noy

Toni Böhnlein

David Peleg

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Vertex-weighted realizations of graphs.

[BibT_eX]

[DOI]

David Peleg

Theor. Comput. Sci., 2020

Efficiently Realizing Interval Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Minimum Neighboring Degree Realization in Graphs and Trees.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Finding High-Degree Vertices with Inclusive Random Sampling.

[BibT_eX]

[DOI]

Yitzchak Novick

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Decision-driven scheduling.

[BibT_eX]

[DOI]

Real Time Syst., 2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods.

[BibT_eX]

[DOI]

CoRR, 2019

A study on the friendship paradox - quantitative analysis and relationship with assortative mixing.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2019

Graph Profile Realizations and Applications to Social Networks.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Maximum Gaps in Path Coverage.

[BibT_eX]

[DOI]

Tarek F. Abdelzaher

Proceedings of the 22nd International ACM Conference on Modeling, 2019

Dynamic sensor selection for path coverage.

[BibT_eX]

[DOI]

Tarek F. Abdelzaher

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018

Athena: Towards Decision-Centric Anticipatory Sensor Information Delivery.

[BibT_eX]

[DOI]

J. Sens. Actuator Networks, 2018

Improved approximation algorithms for weighted 2-path partitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Realizability of Graph Specifications: Characterizations and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Local Algorithms for Sensor Selection.

[BibT_eX]

[DOI]

Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, 2018

Poster: Local Algorithms for Sensor Selection.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Embedded Wireless Systems and Networks, 2018

Leveraging Knowledge for Path Exposure.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Distributed Computing in Sensor Systems, 2018

Quantifying the Strength of the Friendship Paradox.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications VII, 2018

2017

Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2017

Maximizing Barrier Coverage Lifetime with Mobile Sensors.

[BibT_eX]

[DOI]

Peter Terlecky

SIAM J. Discret. Math., 2017

An efficient alternative to Ollivier-Ricci curvature based on the Jaccard metric.

[BibT_eX]

[DOI]

CoRR, 2017

On sensor selection in linked information networks.

[BibT_eX]

[DOI]

Charu C. Aggarwal

Comput. Networks, 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

Gathering Information in Sensor Networks for Synchronized Freshness.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE International Conference on Sensing, 2017

Controlled growth of simplicial complex networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications Workshops, 2017

Decision-Driven Execution: A Distributed Resource Management Paradigm for the Age of IoT.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Sensor Selection for Heterogeneous Coverage Measures.

[BibT_eX]

[DOI]

Tarek F. Abdelzaher

Proceedings of the 13th International Conference on Distributed Computing in Sensor Systems, 2017

2016

Efficient Mechanism Design for Competitive Carrier Selection and Rate Allocation.

[BibT_eX]

[DOI]

Yanting Wu

IEEE Trans. Veh. Technol., 2016

Changing of the guards: Strip cover with duty cycling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Tight Approximation Bounds for the Seminar Assignment Problem.

[BibT_eX]

[DOI]

Nooreddin Naghibolhosseini

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Sporadic Decision-Centric Data Scheduling with Normally-off Sensors.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing, 2016

2015

You can't get there from here: sensor scheduling with refocusing delays.

[BibT_eX]

[DOI]

Wirel. Networks, 2015

Dynamic Shortest Path Algorithms for Hypergraphs.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Joint Source Selection and Data Extrapolation in Social Sensing for Disaster Response.

[BibT_eX]

[DOI]

Mohammad Hosseini

CoRR, 2015

Counting the Number of Langford Skolem Pairings.

[BibT_eX]

[DOI]

Ali Assarpour

Amotz Barnoy

Ou Liu

CoRR, 2015

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

[BibT_eX]

[DOI]

Nooreddin Naghibolhosseini

Algorithmica, 2015

Data Acquisition for Real-Time Decision-Making under Freshness Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Real-Time Systems Symposium, 2015

Measuring the strength of networks of teams: Metrics and properties.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

The Price of Incorrectly Aggregating Coverage Values in Sensor Selection.

[BibT_eX]

[DOI]

Nooreddin Naghibolhosseini

Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems, 2015

"Green" Barrier Coverage with Mobile Sensors.

[BibT_eX]

[DOI]

Peter Terlecky

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Star Search: Effective Subgroups in Collaborative Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

Throughput Maximization in Mobile WSN Scheduling With Power Control and Rate Selection.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2014

Peer-Assisted Timely Report Delivery in Social Swarming Applications.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2014

Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities.

[BibT_eX]

[DOI]

Thomas Erlebach

Sotiris E. Nikoletseas

Pekka Orponen

Theor. Comput. Sci., 2014

Should I stay or should I go? Maximizing lifetime with relays.

[BibT_eX]

[DOI]

Comput. Networks, 2014

Maximizing the Relevant Diversity of Social Swarming Information.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

Low Expected Latency Routing in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

Data Extrapolation in Social Sensing for Disaster Response.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Distributed Computing in Sensor Systems, 2014

2013

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes.

[BibT_eX]

[DOI]

Wirel. Networks, 2013

Paging mobile users in cellular networks: Optimality versus complexity and simplicity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Computing Traversal Times on Dynamic Markovian Paths

[BibT_eX]

[DOI]

CoRR, 2013

Brief announcement: set it and forget it - approximating the set once strip cover problem.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Extrapolation from participatory sensing data.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM Conference on Embedded Network Sensor Systems, 2013

As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Algorithms for channel assignment in mobile wireless networks using temporal coloring.

[BibT_eX]

[DOI]

Proceedings of the 16th ACM International Conference on Modeling, 2013

Estimating end-to-end delays under changing conditions.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks, 2013

Demo abstract: mediascope: selective on-demand media retrieval from mobile devices.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Information Processing in Sensor Networks (co-located with CPS Week 2013), 2013

2012

Proactive data dissemination to mission sites.

[BibT_eX]

[DOI]

Wirel. Networks, 2012

Sensor allocation in diverse environments.

[BibT_eX]

[DOI]

Theodore Brown

Wirel. Networks, 2012

Optimizing Information Credibility in Social Swarming Applications.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2012

More is more: The benefits of denser sensor deployment.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2012

Who, When, Where: Timeslot Assignment to Mobile Clients.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2012

Ordered coloring of grids and related graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Windows scheduling of arbitrary-length jobs on multiple machines.

[BibT_eX]

[DOI]

J. Sched., 2012

Online maximum directed cut.

[BibT_eX]

[DOI]

Michael Lampis

J. Comb. Optim., 2012

Funding Games: The Truth but Not the Whole Truth.

[BibT_eX]

[DOI]

Yi Gai

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Convergecast with aggregatable data classes.

[BibT_eX]

[DOI]

Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, 2012

A Competitive Rate Allocation Game.

[BibT_eX]

[DOI]

Yanting Wu

Proceedings of the Game Theory for Networks, 2012

Timely Report Delivery in Social Swarming Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

2011

Broadcasting info-pages to sensors: efficiency versus energy conservation.

[BibT_eX]

[DOI]

Yosef Alayev

Thomas F. La Porta

Wirel. Networks, 2011

Energy peak shaving with local storage.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2011

Knapsack Games and the Truth but not the Whole Truth

[BibT_eX]

[DOI]

Yi Gai

CoRR, 2011

Quality-of-information aware networking for tactical military networks.

[BibT_eX]

[DOI]

Srikanth V. Krishnamurthy

Greg Cirincione

Ramesh Govindan

Proceedings of the Ninth Annual IEEE International Conference on Pervasive Computing and Communications, 2011

Modeling and analysis of composite network embeddings.

[BibT_eX]

[DOI]

Prithwish Basu

Proceedings of the 14th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2011

Optimizing information credibility in social swarming applications.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Pan and scan: Configuring cameras for coverage.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Demo: A distributed architecture for heterogeneous multi sensor-task allocation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2011

A distributed architecture for heterogeneous multi sensor-task allocation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2011

Minimum-Cost Broadcast through Varying-Size Neighborcast.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2011

Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2011

2010

Sensor-Mission Assignment in Constrained Environments.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2010

Sensor-mission assignment in wireless sensor networks.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2010

Online Conflict-Free Colouring for Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Modeling and Analysis of Time-Varying Graphs

[BibT_eX]

[DOI]

CoRR, 2010

Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Yi Feng

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage.

[BibT_eX]

[DOI]

Mani B. Srivastava

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: pan and scan.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Finding mobile data under delay constraints with searching costs.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Throughput maximization of real-time scheduling with batching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Online Dynamic Programming Speedups.

[BibT_eX]

[DOI]

Mordecai J. Golin

Yan Zhang

Theory Comput. Syst., 2009

Proactive Data Dissemination to Mission Sites.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual IEEE Communications Society Conference on Sensor, 2009

Application of Halftoning Algorithms to Location Dependent Sensor Placement.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

Detection and Localization Sensor Assignment with Exact and Fuzzy Locations.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2009

Cheap or Flexible Sensor Coverage.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2009

2008

Optimal delay for media-on-demand with pre-loading and pre-buffering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Deterministic conflict-free coloring for intervals: From offline to online.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Shakhar Smorodinsky

ACM Trans. Algorithms, 2008

A general buffer scheme for the windows scheduling problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Scheduling Techniques for Media-on-Demand.

[BibT_eX]

[DOI]

Algorithmica, 2008

When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Peak Shaving through Resource Buffering.

[BibT_eX]

[DOI]

Ou Liu

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Broadcasting Info-Pages to Sensors: Efficiency vs. Energy Conservation.

[BibT_eX]

[DOI]

Yosef Alayev

Wamberto Weber Vasconcelos

Thomas F. La Porta

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

More is more: The benefits of dense sensor deployment.

[BibT_eX]

[DOI]

Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

Assigning Sensors to Competing Missions.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

An Ontology-Centric Approach to Sensor-Mission Assignment.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Engineering: Practice and Patterns, 2008

Frugal Sensor Assignment.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2008

Utility-based joint sensor selection and congestion control for task-oriented WSNs.

[BibT_eX]

[DOI]

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007

Windows scheduling as a restricted version of bin packing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Weakening the online adversary just enough to get optimal conflict-free colorings for intervals.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yi Feng

Mordecai J. Golin

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Online Conflict-Free Colorings for Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Finding Mobile Data: Efficiency vs. Location Inaccuracy.

[BibT_eX]

[DOI]

Joanna Klukowska

Proceedings of the Algorithms, 2007

Construction of Initial Neighborhoods for a Course Scheduling Problem Using Tiling.

[BibT_eX]

[DOI]

Douglas L. Moody

Graham Kendall

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Assigning Sensors to Missions with Demands.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006

Efficient multicast search under delay and bandwidth constraints.

[BibT_eX]

[DOI]

Zohar Naor

Wirel. Networks, 2006

Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging.

[BibT_eX]

[DOI]

Justin Goshi

J. Discrete Algorithms, 2006

Conflict-free coloring for intervals: from offline to online.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Shakhar Smorodinsky

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

2005

Guest Editorial.

[BibT_eX]

[DOI]

Alan A. Bertossi

Maria Cristina Pinotti

Cauligi S. Raghavendra

Mob. Networks Appl., 2005

Windows scheduling of arbitrary length jobs on parallel machines.

[BibT_eX]

[DOI]

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?

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2005

Stream merging for live continuous broadcast with time-shifting.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Broadband Networks (BROADNETS 2005), 2005

2004

Broadcast Disks with Polynomial Cost Functions.

[BibT_eX]

[DOI]

Igor Ziper

Wirel. Networks, 2004

Efficient Algorithms for Optimal Stream Merging for Media-on-Demand.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Comparison of stream merging algorithms for media-on-demand.

[BibT_eX]

[DOI]

Multim. Syst., 2004

Establishing wireless conference calls under delay constraints.

[BibT_eX]

[DOI]

Grzegorz Malewicz

J. Algorithms, 2004

Efficient algorithms for periodic scheduling.

[BibT_eX]

[DOI]

Vladimir Dreizin

Comput. Networks, 2004

Competitive on-line paging strategies for mobile users under delay constraints.

[BibT_eX]

[DOI]

Yishay Mansour

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Establishing a Mobile Conference Call Under Delay and Bandwidth Constraints.

[BibT_eX]

[DOI]

Zohar Naor

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003

Pushing Dependent Data in Clients-Providers-Servers Systems.

[BibT_eX]

[DOI]

Wirel. Networks, 2003

Windows Scheduling Problems for Broadcast Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Competitive on-line stream merging algorithms for media-on-demand.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Sharing Video on Demand.

[BibT_eX]

[DOI]

Juan A. Garay

Amir Herzberg

Discret. Appl. Math., 2003

Competitive On-Line Switching Policies.

[BibT_eX]

[DOI]

Algorithmica, 2003

Windows scheduling as a paradigm for pushing information in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002

Minimizing Service and Operation Costs of Periodic Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

Next generation Tbit/sec routers and switches: traffic modeling, scheduling algorithms, and simulations.

[BibT_eX]

[DOI]

J. High Speed Networks, 2002

Nearly optimal perfectly periodic schedules.

[BibT_eX]

[DOI]

Aviv Nisgav

Distributed Comput., 2002

Efficient periodic scheduling by trees.

[BibT_eX]

[DOI]

Vladimir Dreizin

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001

Introduction: Discrete Algorithms and Methods for Mobility.

[BibT_eX]

[DOI]

Danny Krizanc

Arunabha Sen

Wirel. Networks, 2001

Approximating the Throughput of Multiple Machines in Real-Time Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

On-Line Load Balancing in a Hierarchical Server Topology.

[BibT_eX]

[DOI]

Ari Freund

SIAM J. Comput., 2001

A unified approach to approximating resource allocation and scheduling.

[BibT_eX]

[DOI]

J. ACM, 2001

2000

Message Multicasting in Heterogeneous Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Optimal Broadcasting of Two Files over an Asymmetric Channel.

[BibT_eX]

[DOI]

Yaron Shilo

J. Parallel Distributed Comput., 2000

Sum Multicoloring of Graphs.

[BibT_eX]

[DOI]

Ravit Salman

J. Algorithms, 2000

Optimal multiple message broadcasting in telephone-like communication systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Broadcasting Multiple Messages in the Multiport Model.

[BibT_eX]

[DOI]

Ching-Tien Ho

IEEE Trans. Parallel Distributed Syst., 1999

Bandwidth Allocation with Preemption.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

A Matched Approximation Bound for the Sum of a Greedy Coloring.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Sum Multi-coloring of Graphs.

[BibT_eX]

[DOI]

Ravit Salman

Proceedings of the Algorithms, 1999

On-Line Load Banancing in a Hierarchical Server Topology.

[BibT_eX]

[DOI]

Ari Freund

Proceedings of the Algorithms, 1999

1998

Guaranteeing Fair Service to Persistent Dependent Tasks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Minimum Color Sum of Bipartite Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1998

On Chromatic Sums and Distributed Resource Allocation.

[BibT_eX]

[DOI]

Mihir Bellare

Inf. Comput., 1998

Multicasting in Heterogeneous Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Competitive Dynamic Bandwidth Allocation.

[BibT_eX]

[DOI]

Yishay Mansour

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Multiple message broadcasting in the postal model.

[BibT_eX]

[DOI]

Networks, 1997

1996

Topology-Based Tracking Strategies for Personal Communication Networks.

[BibT_eX]

[DOI]

Mahmoud Naghshineh

Mob. Networks Appl., 1996

Efficient Routing in Optical Networks.

[BibT_eX]

[DOI]

J. ACM, 1996

On Chromatic Sums and Distributed Resource Allocation.

[BibT_eX]

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Optimal Amortized Distributed Consensus

[BibT_eX]

[DOI]

Inf. Comput., July, 1995

Mobile users: to update or not to update?

[BibT_eX]

[DOI]

Moshe Sidi

Wirel. Networks, 1995

Computing Global Combine Operations in the Multiport Postal Model.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1995

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Sharing Memory Robustly in Message-Passing Systems.

[BibT_eX]

[DOI]

Hagit Attiya

J. ACM, 1995

optimal Computation of Census Functions in the Postal Model.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Approximate distributed Bellman-Ford algorithms.

[BibT_eX]

[DOI]

Baruch Awerbuch

Madan Gopal

IEEE Trans. Commun., 1994

Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1994

Broadcasting Multiple Messages in Simultaneous Send/receive Systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A New Competitive Algorithm for Group Testing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Mobile Users: To Uptdate or not to Update?

[BibT_eX]

[DOI]

Moshe Sidi

Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1993

Tracking mobile users in wireless communications networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

An Optimal Algorithm for computing Census Functions in Message-Passing Systems.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1993

A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

Computing Global Combine Operations in the Multi-Port Postal Model.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

Tracking Mobile Users in Wireless Communication Networks.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Inf. Comput., April, 1992

A Linear Time Approach to the Set Maxima Problem.

[BibT_eX]

[DOI]

Rajeev Motwani

SIAM J. Discret. Math., 1992

Single Round Simulation on Radio Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1992

The Greedy Algorithm is Optimal for On-Line Edge Coloring.

[BibT_eX]

[DOI]

Rajeev Motwani

Inf. Process. Lett., 1992

Efficient Minimum Cost Matching Using Quadrangle Inequality

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Fault-Tolerant Critical Section Management in Asynchronous Environments

[BibT_eX]

[DOI]

Inf. Comput., November, 1991

Square Meshes are not always Optimal.

[BibT_eX]

[DOI]

David Peleg

IEEE Trans. Computers, 1991

A Lower Bound for Radio Broadcast.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

Consensus Algorithms with One-Bit Messages.

[BibT_eX]

[DOI]

Distributed Comput., 1991

Optimal Amortized Distributed Consensus (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

The Canadian Traveller Problem.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Renaming in an Asynchronous Environment

[BibT_eX]

[DOI]

J. ACM, July, 1990

Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Improved Routing Strategies with Succinct Tables.

[BibT_eX]

[DOI]

J. Algorithms, 1990

One-Bit Algorithms.

[BibT_eX]

[DOI]

Moni Naor

Distributed Comput., 1990

Topology Distribution Cost vs. Efficient Routing in Large Networks.

[BibT_eX]

[DOI]

Madan Gopal

Proceedings of the ACM Symposium on Communications Architectures & Protocols, 1990

1989

Bounds on Universal Sequences.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Choice Coordination with Limited Failure.

[BibT_eX]

[DOI]

Michael Ben-Or

Distributed Comput., 1989

Fault-Tolerant Critical Section Management in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1989

Compact Distributed Data Structures for Adaptive Routing (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On the Complexity of Radio Communication (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

1988

Robust multi-agent decision making in faulty environment.

[BibT_eX]

[DOI]

Dragutin Petkovic

Proceedings of the 9th International Conference on Pattern Recognition, 1988

Families of Consensus Algorithms.

[BibT_eX]

[DOI]

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

1987

אלגוריתמים במערכת מבוזרת לא אמינה (Algorithms in an unreliable distributed system.).

[BibT_eX]

[DOI]

PhD thesis, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985

Choice Coordination with Bounded Failure (a Preliminary Version).

[BibT_eX]

[DOI]

Michael Ben-Or