Michael Schapira

According to our database1, Michael Schapira authored at least 88 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
A Deep Reinforcement Learning Perspective on Internet Congestion Control.
Proceedings of the 36th International Conference on Machine Learning, 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 and Economic Behavior, 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

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

Preventing (Network) Time Travel with Chronos.
Proceedings of the Applied Networking Research Workshop, 2018

2017
On the Resiliency of Static Forwarding Tables.
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.
PoPETs, 2017

Privacy-Preserving Interdomain Routing at Internet Scale.
IACR Cryptology ePrint Archive, 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

Are We There Yet? On RPKI's Deployment and Security.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 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
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

Explicit Expanding Expanders.
Proceedings of the Algorithms - ESA 2015, 2015

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

How secure are secure interdomain routing protocols?
Computer Networks, 2014

A survey of interdomain routing policies.
Computer Communication Review, 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

Traffic engineering with Equal-Cost-Multipath: An algorithmic perspective.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
The communication burden of payment determination.
Games and Economic Behavior, 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
Rehoming edge links for better traffic engineering.
Computer Communication Review, 2012

Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data.
Computer Communication Review, 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 Exchanges, 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

Weakly-Acyclic (Internet) Routing Games.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

On Communication Protocols That Compute Almost Privately.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 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
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

How secure are secure interdomain routing protocols.
Proceedings of the ACM SIGCOMM 2010 Conference on Applications, 2010

On the Structure of Weakly Acyclic Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 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
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 Exchanges, 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

Interdomain routing and games.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 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

Bayesian Combinatorial Auctions.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 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
Truthful randomized mechanisms for combinatorial auctions.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

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

Incentive-compatible interdomain routing.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005
Approximation algorithms for combinatorial auctions with complement-free bidders.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005


  Loading...