default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain J. Mayer
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j11]Alain J. Mayer, Avishai Wool
, Elisha Ziskind:
Offline firewall analysis. Int. J. Inf. Sec. 5(3): 125-144 (2006)- 2004
- [j10]Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool:
Firmato: A novel firewall management toolkit. ACM Trans. Comput. Syst. 22(4): 381-420 (2004) - 2002
- [j9]Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant Space. SIAM J. Comput. 31(5): 1571-1595 (2002) - [c20]Alain J. Mayer:
Application Aware Management of Internet Data Center Software. LISA 2002: 33-46 - 2000
- [j8]Alain J. Mayer, Yoram Ofek, Moti Yung:
Local and congestion-driven fairness algorithm in arbitrary topology networks. IEEE/ACM Trans. Netw. 8(3): 362-372 (2000) - [c19]Alain J. Mayer, Avishai Wool, Elisha Ziskind:
Fang: A Firewall Analysis Engine. S&P 2000: 177-187
1990 – 1999
- 1999
- [j7]Eran Gabber, Phillip B. Gibbons, David M. Kristol, Yossi Matias, Alain J. Mayer:
Consistent, Yet Anonymous, Web Access with LPWA. Commun. ACM 42(2): 42-47 (1999) - [j6]Vinod Anupam, Alain J. Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter:
On the Security of Pay-per-Click and Other Web Advertising Schemes. Comput. Networks 31(11-16): 1091-1100 (1999) - [j5]Eran Gabber, Phillip B. Gibbons, David M. Kristol, Yossi Matias, Alain J. Mayer:
On secure and pseudonymous client-relationships with multiple servers. ACM Trans. Inf. Syst. Secur. 2(4): 390-415 (1999) - [c18]Alain J. Mayer, Moti Yung:
Secure Protocol Transformation via "Expansion": From Two-Party to Groups. CCS 1999: 83-92 - [c17]Yair Bartal, Alain J. Mayer, Kobbi Nissim, Avishai Wool:
Firmato: A Novel Firewall Management Toolkit. S&P 1999: 17-31 - [c16]Vinod Anupam, David M. Kristol, Alain J. Mayer:
A User's and Programmer's View of the New JavaScript Security Model. USENIX Symposium on Internet Technologies and Systems 1999 - [c15]Ian Jermyn, Alain J. Mayer, Fabian Monrose, Michael K. Reiter, Aviel D. Rubin:
The Design and Analysis of Graphical Passwords. USENIX Security Symposium 1999 - 1998
- [j4]Vinod Anupam, Alain J. Mayer:
Secure Web Scripting. IEEE Internet Comput. 2(6): 46-55 (1998) - [j3]Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SIAM J. Comput. 27(4): 1168-1189 (1998) - [c14]Eran Gabber, Markus Jakobsson, Yossi Matias, Alain J. Mayer:
Curbing Junk E-Mail via Secure Classification. Financial Cryptography 1998: 198-213 - [c13]Vinod Anupam, Alain J. Mayer:
Security of Web Browser Scripting Languages: Vulnerabilities, Attacks, and Remedies. USENIX Security Symposium 1998 - [c12]Daniel Bleichenbacher, Eran Gabber, Phillip B. Gibbons, Yossi Matias, Alain J. Mayer:
On Secure and Pseudonymous Client-Relationships with Multiple Servers. USENIX Workshop on Electronic Commerce 1998 - [c11]Michael K. Reiter, Vinod Anupam, Alain J. Mayer:
Detecting Hit Shaving in Click-Through Payment Schemes. USENIX Workshop on Electronic Commerce 1998 - 1997
- [c10]Eran Gabber, Phillip B. Gibbons, Yossi Matias, Alain J. Mayer:
How to Make Personalized Web Browising Simple, Secure, and Anonymous. Financial Cryptography 1997: 17-32 - [c9]Yossi Matias, Alain J. Mayer, Abraham Silberschatz:
Lightweight Security Primitives for E-Commerce. USENIX Symposium on Internet Technologies and Systems 1997 - 1996
- [j2]Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of PDL with Interleaving. Theor. Comput. Sci. 161(1&2): 109-122 (1996) - [c8]Alain J. Mayer, Yoram Ofek, Moti Yung:
Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information. INFOCOM 1996: 928-936 - [c7]Alain J. Mayer, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. SODA 1996: 564-573 - 1995
- [c6]Zvi Galil, Alain J. Mayer, Moti Yung:
Resolving Message Complexity of Byzantine Agreement and beyond. FOCS 1995: 724-733 - [c5]Alain J. Mayer, Yoram Ofek, Moti Yung:
Local Fairness in General-Topology Networks with Convergence Routing. INFOCOM 1995: 891-899 - [c4]Alain J. Mayer, Moni Naor, Larry J. Stockmeyer:
Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS 1995: 268-278 - [c3]Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan:
Guaranteeing Fair Service to Persistent Dependent Tasks. SODA 1995: 243-252 - 1994
- [j1]Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of Word Problems - This Time with Interleaving. Inf. Comput. 115(2): 293-311 (1994) - [c2]Roberto De Prisco, Alain J. Mayer, Moti Yung:
Time-Optimal Message-Efficient Work Performance in the Presence of Faults (Extended Summary). PODC 1994: 161-172 - 1992
- [c1]Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract). STOC 1992: 667-678
Coauthor Index
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 2024-10-07 22:16 CEST 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:
