DOCSLIB.ORG

Submission Data for 2020-2021 CORE Conference Ranking Process ACM Symposium on Principles of Distributed Computing Jennifer Welc

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Submission Data for 2020-2021 CORE Conference Ranking Process ACM Symposium on Principles of Distributed Computing Jennifer Welc Submission Data for 2020-2021 CORE conference Ranking process ACM Symposium on Principles of Distributed Computing Jennifer Welch Conference Details Conference Title: ACM Symposium on Principles of Distributed Computing Acronym : PODC Rank: A* Requested Rank Rank: A* Recent Years Proceedings Publishing Style Proceedings Publishing: self-contained Link to most recent proceedings: https://dl.acm.org/doi/proceedings/10.1145/3293611 Further details: The proceedings are published by ACM. Short papers are distinguished by mandatory requirement that the title be prefaced by the string ”Brief Announcement:”. Most Recent Years Most Recent Year Year: 2019 URL: https://www.podc.org/podc2019/ Location: Toronto, Canada Papers submitted: 173 Papers published: 48 Acceptance rate: 28 Source for numbers: https://dl.acm.org/doi/proceedings/10.1145/3293611 General Chairs Name: Jennifer Welch Affiliation: Texas A&M University, USA Gender: F H Index: 34 GScholar url: https://scholar.google.com/citations?user=_BSIZHAAAAAJ&hl=en&oi=sra DBLP url: https://dblp.org/pid/w/JenniferLWelch.html Program Chairs Name: Faith Ellen Affiliation: University of Toronto, Canada Gender: F H Index: unknown; ACM Fellow GScholar url: DBLP url: https://dblp.org/pid/f/FEFich.html Second Most Recent Year 1 Year: 2018 URL: https://www.podc.org/podc2018/ Location: Royal Holloway, University of London, UK Papers submitted: 163 Papers published: 41 Acceptance rate: 25 Source for numbers: https://dl.acm.org/doi/proceedings/10.1145/3212734 General Chairs Name: Nitin Vaidya Affiliation: University of Illinois, USA Gender: M H Index: 73 GScholar url: https://scholar.google.com/citations?user=ieHEh6EAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/v/NitinHVaidya.html Program Chairs Name: Idit Keidar Affiliation: Technion, Israel Gender: F H Index: 42 GScholar url: https://scholar.google.com/citations?user=dH_bwg8AAAAJ&hl=en&oi=sra DBLP url: https://dblp.org/pid/k/IditKeidar.html Third Most Recent Year Year: 2017 URL: https://www.podc.org/podc2017/ Location: Washington, DC, USA Papers submitted: 154 Papers published: 38 Acceptance rate: 25 Source for numbers: https://dl.acm.org/doi/proceedings/10.1145/3087801 General Chairs Name: Nitin Vaidya Affiliation: University of Illinois, USA Gender: M H Index: 73 GScholar url: https://scholar.google.com/citations?user=ieHEh6EAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/v/NitinHVaidya.html Program Chairs Name: Alexander Schwarzmann Affiliation: University of Connecticut, USA Gender: M H Index: unknown GScholar url: DBLP url: https://dblp.org/pid/s/AlexanderAShvartsman.html Policies Chair Selection: PODC is overseen by a steering committee (SC) of 7 members. The SC provides leadership to the PODC community and serves to represent the community in the broader landscape, to interact and forge ties with related conferences and research venues, and to work with ACM on all relevant issues. The SC chair is elected at the PODC Business Meeting for a 3-year term at the conclusion of the term of the then current Chair. The SC chair provides overall leadership: leads the selection of locations and organizing chairs for future PODC; serves as the main point of contact for interactions and ties with other related conferences and workshops, with ACM, and other organizations; chairs Business Meetings and SC meetings. Note: I have assumed that ”general chair” in this application refers more aptly to PODC SC chair, rather than what PODC calls general chair, whose role is manage all aspects of conference logistics, provide organizational continuity from one conference to the next, guide the treasurer, and interact with industrial and other potential sponsors in helping secure support for the conference. The program committee (PC) chair is determined by the SC as follows. Any current SC Member can nominate the next PC Chair candidates to the SC (candidates cannot be current SC members); the candidates are then discussed within the SC. If there are more than two candidates at the conclusion of the discussion, the subset of the SC consisting of the most recent three PC chairs selects the 2 final list of two candidates. The next PC Chair is then elected by a majority vote of the SC (the elected PC Chair subsequently replaces the oldest serving PC Chair). Policy name: Policy Against Harassment at ACM Activities Policy url: https://www.acm.org/special-interest-groups/volunteer-resources/officers-manual/ policy-against-discrimination-and-harassment (Senior) Program Committee Link to (s)pc: https://www.podc.org/podc2019/program-committee/ File: http://portal.core.edu.au/core/media/conf_submissions_spc_file/PODC_RWJE2ZB.txt H-index plot: http://portal.core.edu.au/core/media/conf_submissions_hindex_plots/hindex_buckets_1449.png Information Contained within this graph is derived using the Elsevier Scopus Database 2021. Data and Metrics Google Scholar Metrics Sub-category url: https://scholar.google.com.au/citations?view_op=top_venues&hl=en&vq=eng_theoreticalcomputerscience Position in sub-category: 20+ Image of top 20: http://portal.core.edu.au/core/media/changes_h5/higherrank1449_gscholar_minh5.pdf h5-index for this conference: 28 ACM Metrics Is an ACM sponsored conference: True Providing ACM Stats: True ACM Statistics Downloads in last 12 months: 56038 Average citations per article: 18 Average downloads per article: 317 ACM Most frequently publishing 3 Name: Mohsen Ghaffari Paper Count: 15 Google Scholar h-index: 26 Gscholar url: https://scholar.google.com/citations?user=MHLyZY4AAAAJ&hl=en Name: Fabian Kuhn Paper Count: 13 Google Scholar h-index: 42 Gscholar url: https://scholar.google.com/citations?hl=en&user=XU-ldxMAAAAJ Name: Keren Censor-Hillel Paper Count: 11 Google Scholar h-index: 22 Gscholar url: https://scholar.google.com/citations?hl=en&user=HdOuwlQAAAAJ Name: Yannic Maus Paper Count: 10 Google Scholar h-index: 9 Gscholar url: https://scholar.google.com/citations?hl=en&user=GwluKiMAAAAJ Name: Sebastian Brandt Paper Count: 9 Google Scholar h-index: 0 Gscholar url: https://scholar.google.com/ Name: Magnus Halldorsson Paper Count: 8 Google Scholar h-index: 44 Gscholar url: https://scholar.google.com/citations?hl=en&user=olerUhcAAAAJ Name: Nitin Vaidya Paper Count: 8 Google Scholar h-index: 73 Gscholar url: https://scholar.google.com/citations?hl=en&user=ieHEh6EAAAAJ Name: Michael Elkin Paper Count: 8 Google Scholar h-index: 31 Gscholar url: https://scholar.google.com/citations?hl=en&user=bPZBS_gAAAAJ Name: Idit Keidar Paper Count: 8 Google Scholar h-index: 42 Gscholar url: https://scholar.google.com/citations?hl=en&user=dH_bwg8AAAAJ Name: Bernhard Haeupler Paper Count: 8 Google Scholar h-index: 28 Gscholar url: https://scholar.google.com/citations?hl=en&user=hIq09eUAAAAJ Aminer Rank Not Listed in Aminer Other Rankings Not aware of any other Rankings Conferences in area: PODC DISC SPAA Top People Publishing Here name: Hagit Attiya justification: Technion, Israel h-index 44 ACM Fellow, Dijkstra Prize https://scholar.google.com/citations?user=eoMK92MAAAAJ&hl=en https://dl.acm.org/conference/podc/authors https://awards.acm.org/fellows/award-winners Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 2 0 1 2 Attendance: ALWAYS name: Faith Ellen justification: University of Toronto, Israel ACM Fellow 4 https://dl.acm.org/conference/podc/authors https://awards.acm.org/fellows/award-winners Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 1 0 2 1 Attendance: ALWAYS name: Rachid Guerraoui justification: EPFL, Switzerland h-index 75 ACM Fellow https://dl.acm.org/conference/podc/authors https://awards.acm.org/fellows/award-winners https://scholar.google.com/citations?hl=en&user=_TR-7CEAAAAJ Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 2 1 0 2 Attendance: ALWAYS name: Joseph Halpern justification: Cornell University, USA h-index 89 ACM Fellow, IEEE Fellow, US National Academy of Engineering, Goedel Prize, ACM AAAI Allen Newell Award https://www.ieee.org/membership/fellows/fellows-directory.html https://awards.acm.org/newell https://eatcs.org/index.php/goedel-prize https://www.nae.edu/MembersSection.aspx https://dl.acm.org/conference/podc/authors https://awards.acm.org/fellows/award-winners https://scholar.google.com/citations?hl=en&user=FsBCAfgAAAAJ Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 0 0 1 0 Attendance: OFTEN name: Maurice Herlihy justification: Brown University, USA h-index 70 ACM Fellow, US National Academy of Engineering, Dijkstra Prize twice, Goedel Prize https://www.podc.org/dijkstra/ https://eatcs.org/index.php/goedel-prize https://www.nae.edu/MembersSection.aspx https://dl.acm.org/conference/podc/authors https://awards.acm.org/fellows/award-winners https://scholar.google.com/citations?hl=en&user=Ezrt3pkAAAAJ Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 1 3 0 1 Attendance: ALWAYS name: Leslie Lamport justification: Microsoft Research, USA h-index 80 Turing Award, US National Academy of Engineering, US National Academy of Science, ACM Fellow, IEEE John von Neumann Medal, IEEE Emanuel R. Piore Award, Dijkstra Prize three times https://amturing.acm.org/alphabetical.cfm https://www.podc.org/dijkstra/ https://awards.acm.org/fellows/award-winners https://www.nae.edu/MembersSection.aspx http://www.nasonline.org/member-directory/ https://corporate-awards.ieee.org/recipients/current-recipients/
Load more

Recommended publications
  • James Aspnes
    James Aspnes August 12th, 2021 Work address James Aspnes Yale University Department of Computer Science 39 Willow Road Guilford, CT USA Email: [email protected] URL: https://www.cs.yale.edu/homes/aspnes/ Phone: +1 203 533 9862 Home address 39 Willow Rd Guilford, CT 06437-1723 Degrees • PhD (CS) 1992, Carnegie-Mellon University. Thesis title: Wait-Free Consensus. Advisor: Steven Rudich. • SM (EECS) 1987, Massachusetts Institute of Technology. • SB (Mathematics) 1987, Massachusetts Institute of Technology. Experience • Yale University. Assistant Professor of Computer Science, 1993–1998; Associate Professor of Computer Science (term), 1998–2001; Associate Professor of Computer Science (tenured), 2001–2005; Professor of Com- puter Science, 2005–. • IBM Almaden Research Center. Visiting Scientist, 1992–1993. 1 Honors • ACM-EATCS Dijkstra Prize in Distributed Computing, 2020. • The Dylan Hixon ’88 Prize for Teaching Excellence in the Natural Sci- ences. Awarded by Yale College, 2000. • IBM Graduate Fellowship, 1991–1992. • NSF Graduate Fellowship, 1987–1990. • Phi Beta Kappa, 1987. Grants • NSF award CCF-1650596, EAGER: Concurrent Data Structures, 2016–2020. (PI, $265,044.) • NSF award CCF-1637385, AitF: The Fuzzy Log: A Unifying Abstrac- tion for the Theory and Practice of Distributed Systems, 2016–2019. (Co-PI, $600,000.) • NSF award CCF-0916389, AF: Small: Algorithms for Active Learning of Interaction Networks, 2009–2013. (Co-PI, $500,000.) • NSF award CNS-0435201, NeTS-NR: Design and Evaluation of Multi- homed Networks, 2004–2008. (Co-PI, $349,987.) • NSF award CNS-0305258, Distributed Tree Infrastructure for Peer-to- Peer Systems, 2003–2006. (PI, $300,000.) • NSF award CCR-0098078, Fault-Tolerant Distributed Resource Loca- tion, 2001–2004.
    [Show full text]
  • Distributed Computing Column 52 Annual Review 2013
    Distributed Computing Column 52 Annual Review 2013 Jennifer L. Welch Department of Computer Science and Engineering Texas A&M University, College Station, TX 77843-3112, USA [email protected] This is my inaugural issue as editor of the SIGACT News Distributed Computing Column. I am honored to be asked to take over from Idit Keidar, who has done a wonderful job with the column for the last seven years, obtaining a wide variety of articles that have provided the community with informative news, and leavening it with her sense of humor. I hope to continue to rely on the efforts of the community to share information about our field. As with prior December issues, this issue is devoted to a review of notable events related to distributed computing that occurred during the year. First, congratulations to Nati Linial who received the 2013 Dijkstra Prize for his paper \Lo- cality in Distributed Graph Algorithms"! I have reproduced the citation for his award, which was presented at the International Symposium on Distributed Computing (DISC), illustrated with a photo. Congratulations as well to Shiri Chechik and Danupon Nanongkai, who were awarded the Principles of Distributed Computing Doctoral Dissertation Award! Shiri's dissertation was entitled \Fault-Tolerant Structures in Graphs", while Danupon's was \Graphs and Geometric Algorithms on Distributed Networks and Databases". I have also reproduced their citations; the awards were also given at DISC. Graphs rule! The first invited article is a review of the 2013 ACM Symposium on Principles of Distributed Computing (PODC) by Nicolas Braud-Santoni. Nicolas is the student author of the paper \Fast Byzantine Agreement", which received a Best Student Paper Award; the other authors are Rachid Guerraoui and Florian Huc.
    [Show full text]
  • Dagrep-V007-I011-Complete.Pdf
    Volume 7, Issue 11, November 2017 New Challenges in Parallelism (Dagstuhl Seminar 17451) Annette Bieniusa, Hans-J. Boehm, Maurice Herlihy, and Erez Petrank ........... 1 Algorithmic Cheminformatics (Dagstuhl Seminar 17452) Jakob L. Andersen, Christoph Flamm, Daniel Merkle, and Peter F. Stadler . 28 Connecting Visualization and Data Management Research (Dagstuhl Seminar 17461) Remco Chang, Jean-Daniel Fekete, Juliana Freire, and Carlos E. Scheidegger . 46 A Shared Challenge in Behavioural Specification (Dagstuhl Seminar 17462) Klaus Havelund, Martin Leucker, Giles Reger, and Volker Stolz . 59 Artificial and Computational Intelligence in Games: AI-Driven Game Design (Dagstuhl Seminar 17471) Pieter Spronck, Elisabeth André, Michael Cook, and Mike Preuß . 86 Addressing the Computational Challenges of Personalized Medicine (Dagstuhl Seminar 17472) Niko Beerenwinkel, Holger Fröhlich, and Susan A. Murphy . 130 Reliable Computation and Complexity on the Reals (Dagstuhl Seminar 17481) Norbert T. Müller, Siegfried M. Rump, Klaus Weihrauch, and Martin Ziegler . 142 DagstuhlReports,Vol. 7,Issue11 ISSN2192-5283 ISSN 2192-5283 Published online and open access by Aims and Scope Schloss Dagstuhl – Leibniz-Zentrum für Informatik The periodical Dagstuhl Reports documents the GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, program and the results of Dagstuhl Seminars and Germany. Online available at Dagstuhl Perspectives Workshops. http://www.dagstuhl.de/dagpub/2192-5283 In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that Publication date contains the following: March, 2018 an executive summary of the seminar program and the fundamental results, Bibliographic information published by the Deutsche an overview of the talks given during the seminar Nationalbibliothek (summarized as talk abstracts), and The Deutsche Nationalbibliothek lists this publica- summaries from working groups (if applicable).
    [Show full text]
  • Chicago Journal of Theoretical Computer Science the MIT Press
    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 1 12 March 1997 ISSN 1073–0486. MIT Press Journals, 55 Hayward St., Cambridge, MA 02142 USA; (617)253-2889; [email protected], [email protected]. Published one article at a time in LATEX source form on the Internet. Pag- ination varies from copy to copy. For more information and other articles see: http://www-mitpress.mit.edu/jrnls-catalog/chicago.html • http://www.cs.uchicago.edu/publications/cjtcs/ • ftp://mitpress.mit.edu/pub/CJTCS • ftp://cs.uchicago.edu/pub/publications/cjtcs • Feige and Kilian Limited vs. Polynomial Nondeterminism (Info) The Chicago Journal of Theoretical Computer Science is abstracted or in- R R R dexed in Research Alert, SciSearch, Current Contents /Engineering Com- R puting & Technology, and CompuMath Citation Index. c 1997 The Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal’s World Wide Web site for further details. Address inquiries to the Subsidiary Rights Manager, MIT Press Journals; (617)253-2864; [email protected]. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for significant results on theoretical aspects of all topics in computer science. Editor in chief: Janos Simon Consulting
    [Show full text]
  • Sok: Tools for Game Theoretic Models of Security for Cryptocurrencies
    SoK: Tools for Game Theoretic Models of Security for Cryptocurrencies Sarah Azouvi Alexander Hicks Protocol Labs University College London University College London Abstract form of mining rewards, suggesting that they could be prop- erly aligned and avoid traditional failures. Unfortunately, Cryptocurrencies have garnered much attention in recent many attacks related to incentives have nonetheless been years, both from the academic community and industry. One found for many cryptocurrencies [45, 46, 103], due to the interesting aspect of cryptocurrencies is their explicit consid- use of lacking models. While many papers aim to consider eration of incentives at the protocol level, which has motivated both standard security and game theoretic guarantees, the vast a large body of work, yet many open problems still exist and majority end up considering them separately despite their current systems rarely deal with incentive related problems relation in practice. well. This issue arises due to the gap between Cryptography Here, we consider the ways in which models in Cryptog- and Distributed Systems security, which deals with traditional raphy and Distributed Systems (DS) can explicitly consider security problems that ignore the explicit consideration of in- game theoretic properties and incorporated into a system, centives, and Game Theory, which deals best with situations looking at requirements based on existing cryptocurrencies. involving incentives. With this work, we offer a systemati- zation of the work that relates to this problem, considering papers that blend Game Theory with Cryptography or Dis- Methodology tributed systems. This gives an overview of the available tools, and we look at their (potential) use in practice, in the context As we are covering a topic that incorporates many different of existing blockchain based systems that have been proposed fields coming up with an extensive list of papers would have or implemented.
    [Show full text]
  • Chicago Journal of Theoretical Computer Science the MIT Press
    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1997, Article 2 3 June 1997 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; [email protected], [email protected]. Published one article at a time in LATEX source form on the Internet. Pag- ination varies from copy to copy. For more information and other articles see: http://www-mitpress.mit.edu/jrnls-catalog/chicago.html • http://www.cs.uchicago.edu/publications/cjtcs/ • ftp://mitpress.mit.edu/pub/CJTCS • ftp://cs.uchicago.edu/pub/publications/cjtcs • Kann et al. Hardness of Approximating Max k-Cut (Info) The Chicago Journal of Theoretical Computer Science is abstracted or in- R R R dexed in Research Alert, SciSearch, Current Contents /Engineering Com- R puting & Technology, and CompuMath Citation Index. c 1997 The Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal’s World Wide Web site for further details. Address inquiries to the Subsidiary Rights Manager, MIT Press Journals; (617)253-2864; [email protected]. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for significant results on theoretical aspects of all topics in computer science. Editor in chief: Janos Simon Consulting
    [Show full text]
  • Combinatorial Topology and Distributed Computing Copyright 2010 Herlihy, Kozlov, and Rajsbaum All Rights Reserved
    Combinatorial Topology and Distributed Computing Copyright 2010 Herlihy, Kozlov, and Rajsbaum All rights reserved Maurice Herlihy Dmitry Kozlov Sergio Rajsbaum February 22, 2011 DRAFT 2 DRAFT Contents 1 Introduction 9 1.1 DecisionTasks .......................... 10 1.2 Communication.......................... 11 1.3 Failures .............................. 11 1.4 Timing............................... 12 1.4.1 ProcessesandProtocols . 12 1.5 ChapterNotes .......................... 14 2 Elements of Combinatorial Topology 15 2.1 Theobjectsandthemaps . 15 2.1.1 The Combinatorial View . 15 2.1.2 The Geometric View . 17 2.1.3 The Topological View . 18 2.2 Standardconstructions. 18 2.3 Chromaticcomplexes. 21 2.4 Simplicial models in Distributed Computing . 22 2.5 ChapterNotes .......................... 23 2.6 Exercises ............................. 23 3 Manifolds, Impossibility,DRAFT and Separation 25 3.1 ManifoldComplexes ....................... 25 3.2 ImmediateSnapshots. 28 3.3 ManifoldProtocols .. .. .. .. .. .. .. 34 3.4 SetAgreement .......................... 34 3.5 AnonymousProtocols . .. .. .. .. .. .. 38 3.6 WeakSymmetry-Breaking . 39 3.7 Anonymous Set Agreement versus Weak Symmetry Breaking 40 3.8 ChapterNotes .......................... 44 3.9 Exercises ............................. 44 3 4 CONTENTS 4 Connectivity 47 4.1 Consensus and Path-Connectivity . 47 4.2 Consensus in Asynchronous Read-Write Memory . 49 4.3 Set Agreement and Connectivity in Higher Dimensions . 53 4.4 Set Agreement and Read-Write memory . 59 4.4.1 Critical States . 63 4.5 ChapterNotes .......................... 64 4.6 Exercises ............................. 64 5 Colorless Tasks 67 5.1 Pseudospheres .......................... 68 5.2 ColorlessTasks .......................... 72 5.3 Wait-Free Read-Write Memory . 73 5.3.1 Read-Write Protocols and Pseudospheres . 73 5.3.2 Necessary and Sufficient Conditions . 75 5.4 Read-Write Memory with k-Set Agreement .
    [Show full text]
  • Download This PDF File
    T G¨ P 2012 C N Deadline: December 31, 2011 The Gödel Prize for outstanding papers in the area of theoretical computer sci- ence is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery, Special Inter- est Group on Algorithms and Computation Theory (ACM-SIGACT). The award is presented annually, with the presentation taking place alternately at the Inter- national Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The 20th prize will be awarded at the 39th International Colloquium on Automata, Languages, and Pro- gramming to be held at the University of Warwick, UK, in July 2012. The Prize is named in honor of Kurt Gödel in recognition of his major contribu- tions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous P versus NP question. The Prize includes an award of USD 5000. AWARD COMMITTEE: The winner of the Prize is selected by a committee of six members. The EATCS President and the SIGACT Chair each appoint three members to the committee, to serve staggered three-year terms. The committee is chaired alternately by representatives of EATCS and SIGACT. The 2012 Award Committee consists of Sanjeev Arora (Princeton University), Josep Díaz (Uni- versitat Politècnica de Catalunya), Giuseppe Italiano (Università a˘ di Roma Tor Vergata), Mogens Nielsen (University of Aarhus), Daniel Spielman (Yale Univer- sity), and Eli Upfal (Brown University). ELIGIBILITY: The rule for the 2011 Prize is given below and supersedes any di fferent interpretation of the parametric rule to be found on websites on both SIGACT and EATCS.
    [Show full text]
  • 1 Personal Data 2 Education 3 Research Interests 4 Academic Appointments
    CURRICULUM VITAE HAGIT ATTIYA Department of Computer Science, Technion Haifa 32000, ISRAEL (Updated: January 2021) 1 Personal Data Date and place of birth: February 16, 1962, Jerusalem, Israel. Israeli citizenship (I.d. # 5739025-4). Telephone: +972-4-8294365 [email protected] http://www.cs.technion.ac.il/˜hagit/ 2 Education • Ph.D. in Computer Science. Hebrew University, July 1987. • M.Sc. in Computer Science, cum laude. Hebrew University, June 1983. • B.Sc. in Mathematics (expanded) and Computer Science, cum laude. Hebrew University, June 1981. 3 Research Interests Distributed and parallel computing: synchronization primitives, fault-tolerance, agreement problems, ran- domization, timing-based algorithms; transactional memory; packet switches; performance analysis of dis- tributed servers. 4 Academic Appointments October 2015–September 2019: Executive Vice President for Academic Affairs, the Technion. August 2005–present: Professor, The Harry W. Labov and Charlotte Ullman Labov Academic Chair, Faculty of Computer Science, Technion. February 1997–July 2005: Associate Professor, Faculty of Computer Science, Technion. October 1990–February 1997: Senior lecturer (tenure: May 1994), Faculty of Computer Science, Technion. 1 September 1988–September 1990: Postdoctoral research associate with the Theory of Distributed Systems research group at the Laboratory for Computer Science, M.I.T. October 1987–August 1988: Instructor, Department of Computer Science, Tel-Aviv University. October 1983–September 1986: Research assistant, Department of Computer Science, Hebrew University. October 1981–September 1983: Teaching assistant, Department of Computer Science, Hebrew University. 5 Other Professional Employment August 2009–August 2010: Visiting professor at the Ecole´ Polytechnique Fed´ erale´ de Lausanne (EPFL), Switzerland. September 2001–September 2002: Research scientist at Dune Semiconductor Ltd.
    [Show full text]
  • Tight Bounds for K-Set Agreement Soma Chaudhuri Maurice Herlihy CRL 98/4 Nancy A
    TM Tight Bounds for k-Set Agreement Soma Chaudhuri Maurice Herlihy Nancy A. Lynch Mark R. Tuttle CRL 98/4 May 1998 Cambridge Research Laboratory The Cambridge Research Laboratory was founded in 1987 to advance the state of the art in both core computing and human-computerinteraction, and to use the knowledge so gained to support the Company’s corporate objectives. We believe this is best accomplished through interconnected pur- suits in technology creation, advanced systems engineering, and business development. We are ac- tively investigating scalable computing; mobile computing; vision-based human and scene sensing; speech interaction; computer-animated synthetic persona; intelligent information appliances; and the capture, coding, storage, indexing, retrieval, decoding, and rendering of multimedia data. We recognize and embrace a technology creation model which is characterized by three major phases: Freedom: The life blood of the Laboratory comes from the observations and imaginations of our research staff. It is here that challenging research problems are uncovered (through discussions with customers, through interactions with others in the Corporation, through other professional interac- tions, through reading, and the like) or that new ideas are born. For any such problem or idea, this phase culminates in the nucleation of a project team around a well articulated central research question and the outlining of a research plan. Focus: Once a team is formed, we aggressively pursue the creation of new technology based on the plan. This may involve direct collaboration with other technical professionals inside and outside the Corporation. This phase culminates in the demonstrable creation of new technology which may take any of a number of forms - a journal article, a technical talk, a working prototype, a patent application, or some combination of these.
    [Show full text]
  • A Complexity-Based Hierarchy for Multiprocessor Synchronization
    A Complexity-Based Hierarchy for Multiprocessor Synchronization Faith Ellen Rati Gelashvili Nir Shavit University of Toronto MIT MIT [email protected] [email protected] [email protected] Leqi Zhu University of Toronto [email protected] Abstract For many years, Herlihy’s elegant computability-based Consensus Hierarchy has been our best ex- planation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the real-world, where multiprocessor programs apply syn- chronization instructions to collections of arbitrary memory locations. We were surprised to realize that, when considering instructions applied to memory locations, the computability based hierarchy collapses. This leaves open the question of how to better capture the power of various synchronization instructions. In this paper, we provide an approach to answering this question. We present a hierarchy of synchro- nization instructions, classified by the space complexity necessary to solve consensus in an obstruction- free manner using these instructions. Our hierarchy provides a classification of combinations of known instructions that seems to fit with our intuition of how useful some are in practice, while questioning the effectiveness of others. In particular, we prove an essentially tight characterization of the power of buffered read and write instructions. Interestingly, we show a similar result for multi-location atomic assignments. 1 Introduction Herlihy’s Consensus Hierarchy [Her91] assigns a consensus number to each object, namely, the number of processes for which there is a wait-free binary consensus algorithm using only instances of this object and read-write registers.
    [Show full text]
  • Chicago Journal of Theoretical Computer Science the MIT Press
    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1998, Article 2 16 March 1998 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, MA 02142-1493 USA; (617)253-2889; [email protected], [email protected]. Published one article at a time in LATEX source form on the Internet. Pag- ination varies from copy to copy. For more information and other articles see: http://mitpress.mit.edu/CJTCS/ • http://www.cs.uchicago.edu/publications/cjtcs/ • ftp://mitpress.mit.edu/pub/CJTCS • ftp://cs.uchicago.edu/pub/publications/cjtcs • Kupferman and Vardi Verification of Systems (Info) The Chicago Journal of Theoretical Computer Science is abstracted or in- R R R dexed in Research Alert, SciSearch, Current Contents /Engineering Com- R puting & Technology, and CompuMath Citation Index. c 1998 The Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal’s World Wide Web site for further details. Address inquiries to the Subsidiary Rights Manager, MIT Press Journals; (617)253-2864; [email protected]. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer science. The journal is committed to providing a forum for significant results on theoretical aspects of all topics in computer science. Editor in chief: Janos Simon Consulting editors: Joseph Halpern,
    [Show full text]