Michael Schapira

Affiliations:
  • The Hebrew University of Jerusalem, Israel


According to our database1, Michael Schapira authored at least 118 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Verification-Aided Deep Ensemble Selection.
CoRR, 2022

Network congestion control and its impact on video streaming QoE.
Proceedings of the MHV '22: Mile-High Video Conference, Denver, Colorado, USA, March 1, 2022

2021
Towards Scalable Verification of RL-Driven Systems.
CoRR, 2021

Revitalizing the public internet by making it extensible.
Comput. Commun. Rev., 2021

Verifying learning-augmented systems.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

A Devil of a Time: How Vulnerable is NTP to Malicious Timeservers?
Proceedings of the 28th Annual Network and Distributed System Security Symposium, 2021

Towards Scalable Verification of Deep Reinforcement Learning.
Proceedings of the Formal Methods in Computer Aided Design, 2021

Toward greater scavenger congestion control deployment: implementations and interfaces.
Proceedings of the ANRW '21: Applied Networking Research Workshop, 2021

2020
Approximate Moore Graphs are good expanders.
J. Comb. Theory, Ser. B, 2020

Online Safety Assurance for Deep Reinforcement Learning.
CoRR, 2020

PCC Proteus: Scavenger Transport And Beyond.
Proceedings of the SIGCOMM '20: Proceedings of the 2020 Annual conference of the ACM Special Interest Group on Data Communication on the applications, 2020

A Public Option for the Core.
Proceedings of the SIGCOMM '20: Proceedings of the 2020 Annual conference of the ACM Special Interest Group on Data Communication on the applications, 2020

DISCO: Sidestepping RPKI's Deployment Barriers.
Proceedings of the 27th Annual Network and Distributed System Security Symposium, 2020

Online Safety Assurance for Learning-Augmented Systems.
Proceedings of the HotNets '20: The 19th ACM Workshop on Hot Topics in Networks, 2020

On the Future of Congestion Control for the Public Internet.
Proceedings of the HotNets '20: The 19th ACM Workshop on Hot Topics in Networks, 2020

MPCC: online learning multipath transport.
Proceedings of the CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, 2020

2019
Axiomatizing Congestion Control.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Verifying Deep-RL-Driven Systems.
Proceedings of the 2019 Workshop on Network Meets AI & ML, 2019

TEAVAR: striking the right utilization-availability balance in WAN traffic engineering.
Proceedings of the ACM Special Interest Group on Data Communication, 2019

A Deep Reinforcement Learning Perspective on Internet Congestion Control.
Proceedings of the 36th International Conference on Machine Learning, 2019

Robustifying Network Protocols with Adversarial Examples.
Proceedings of the 18th ACM Workshop on Hot Topics in Networks, 2019

Beating BGP is Harder than we Thought.
Proceedings of the 18th ACM Workshop on Hot Topics in Networks, 2019

2018
Oblivious Routing in IP Networks.
IEEE/ACM Trans. Netw., 2018

Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik-Chervonenkis Dimension.
SIAM J. Comput., 2018

Setting lower bounds on truthfulness.
Games Econ. Behav., 2018

Pied Piper: Rethinking Internet Data Delivery.
CoRR, 2018

Internet Congestion Control via Deep Reinforcement Learning.
CoRR, 2018

PCC Vivace: Online-Learning Congestion Control.
Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation, 2018

Preventing (Network) Time Travel with Chronos.
Proceedings of the 25th Annual Network and Distributed System Security Symposium, 2018

Congestion Control for Future Mobile Networks.
Proceedings of the 13th Workshop on Challenged Networks, 2018

Nash-peering: A new techno-economic framework for internet interconnections.
Proceedings of the IEEE INFOCOM 2018, 2018

Network-Model-Based vs. Network-Model-Free Approaches to Internet Congestion Control.
Proceedings of the IEEE 19th International Conference on High Performance Switching and Routing, 2018

Perfect is the Enemy of Good: Setting Realistic Goals for BGP Security.
Proceedings of the 17th ACM Workshop on Hot Topics in Networks, 2018

Large Low-Diameter Graphs are Good Expanders.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
On the Resiliency of Static Forwarding Tables.
IEEE/ACM Trans. Netw., 2017

Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective.
IEEE/ACM Trans. Netw., 2017

Dynamics at the Boundary of Game Theory and Distributed Computing.
ACM Trans. Economics and Comput., 2017

Privacy-Preserving Interdomain Routing at Internet Scale.
Proc. Priv. Enhancing Technol., 2017

Oblivious Routing via Random Walks.
CoRR, 2017

A Machine Learning Approach to Routing.
CoRR, 2017

Explicit Expanding Expanders.
Algorithmica, 2017

Beyond fat-trees without antennae, mirrors, and disco-balls.
Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Stateless Computation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

An Axiomatic Approach to Congestion Control.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

Learning to Route.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

Congestion-Control Throwdown.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

SIXPACK: Securing Internet eXchange Points Against Curious onlooKers.
Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies, 2017

2016
Bayesian Combinatorial Auctions.
J. ACM, 2016

Are We There Yet? On RPKI's Deployment and Security.
IACR Cryptol. ePrint Arch., 2016

Rethinking security for internet routing.
Commun. ACM, 2016

Jumpstarting BGP Security with Path-End Validation.
Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Measuring and Mitigating AS-level Adversaries Against Tor.
Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016

The quest for resilient (static) forwarding tables.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

On the Resiliency of Randomized Routing Against Multiple Edge Failures.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Xpander: Towards Optimal-Performance Datacenters.
Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016

Lying Your Way to Better Traffic Engineering.
Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016

Towards Securing Internet eXchange Points Against Curious onlooKers.
Proceedings of the 2016 Applied Networking Research Workshop, 2016

2015
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

New Directions for Network Verification.
Proceedings of the 1st Summit on Advances in Programming Languages, 2015

PCC: Re-architecting Congestion Control for Consistent High Performance.
Proceedings of the 12th USENIX Symposium on Networked Systems Design and Implementation, 2015

Capturing resource tradeoffs in fair multi-resource allocation.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Xpander: Unveiling the Secrets of High-Performance Datacenters.
Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, PA, USA, November 16, 2015

One Hop for RPKI, One Giant Leap for BGP Security.
Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, PA, USA, November 16, 2015

2014
Approximate Privacy: Foundations and Quantification.
ACM Trans. Algorithms, 2014

Weakly-Acyclic (Internet) Routing Games.
Theory Comput. Syst., 2014

Exploring the Limits of Static Failover Routing.
CoRR, 2014

How secure are secure interdomain routing protocols?
Comput. Networks, 2014

A survey of interdomain routing policies.
Comput. Commun. Rev., 2014

Rethinking congestion control architecture: performance-oriented congestion control.
Proceedings of the ACM SIGCOMM 2014 Conference, 2014

Self-stabilizing Uncoupled Dynamics.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

VeriCon: towards verifying controller programs in software-defined networks.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

2013
On the Structure of Weakly Acyclic Games.
Theory Comput. Syst., 2013

The communication burden of payment determination.
Games Econ. Behav., 2013

Pay or Play.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Best-response dynamics out of sync: complexity and characterization.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

BGP security in partial deployment: is the juice worth the squeeze?
Proceedings of the ACM SIGCOMM 2013 Conference, 2013

Ensuring Connectivity via Data Plane Mechanisms.
Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation, 2013

2012
On communication protocols that compute almost privately.
Theor. Comput. Sci., 2012

Truthful randomized mechanisms for combinatorial auctions.
J. Comput. Syst. Sci., 2012

On the Resilience of Routing Tables
CoRR, 2012

Network-Destabilizing Attacks
CoRR, 2012

Rehoming edge links for better traffic engineering.
Comput. Commun. Rev., 2012

Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data.
Comput. Commun. Rev., 2012

Network cooperation for client-ap association optimization.
Proceedings of the 10th International Symposium on Modeling and Optimization in Mobile, 2012

Brief announcement: network-destabilizing attacks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Brief announcement: on the resilience of routing tables.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

A new approach to interdomain routing based on secure multi-party computation.
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

2011
When is it best to best-respond?
SIGecom Exch., 2011

Interdomain Routing and Games.
SIAM J. Comput., 2011

Incentive-compatible interdomain routing.
Distributed Comput., 2011

(Approximately) Privacy-Preserving Dissection Protocols
CoRR, 2011

Best-response auctions.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Let the market drive deployment: a strategy for transitioning to BGP security.
Proceedings of the ACM SIGCOMM 2011 Conference on Applications, 2011

Incentive-compatible distributed greedy protocols.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Distributed computing with rules of thumb.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Best-Response Mechanisms.
Proceedings of the Innovations in Computer Science, 2011

Distributed Computing with Adaptive Heuristics.
Proceedings of the Innovations in Computer Science, 2011

Data-driven network connectivity.
Proceedings of the Tenth ACM Workshop on Hot Topics in Networks (HotNets-X), 2011

2010
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders.
Math. Oper. Res., 2010

Approximate Privacy: PARs for Set Problems
CoRR, 2010

Inapproximability for VCG-Based Combinatorial Auctions.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Incentive compatibility and dynamics of congestion control.
Proceedings of the SIGMETRICS 2010, 2010

Approximate privacy: foundations and quantification (extended abstract).
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Computation and incentives in combinatorial public projects.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Putting BGP on the right path: a case for next-hop routing.
Proceedings of the 9th ACM Workshop on Hot Topics in Networks. HotNets 2010, Monterey, CA, USA - October 20, 2010

2009
Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond
CoRR, 2009

VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
CoRR, 2009

Neighbor-specific BGP: more flexible routing policies while improving global stability.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Searching for Stability in Interdomain Routing.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Characterizing truthfulness in discrete domains.
SIGecom Exch., 2008

Inapproximability of Combinatorial Public Projects.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Asynchronous Best-Reply Dynamics.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Mechanism design over discrete domains.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Informational overhead of incentive compatibility.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

On the Hardness of Being Truthful.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Setting lower bounds on truthfulness: extended abstract.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
An improved approximation algorithm for combinatorial auctions with submodular bidders.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006


  Loading...