default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Schapira
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Guy Amir, Osher Maayan, Tom Zelazny, Guy Katz, Michael Schapira:
Verifying the Generalization of Deep Learning to Out-of-Distribution Domains. J. Autom. Reason. 68(3): 17 (2024)- [c95]Tal Mizrahi
, Michael Schapira, Yoram Moses:
The Observer Effect in Computer Networks. ANRW 2024 - [c94]Pooria Namyar, Michael Schapira, Ramesh Govindan, Santiago Segarra, Ryan Beckett, Siva Kesava Reddy Kakarla, Behnaz Arzani:
End-to-End Performance Analysis of Learning-enabled Systems. HotNets 2024: 86-94 - [c93]Lloyd Brown, Albert Gran Alcoz, Frank Cangialosi, Akshay Narayan, Mohammad Alizadeh, Hari Balakrishnan, Eric J. Friedman, Ethan Katz-Bassett, Arvind Krishnamurthy, Michael Schapira, Scott Shenker:
Principles for Internet Congestion Management. SIGCOMM 2024: 166-180 - [i36]Guy Amir, Osher Maayan, Tom Zelazny, Guy Katz, Michael Schapira:
Verifying the Generalization of Deep Learning to Out-of-Distribution Domains. CoRR abs/2406.02024 (2024) - [i35]Tal Mizrahi, Michael Schapira, Yoram Moses:
The Observer Effect in Computer Networks. CoRR abs/2406.09093 (2024) - [i34]Neta Rozen Schiff, Danny Dolev, Tal Mizrahi, Michael Schapira:
A Secure Selection and Filtering Mechanism for the Network Time Protocol with Khronos. RFC 9523: 1-13 (2024) - 2023
- [c92]Guy Amir, Osher Maayan, Tom Zelazny, Guy Katz, Michael Schapira:
Verifying Generalization in Deep Learning. CAV (2) 2023: 438-455 - [c91]Yarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula, Ishai Menache, Michael Schapira, Aviv Tamar:
DOTE: Rethinking (Predictive) WAN Traffic Engineering. NSDI 2023: 1557-1581 - [i33]Guy Amir, Osher Maayan, Tom Zelazny, Guy Katz, Michael Schapira:
Verifying Generalization in Deep Learning. CoRR abs/2302.05745 (2023) - [i32]Yarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula, Ishai Menache, Michael Schapira, Aviv Tamar:
A Deep Learning Perspective on Network Routing. CoRR abs/2303.00735 (2023) - 2022
- [j29]Mathieu Jadin, Quentin De Coninck, Louis Navarre, Michael Schapira, Olivier Bonaventure:
Leveraging eBPF to Make TCP Path-Aware. IEEE Trans. Netw. Serv. Manag. 19(3): 2827-2838 (2022) - [c90]Guy Amir, Tom Zelazny, Guy Katz, Michael Schapira:
Verification-Aided Deep Ensemble Selection. FMCAD 2022: 27-37 - [c89]Ravid Hadar, Michael Schapira:
Network congestion control and its impact on video streaming QoE. MHV 2022: 111 - [i31]Guy Amir, Guy Katz, Michael Schapira:
Verification-Aided Deep Ensemble Selection. CoRR abs/2202.03898 (2022) - 2021
- [j28]Hari Balakrishnan, Sujata Banerjee, Israel Cidon, David E. Culler, Deborah Estrin, Ethan Katz-Bassett, Arvind Krishnamurthy, James Murphy McCauley, Nick McKeown, Aurojit Panda, Sylvia Ratnasamy, Jennifer Rexford, Michael Schapira, Scott Shenker, Ion Stoica, David L. Tennenhouse, Amin Vahdat, Ellen W. Zegura:
Revitalizing the public internet by making it extensible. Comput. Commun. Rev. 51(2): 18-24 (2021) - [c88]Tong Meng, Christopher Cai, Brighten Godfrey, Michael Schapira:
Toward greater scavenger congestion control deployment: implementations and interfaces. ANRW 2021: 59-61 - [c87]Guy Amir, Michael Schapira, Guy Katz:
Towards Scalable Verification of Deep Reinforcement Learning. FMCAD 2021: 193-203 - [c86]Yarin Perry, Neta Rozen Schiff, Michael Schapira:
A Devil of a Time: How Vulnerable is NTP to Malicious Timeservers? NDSS 2021 - [c85]Tomer Eliyahu, Yafim Kazak, Guy Katz, Michael Schapira:
Verifying learning-augmented systems. SIGCOMM 2021: 305-318 - [e1]Michael Schapira:
2nd Symposium on Algorithmic Principles of Computer Systems, APOCS 2020, Virtual Conference, January 13, 2021. SIAM 2021, ISBN 978-1-61197-648-9 [contents] - [i30]Guy Amir, Michael Schapira, Guy Katz:
Towards Scalable Verification of RL-Driven Systems. CoRR abs/2105.11931 (2021) - 2020
- [j27]Michael Dinitz, Michael Schapira, Gal Shahaf:
Approximate Moore Graphs are good expanders. J. Comb. Theory B 141: 240-263 (2020) - [c84]Tomer Gilad, Neta Rozen Schiff, Philip Brighten Godfrey, Costin Raiciu, Michael Schapira:
MPCC: online learning multipath transport. CoNEXT 2020: 121-135 - [c83]Lloyd Brown, Ganesh Ananthanarayanan, Ethan Katz-Bassett, Arvind Krishnamurthy, Sylvia Ratnasamy, Michael Schapira, Scott Shenker:
On the Future of Congestion Control for the Public Internet. HotNets 2020: 30-37 - [c82]Noga H. Rotman, Michael Schapira, Aviv Tamar:
Online Safety Assurance for Learning-Augmented Systems. HotNets 2020: 88-95 - [c81]Tomas Hlavacek, Ítalo Cunha, Yossi Gilad, Amir Herzberg, Ethan Katz-Bassett, Michael Schapira, Haya Schulmann:
DISCO: Sidestepping RPKI's Deployment Barriers. NDSS 2020 - [c80]Yotam Harchol, Dirk Bergemann, Nick Feamster, Eric J. Friedman, Arvind Krishnamurthy, Aurojit Panda, Sylvia Ratnasamy, Michael Schapira, Scott Shenker:
A Public Option for the Core. SIGCOMM 2020: 377-389 - [c79]Tong Meng, Neta Rozen Schiff, Philip Brighten Godfrey, Michael Schapira:
PCC Proteus: Scavenger Transport And Beyond. SIGCOMM 2020: 615-631 - [i29]Noga H. Rotman, Michael Schapira, Aviv Tamar:
Online Safety Assurance for Deep Reinforcement Learning. CoRR abs/2010.03625 (2020)
2010 – 2019
- 2019
- [j26]Doron Zarchy, Radhika Mittal, Michael Schapira, Scott Shenker:
Axiomatizing Congestion Control. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 33:1-33:33 (2019) - [c78]Todd Arnold, Matt Calder, Ítalo Cunha, Arpit Gupta, Harsha V. Madhyastha, Michael Schapira, Ethan Katz-Bassett:
Beating BGP is Harder than we Thought. HotNets 2019: 9-16 - [c77]Tomer Gilad, Nathan H. Jay, Michael Shnaiderman, Brighten Godfrey, Michael Schapira:
Robustifying Network Protocols with Adversarial Examples. HotNets 2019: 85-92 - [c76]Nathan Jay, Noga H. Rotman, Brighten Godfrey, Michael Schapira, Aviv Tamar:
A Deep Reinforcement Learning Perspective on Internet Congestion Control. ICML 2019: 3050-3059 - [c75]Jeremy Bogle, Nikhil Bhatia, Manya Ghobadi, Ishai Menache, Nikolaj S. Bjørner, Asaf Valadarsky, Michael Schapira:
TEAVAR: striking the right utilization-availability balance in WAN traffic engineering. SIGCOMM 2019: 29-43 - [c74]Yafim Kazak, Clark W. Barrett, Guy Katz, Michael Schapira:
Verifying Deep-RL-Driven Systems. NetAI@SIGCOMM 2019: 83-89 - [c73]Doron Zarchy, Radhika Mittal, Michael Schapira, Scott Shenker:
Axiomatizing Congestion Control. SIGMETRICS (Abstracts) 2019: 51-52 - 2018
- [j25]Ahuva Mu'alem, Michael Schapira:
Setting lower bounds on truthfulness. Games Econ. Behav. 110: 174-193 (2018) - [j24]Amit Daniely, Michael Schapira, Gal Shahaf:
Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik-Chervonenkis Dimension. SIAM J. Comput. 47(1): 96-120 (2018) - [j23]Marco Chiesa, Gábor Rétvári, Michael Schapira:
Oblivious Routing in IP Networks. IEEE/ACM Trans. Netw. 26(3): 1292-1305 (2018) - [c72]Neta Rozen Schiff, Michael Schapira, Danny Dolev, Omer Deutsch:
Preventing (Network) Time Travel with Chronos. ANRW 2018: 17 - [c71]Michael Dinitz, Michael Schapira, Gal Shahaf:
Large Low-Diameter Graphs are Good Expanders. ESA 2018: 71:1-71:15 - [c70]Yossi Gilad, Tomas Hlavacek, Amir Herzberg, Michael Schapira, Haya Schulmann:
Perfect is the Enemy of Good: Setting Realistic Goals for BGP Security. HotNets 2018: 57-63 - [c69]Michael Schapira:
Network-Model-Based vs. Network-Model-Free Approaches to Internet Congestion Control. HPSR 2018: 1-8 - [c68]Doron Zarchy, Amogh Dhamdhere, Constantine Dovrolis, Michael Schapira:
Nash-peering: A new techno-economic framework for internet interconnections. INFOCOM Workshops 2018: 403-408 - [c67]Simone Mangiante, Michael Schapira, Amit Navon, Marco Dias Silva, Brighten Godfrey, Weiguang Wang, Kevin Smith, Itzcak Pechtalt:
Congestion Control for Future Mobile Networks. CHANTS@MOBICOM 2018: 55-61 - [c66]Omer Deutsch, Neta Rozen Schiff, Danny Dolev, Michael Schapira:
Preventing (Network) Time Travel with Chronos. NDSS 2018 - [c65]Mo Dong, Tong Meng, Doron Zarchy, Engin Arslan, Yossi Gilad, Brighten Godfrey, Michael Schapira:
PCC Vivace: Online-Learning Congestion Control. NSDI 2018: 343-356 - [i28]Nathan Jay, Noga H. Rotman, Philip Brighten Godfrey, Michael Schapira, Aviv Tamar:
Internet Congestion Control via Deep Reinforcement Learning. CoRR abs/1810.03259 (2018) - [i27]Aran Bergman, Israel Cidon, Isaac Keslassy, Noga H. Rotman, Michael Schapira, Alex Markuze, Eyal Zohar:
Pied Piper: Rethinking Internet Data Delivery. CoRR abs/1812.05582 (2018) - 2017
- [j22]Michael Dinitz, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. Algorithmica 78(4): 1225-1245 (2017) - [j21]Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner:
Privacy-Preserving Interdomain Routing at Internet Scale. Proc. Priv. Enhancing Technol. 2017(3): 147 (2017) - [j20]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Dynamics at the Boundary of Game Theory and Distributed Computing. ACM Trans. Economics and Comput. 5(3): 15:1-15:20 (2017) - [j19]Marco Chiesa, Guy Kindler, Michael Schapira:
Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective. IEEE/ACM Trans. Netw. 25(2): 779-792 (2017) - [j18]Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrovic, Andrei V. Gurtov, Aleksander Madry, Michael Schapira, Scott Shenker:
On the Resiliency of Static Forwarding Tables. IEEE/ACM Trans. Netw. 25(2): 1133-1146 (2017) - [c64]Marco Chiesa, Daniel Demmler, Marco Canini, Michael Schapira, Thomas Schneider:
SIXPACK: Securing Internet eXchange Points Against Curious onlooKers. CoNEXT 2017: 120-133 - [c63]Doron Zarchy, Radhika Mittal, Michael Schapira, Scott Shenker:
An Axiomatic Approach to Congestion Control. HotNets 2017: 115-121 - [c62]Michael Schapira, Keith Winstein:
Congestion-Control Throwdown. HotNets 2017: 122-128 - [c61]Asaf Valadarsky, Michael Schapira, Dafna Shahaf, Aviv Tamar:
Learning to Route. HotNets 2017: 185-191 - [c60]Yossi Gilad, Avichai Cohen, Amir Herzberg, Michael Schapira, Haya Schulmann:
Are We There Yet? On RPKI's Deployment and Security. NDSS 2017 - [c59]Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. PODC 2017: 419-421 - [c58]Simon Kassing, Asaf Valadarsky, Gal Shahaf, Michael Schapira, Ankit Singla:
Beyond fat-trees without antennae, mirrors, and disco-balls. SIGCOMM 2017: 281-294 - [i26]Asaf Valadarsky, Michael Schapira, Dafna Shahaf, Aviv Tamar:
A Machine Learning Approach to Routing. CoRR abs/1708.03074 (2017) - [i25]Michael Schapira, Gal Shahaf:
Oblivious Routing via Random Walks. CoRR abs/1712.02076 (2017) - [i24]Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner:
Privacy-Preserving Interdomain Routing at Internet Scale. IACR Cryptol. ePrint Arch. 2017: 393 (2017) - 2016
- [j17]Robert Lychev, Michael Schapira, Sharon Goldberg:
Rethinking security for internet routing. Commun. ACM 59(10): 48-57 (2016) - [j16]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. J. ACM 63(2): 11:1-11:19 (2016) - [c57]Marco Chiesa, Daniel Demmler, Marco Canini, Michael Schapira, Thomas Schneider:
Towards Securing Internet eXchange Points Against Curious onlooKers. ANRW 2016: 32-34 - [c56]Asaf Valadarsky, Gal Shahaf, Michael Dinitz, Michael Schapira:
Xpander: Towards Optimal-Performance Datacenters. CoNEXT 2016: 205-219 - [c55]Marco Chiesa, Gábor Rétvári, Michael Schapira:
Lying Your Way to Better Traffic Engineering. CoNEXT 2016: 391-398 - [c54]Marco Chiesa, Andrei V. Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Schapira, Scott Shenker:
On the Resiliency of Randomized Routing Against Multiple Edge Failures. ICALP 2016: 134:1-134:15 - [c53]Marco Chiesa, Ilya Nikolaevskiy, Slobodan Mitrovic, Aurojit Panda, Andrei V. Gurtov, Aleksander Madry, Michael Schapira, Scott Shenker:
The quest for resilient (static) forwarding tables. INFOCOM 2016: 1-9 - [c52]Rishab Nithyanand, Oleksii Starov, Phillipa Gill, Adva Zair, Michael Schapira:
Measuring and Mitigating AS-level Adversaries Against Tor. NDSS 2016 - [c51]Avichai Cohen, Yossi Gilad, Amir Herzberg, Michael Schapira:
Jumpstarting BGP Security with Path-End Validation. SIGCOMM 2016: 342-355 - [i23]Doron Zarchy, Amogh Dhamdhere, Constantine Dovrolis, Michael Schapira:
Nash-Peering: A New Techno-Economic Framework for Internet Interconnections. CoRR abs/1610.01314 (2016) - [i22]Marco Chiesa, Gábor Rétvári, Michael Schapira:
Lying Your Way to Better Traffic Engineering. CoRR abs/1610.02728 (2016) - [i21]Danny Dolev, Michael Erdmann, Neil Lutz, Michael Schapira, Adva Zair:
Stateless Computation. CoRR abs/1611.10068 (2016) - [i20]Yossi Gilad, Avichai Cohen, Amir Herzberg, Michael Schapira, Haya Schulmann:
Are We There Yet? On RPKI's Deployment and Security. IACR Cryptol. ePrint Arch. 2016: 1010 (2016) - 2015
- [c50]Michael Dinitz, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. ESA 2015: 399-410 - [c49]Avichai Cohen, Yossi Gilad, Amir Herzberg, Michael Schapira:
One Hop for RPKI, One Giant Leap for BGP Security. HotNets 2015: 10:1-10:7 - [c48]Asaf Valadarsky, Michael Dinitz, Michael Schapira:
Xpander: Unveiling the Secrets of High-Performance Datacenters. HotNets 2015: 16:1-16:7 - [c47]Doron Zarchy, David Hay, Michael Schapira:
Capturing resource tradeoffs in fair multi-resource allocation. INFOCOM 2015: 1062-1070 - [c46]Mo Dong, Qingxi Li, Doron Zarchy, Philip Brighten Godfrey, Michael Schapira:
PCC: Re-architecting Congestion Control for Consistent High Performance. NSDI 2015: 395-408 - [c45]Aurojit Panda, Katerina J. Argyraki, Mooly Sagiv, Michael Schapira, Scott Shenker:
New Directions for Network Verification. SNAPL 2015: 209-220 - [c44]Amit Daniely, Michael Schapira, Gal Shahaf:
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension. STOC 2015: 401-408 - [i19]Rishab Nithyanand, Oleksii Starov, Adva Zair, Phillipa Gill, Michael Schapira:
Measuring and mitigating AS-level adversaries against Tor. CoRR abs/1505.05173 (2015) - [i18]Michael Dinitz, Michael Schapira, Asaf Valadarsky:
Explicit Expanding Expanders. CoRR abs/1507.01196 (2015) - [i17]Ahuva Mu'alem, Michael Schapira:
Setting Lower Bounds on Truthfulness. CoRR abs/1507.08708 (2015) - [i16]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Dynamics at the Boundary of Game Theory and Distributed Computing. CoRR abs/1509.02955 (2015) - 2014
- [j15]Phillipa Gill, Michael Schapira, Sharon Goldberg:
A survey of interdomain routing policies. Comput. Commun. Rev. 44(1): 28-34 (2014) - [j14]Sharon Goldberg, Michael Schapira, Peter Hummon, Jennifer Rexford:
How secure are secure interdomain routing protocols? Comput. Networks 70: 260-287 (2014) - [j13]Roee Engelberg, Michael Schapira:
Weakly-Acyclic (Internet) Routing Games. Theory Comput. Syst. 54(3): 431-452 (2014) - [j12]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: Foundations and Quantification. ACM Trans. Algorithms 10(3): 11:1-11:38 (2014) - [c43]Marco Chiesa, Guy Kindler, Michael Schapira:
Traffic engineering with Equal-Cost-Multipath: An algorithmic perspective. INFOCOM 2014: 1590-1598 - [c42]Thomas Ball, Nikolaj S. Bjørner, Aaron Gember, Shachar Itzhaky, Aleksandr Karbyshev, Mooly Sagiv, Michael Schapira, Asaf Valadarsky:
VeriCon: towards verifying controller programs in software-defined networks. PLDI 2014: 282-293 - [c41]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Self-stabilizing Uncoupled Dynamics. SAGT 2014: 74-85 - [c40]Mo Dong, Qingxi Li, Doron Zarchy, Brighten Godfrey, Michael Schapira:
Rethinking congestion control architecture: performance-oriented congestion control. SIGCOMM 2014: 365-366 - [i15]Aaron D. Jaggard, Neil Lutz, Michael Schapira, Rebecca N. Wright:
Self-stabilizing uncoupled dynamics. CoRR abs/1403.5791 (2014) - [i14]Marco Chiesa, Ilya Nikolaevskiy, Aurojit Panda, Andrei V. Gurtov, Michael Schapira, Scott Shenker:
Exploring the Limits of Static Failover Routing. CoRR abs/1409.0034 (2014) - [i13]Mo Dong, Qingxi Li, Doron Zarchy, Brighten Godfrey, Michael Schapira:
PCC: Re-architecting Congestion Control for Consistent High Performance. CoRR abs/1409.7092 (2014) - [i12]Amit Daniely, Michael Schapira, Gal Shahaf:
Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension. CoRR abs/1412.6265 (2014) - 2013
- [j11]Moshe Babaioff, Liad Blumrosen, Michael Schapira:
The communication burden of payment determination. Games Econ. Behav. 77(1): 153-167 (2013) - [j10]Alex Fabrikant, Aaron D. Jaggard, Michael Schapira:
On the Structure of Weakly Acyclic Games. Theory Comput. Syst. 53(1): 107-122 (2013) - [c39]Junda Liu, Aurojit Panda, Ankit Singla, Brighten Godfrey, Michael Schapira, Scott Shenker:
Ensuring Connectivity via Data Plane Mechanisms. NSDI 2013: 113-126 - [c38]Robert Lychev, Sharon Goldberg, Michael Schapira:
BGP security in partial deployment: is the juice worth the squeeze? SIGCOMM 2013: 171-182 - [c37]Roee Engelberg, Alex Fabrikant, Michael Schapira, David Wajc:
Best-response dynamics out of sync: complexity and characterization. EC 2013: 379-396 - [c36]Sigal Oren, Michael Schapira, Moshe Tennenholtz:
Pay or Play. UAI 2013 - [i11]Robert Lychev, Sharon Goldberg, Michael Schapira:
BGP Security in Partial Deployment: Is the Juice Worth the Squeeze? CoRR abs/1307.2690 (2013) - [i10]Sigal Oren, Michael Schapira, Moshe Tennenholtz:
Pay or Play. CoRR abs/1309.6854 (2013) - 2012
- [j9]Phillipa Gill, Michael Schapira, Sharon Goldberg:
Modeling on quicksand: dealing with the scarcity of ground truth in interdomain routing data. Comput. Commun. Rev. 42(1): 40-46 (2012) - [j8]Eric Keller, Michael Schapira, Jennifer Rexford:
Rehoming edge links for better traffic engineering. Comput. Commun. Rev. 42(2): 65-71 (2012) - [j7]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions. J. Comput. Syst. Sci. 78(1): 15-25 (2012) - [j6]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On communication protocols that compute almost privately. Theor. Comput. Sci. 457: 45-58 (2012) - [c35]Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker:
A new approach to interdomain routing based on secure multi-party computation. HotNets 2012: 37-42 - [c34]Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla:
Brief announcement: on the resilience of routing tables. PODC 2012: 237-238 - [c33]Robert Lychev, Sharon Goldberg, Michael Schapira:
Brief announcement: network-destabilizing attacks. PODC 2012: 331-332 - [c32]Akash Baid, Michael Schapira, Ivan Seskar, Jennifer Rexford, Dipankar Raychaudhuri:
Network cooperation for client-ap association optimization. WiOpt 2012: 431-436 - [i9]Robert Lychev, Sharon Goldberg, Michael Schapira:
Network-Destabilizing Attacks. CoRR abs/1203.1681 (2012) - [i8]Joan Feigenbaum, Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, Ankit Singla:
On the Resilience of Routing Tables. CoRR abs/1207.3732 (2012) - 2011
- [j5]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. Distributed Comput. 23(5-6): 301-319 (2011) - [j4]Hagay Levin, Michael Schapira, Aviv Zohar:
Interdomain Routing and Games. SIAM J. Comput. 40(6): 1892-1912 (2011) - [j3]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
When is it best to best-respond? SIGecom Exch. 10(2): 16-18 (2011) - [c31]Junda Liu, Baohua Yang, Scott Shenker, Michael Schapira:
Data-driven network connectivity. HotNets 2011: 8 - [c30]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Best-Response Mechanisms. ICS 2011: 155-165 - [c29]Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright:
Distributed Computing with Adaptive Heuristics. ICS 2011: 417-443 - [c28]Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright:
Distributed computing with rules of thumb. PODC 2011: 333-334 - [c27]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Incentive-compatible distributed greedy protocols. PODC 2011: 335-336 - [c26]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On Communication Protocols That Compute Almost Privately. SAGT 2011: 44-56 - [c25]Roee Engelberg, Michael Schapira:
Weakly-Acyclic (Internet) Routing Games. SAGT 2011: 290-301 - [c24]Phillipa Gill, Michael Schapira, Sharon Goldberg:
Let the market drive deployment: a strategy for transitioning to BGP security. SIGCOMM 2011: 14-25 - [c23]Noam Nisan, Michael Schapira, Gregory Valiant, Aviv Zohar:
Best-response auctions. EC 2011: 351-360 - [i7]Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
(Approximately) Privacy-Preserving Dissection Protocols. CoRR abs/1102.1443 (2011) - [i6]Alex Fabrikant, Aaron D. Jaggard, Michael Schapira:
On the Structure of Weakly Acyclic Games. CoRR abs/1108.2092 (2011) - 2010
- [j2]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. Math. Oper. Res. 35(1): 1-13 (2010) - [c22]Michael Schapira, Yaping Zhu, Jennifer Rexford:
Putting BGP on the right path: a case for next-hop routing. HotNets 2010: 3 - [c21]Alex Fabrikant, Aaron D. Jaggard, Michael Schapira:
On the Structure of Weakly Acyclic Games. SAGT 2010: 126-137 - [c20]Sharon Goldberg, Michael Schapira, Peter Hummon, Jennifer Rexford:
How secure are secure interdomain routing protocols. SIGCOMM 2010: 87-98 - [c19]David Buchfuhrer, Michael Schapira, Yaron Singer:
Computation and incentives in combinatorial public projects. EC 2010: 33-42 - [c18]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate privacy: foundations and quantification (extended abstract). EC 2010: 167-178 - [c17]Brighten Godfrey, Michael Schapira, Aviv Zohar, Scott Shenker:
Incentive compatibility and dynamics of congestion control. SIGMETRICS 2010: 95-106 - [c16]David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans:
Inapproximability for VCG-Based Combinatorial Auctions. SODA 2010: 518-536 - [i5]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: PARs for Set Problems. CoRR abs/1001.3388 (2010)
2000 – 2009
- 2009
- [c15]Rahul Sami, Michael Schapira, Aviv Zohar:
Searching for Stability in Interdomain Routing. INFOCOM 2009: 549-557 - [c14]Yi Wang, Michael Schapira, Jennifer Rexford:
Neighbor-specific BGP: more flexible routing policies while improving global stability. SIGMETRICS/Performance 2009: 217-228 - [i4]Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer:
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension. CoRR abs/0905.1995 (2009) - [i3]Yi Wang, Michael Schapira, Jennifer Rexford:
Neighbor-Specific BGP: More Flexible Routing Policies While Improving Global Stability. CoRR abs/0906.3846 (2009) - [i2]Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright:
Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond. CoRR abs/0910.1585 (2009) - [i1]Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira:
Approximate Privacy: Foundations and Quantification. CoRR abs/0910.5714 (2009) - 2008
- [b1]Michael Schapira:
The economics of internet protocols (מבט כלכלי על פרוטוקולי אינטרנט.). Hebrew University of Jerusalem, Israel, 2008 - [j1]Ahuva Mu'alem, Michael Schapira:
Characterizing truthfulness in discrete domains. SIGecom Exch. 7(2) (2008) - [c13]Christos H. Papadimitriou, Michael Schapira, Yaron Singer:
On the Hardness of Being Truthful. FOCS 2008: 250-259 - [c12]George Christodoulou, Annamária Kovács, Michael Schapira:
Bayesian Combinatorial Auctions. ICALP (1) 2008: 820-832 - [c11]Ahuva Mu'alem, Michael Schapira:
Mechanism design over discrete domains. EC 2008: 31-37 - [c10]Vahab S. Mirrokni, Michael Schapira, Jan Vondrák:
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. EC 2008: 70-77 - [c9]Moshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira:
Informational overhead of incentive compatibility. EC 2008: 88-97 - [c8]Hagay Levin, Michael Schapira, Aviv Zohar:
Interdomain routing and games. STOC 2008: 57-66 - [c7]Michael Schapira, Yaron Singer:
Inapproximability of Combinatorial Public Projects. WINE 2008: 351-361 - [c6]Noam Nisan, Michael Schapira, Aviv Zohar:
Asynchronous Best-Reply Dynamics. WINE 2008: 531-538 - 2007
- [c5]Ahuva Mu'alem, Michael Schapira:
Setting lower bounds on truthfulness: extended abstract. SODA 2007: 1143-1152 - 2006
- [c4]Joan Feigenbaum, Vijay Ramachandran, Michael Schapira:
Incentive-compatible interdomain routing. EC 2006: 130-139 - [c3]Shahar Dobzinski, Michael Schapira:
An improved approximation algorithm for combinatorial auctions with submodular bidders. SODA 2006: 1064-1073 - [c2]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Truthful randomized mechanisms for combinatorial auctions. STOC 2006: 644-652 - 2005
- [c1]Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation algorithms for combinatorial auctions with complement-free bidders. STOC 2005: 610-618
Coauthor Index
Brighten Godfrey
aka: Philip Brighten Godfrey
aka: Philip Brighten Godfrey
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 02:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
