DOCSLIB.ORG

Submission Data for 2020-2021 CORE Conference Ranking Process International Colloquium on Automata Languages and Programming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Submission Data for 2020-2021 CORE Conference Ranking Process International Colloquium on Automata Languages and Programming Submission Data for 2020-2021 CORE conference Ranking process International Colloquium on Automata Languages and Programming Anca Muscholl, Artur Czumaj Conference Details Conference Title: International Colloquium on Automata Languages and Programming Acronym : ICALP Rank: A Requested Rank Rank: A* Recent Years Proceedings Publishing Style Proceedings Publishing: series Link to most recent proceedings: https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16154 Further details: ICALP proceedings have been published since 2015 in the high-quality open-access series LIPIcs (Leibniz International Proceedings in Informatics), in cooperation with Schloss Dagstuhl-Leibniz Center for Informatics. Until 2015 ICALP proceedings were published with LNCS. Most Recent Years Most Recent Year Year: 2019 URL: https://icalp2019.upatras.gr/ Location: Patras, Greece Papers submitted: 502 Papers published: 147 Acceptance rate: 29 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/2019/10576/pdf/LIPIcs-ICALP-2019-0.pdf General Chairs Name: Christos Zaroliagis Affiliation: Univ. of Patras, Greece Gender: M H Index: 28 GScholar url: https://scholar.google.com/citations?hl=en&user=L3AQ8wkAAAAJ DBLP url: https://dblp.org/pid/z/CDZaroliagis.html Name: Sotiris Nicoletseas Affiliation: Univ. of Patras, Greece Gender: SELECT H Index: 40 GScholar url: https://scholar.google.com/citations?hl=en&user=hk2ylNwAAAAJ DBLP url: https://dblp.org/pid/n/SotirisENikoletseas.html Program Chairs 1 Name: Stefano Leonardi Affiliation: Sapienza University of Rome, Italy Gender: M H Index: 44 GScholar url: https://scholar.google.com/citations?hl=en&user=p5LCHHEAAAAJ DBLP url: https://dblp.org/pid/l/StefanoLeonardi.html Name: Christel Baier Affiliation: TU Dresden, Germany Gender: F H Index: 49 GScholar url: https://scholar.google.com/citations?user=p8sX7r0AAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/b/ChristelBaier.html Name: Paola Flocchini Affiliation: Univ. of Ottawa, Canada Gender: F H Index: 47 GScholar url: https://scholar.google.com/citations?hl=en&user=LVdJjiUAAAAJ DBLP url: https://dblp.org/pid/96/778.html Second Most Recent Year Year: 2018 URL: https://iuuk.mff.cuni.cz/events/icalp2018/ Location: Prague, Czech Republic Papers submitted: 502 Papers published: 147 Acceptance rate: 29 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/2018/9004/pdf/LIPIcs-ICALP-2018-0.pdf General Chairs Name: Jiri Sgall Affiliation: Charles University Prague, Czech Rep. Gender: M H Index: 36 GScholar url: https://scholar.google.com/citations?hl=en&user=5XzFcZoAAAAJ DBLP url: https://dblp.org/pid/s/JiriSgall.html Program Chairs Name: Daniel Marx Affiliation: Max Planck Institute, SaarbrÃijcken, Germany Gender: M H Index: 45 GScholar url: https://scholar.google.com/citations?hl=en&user=hY2ibr8AAAAJ DBLP url: https://dblp.org/pid/95/1832.html Name: Don Sannella Affiliation: Univ. of Edinburgh, UK Gender: M H Index: 37 GScholar url: https://scholar.google.com/citations?hl=en&user=XQNrpksAAAAJ DBLP url: https://dblp.org/pid/s/DonaldSannella.html Name: Christos Kaklamanis Affiliation: Univ. of Patras, Greece Gender: M H Index: 29 GScholar url: https://scholar.google.com/citations?hl=en&user=sPYDnEYAAAAJ DBLP url: https://dblp.org/pid/k/ChristosKaklamanis.html Third Most Recent Year Year: 2017 URL: http://icalp17.mimuw.edu.pl/ Location: Warsaw, Poland Papers submitted: 459 Papers published: 137 Acceptance rate: 30 Source for numbers: https://drops.dagstuhl.de/opus/volltexte/2017/7366/pdf/LIPIcs-ICALP-2017-0.pdf 2 General Chairs Name: Piotr Sankowski Affiliation: Univ. of Warsaw, Poland Gender: M H Index: 27 GScholar url: https://scholar.google.com/citations?hl=en&user=-5LVg-0AAAAJ DBLP url: https://dblp.org/pid/80/4282.html Program Chairs Name: Piotr Indyk Affiliation: MIT, US Gender: M H Index: 75 GScholar url: https://scholar.google.com/citations?hl=en&user=oOwNKsAAAAAJ DBLP url: https://dblp.org/pid/i/PiotrIndyk.html Name: Anca Muscholl Affiliation: Univ. of Bordeaux, France Gender: F H Index: 29 GScholar url: https://scholar.google.com/citations?hl=en&user=79E_MpkAAAAJ DBLP url: https://dblp.org/pid/m/AMuscholl.html Name: Fabian Kuhn Affiliation: Univ. of Freiburg, Germany Gender: M H Index: 42 GScholar url: https://scholar.google.com/citations?hl=en&user=XU-ldxMAAAAJ DBLP url: https://dblp.org/pid/26/5426.html Policies Chair Selection: The programme chairs of the ICALP tracks are selected by the ICALP Steering Committee. The main criterium is high scientific reputation of the chairs and good coverage of the broad TCS spectrum of ICALP. Policy name: Committee on Publication Ethics (COPE) Policy url: https://publicationethics.org/ Policy name: Code of conduct to combat harassment and discrimination in the Theory of Computing Community Policy url: https://eatcs.org/ (Senior) Program Committee Link to (s)pc: https://icalp2019.upatras.gr/conference.php#ele-5 File: http://portal.core.edu.au/core/media/conf_submissions_spc_file/PC2019_0pVRshn.txt H-index plot: http://portal.core.edu.au/core/media/conf_submissions_hindex_plots/hindex_buckets_1292.png Information Contained within this graph is derived using the Elsevier Scopus Database 2021. 3 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: 7 Image of top 20: http://portal.core.edu.au/core/media/changes_h5/higherrank1292_gscholar_minh5.png 4 h5-index for this conference: 32 ACM Metrics Not Sponsored by ACM Aminer Rank Not Listed in Aminer Other Rankings URL: http://www.conferenceranks.com/ Description: ERA 2010 ranks A;B;C Rank: A URL: http://www.conferenceranks.com/ Description: QUALIS 2012 ranks A1;A2;B1;B2;B3;B4;B5 Rank: A1 Conferences in area: FOCS, STOC ICALP, LICS, SODA Top People Publishing Here name: Fedor V. Fomin justification: h-index 56 Recipient of ERC (European Research Council) Advanced Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=fomin The ERC Advanced Grants are highly competitive (there between 3 and 5 such grants in the research areas covered by ICALP). Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 3 1 3 0 Attendance: ALWAYS name: Leslie Ann Goldberg justification: h-index 37 Recipient of ERC (European Research Council) Advanced Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=goldberg The ERC Advanced Grants are highly competitive (there between 3 and 5 such grants in the research areas covered by ICALP). Head of department University of Oxford (2021–) Paper counts: 5 Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 1 0 2 3 Attendance: ALWAYS name: Mikolaj Bojanczyk justification: h-index 29 Recipient of ERC (European Research Council) Starting Grant and Consolidator Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=bojanczyk Recipient of EATCS Presburger award https://eatcs.org/index.php/presburger Most frequent SIGLOG News author https://dl.acm.org/newsletter/siglog/authors Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 1 0 3 1 Attendance: OFTEN name: Daniel Lokshtanov justification: h-index 44 Recipient of ERC (European Research Council) Starting Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=lokshtanov Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 4 2 3 1 Attendance: OFTEN name: Saket Saurabh justification: h-index 47 Recipient of ERC (European Research Council) Starting Grant and Consolidator Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=saurabh Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 4 2 3 1 Attendance: OFTEN name: Anupam Gupta justification: h-index 55 NSF CAREER Alfred P. Sloan Research Fellowship https://www.aminer.cn/profile/anupam-gupta/53f442b4dabfaeb22f4b249d Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 3 3 0 1 Attendance: SOMETIMES name: Mohammad Taghi Hajiaghayi justification: h-index 60 ACM Fellow https://dl.acm.org/profile/81492647790 Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 0 2 1 3 Attendance: SOMETIMES name: JoÃńl Ouaknine justification: h-index 40 Recipient of Salomaa Prize 2020 https://math.utu.fi/salomaaprize/ Recipient of Roger Needham Award 2010 Recipient of ERC (European Research Council) Consolidator Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=ouaknine Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 1 2 1 1 2 Attendance: SOMETIMES name: Monika Henzinger justification: h-index 67 Recipient of ERC (European Research Council) Advanced Grant https://erc.europa.eu/projects-figures/erc-funded-projects/results?search_api_views_fulltext=henzinger STOC 2018 PC chair Carus Medal https://www.leopoldina.org/en/about-us/distinctions-of-the-academy/medals/carus-medal/ ACM Fellow https://dl.acm.org/profile/81100031872 Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 1 0 1 1 Attendance: SOMETIMES name: Mihalis Yannakakis 6 justification: h-index
Load more

Recommended publications
  • Tarjan Transcript Final with Timestamps
    A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated.
    [Show full text]
  • How Easy Is Local Search?
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES 37, 79-100 (1988) How Easy Is Local Search? DAVID S. JOHNSON AT & T Bell Laboratories, Murray Hill, New Jersey 07974 CHRISTOS H. PAPADIMITRIOU Stanford University, Stanford, California and National Technical University of Athens, Athens, Greece AND MIHALIS YANNAKAKIS AT & T Bell Maboratories, Murray Hill, New Jersey 07974 Received December 5, 1986; revised June 5, 1987 We investigate the complexity of finding locally optimal solutions to NP-hard com- binatorial optimization problems. Local optimality arises in the context of local search algorithms, which try to find improved solutions by considering perturbations of the current solution (“neighbors” of that solution). If no neighboring solution is better than the current solution, it is locally optimal. Finding locally optimal solutions is presumably easier than finding optimal solutions. Nevertheless, many popular local search algorithms are based on neighborhood structures for which locally optimal solutions are not known to be computable in polynomial time, either by using the local search algorithms themselves or by taking some indirect route. We define a natural class PLS consisting essentially of those local search problems for which local optimality can be verified in polynomial time, and show that there are complete problems for this class. In particular, finding a partition of a graph that is locally optimal with respect to the well-known Kernighan-Lin algorithm for graph partitioning is PLS-complete, and hence can be accomplished in polynomial time only if local optima can be found in polynomial time for all local search problems in PLS. 0 1988 Academic Press, Inc. 1.
    [Show full text]
  • Qualitative and Quantitative Security Analyses for Zigbee Wireless Sensor Networks
    Downloaded from orbit.dtu.dk on: Sep 27, 2018 Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming Publication date: 2011 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Yuksel, E., Nielson, H. R., & Nielson, F. (2011). Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks. Kgs. Lyngby, Denmark: Technical University of Denmark (DTU). (IMM-PHD-2011; No. 247). General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Qualitative and Quantitative Security Analyses for ZigBee Wireless Sensor Networks Ender Y¨uksel Kongens Lyngby 2011 IMM-PHD-2011-247 Technical University of Denmark Informatics and Mathematical Modelling Building 321, DK-2800 Kongens Lyngby, Denmark Phone +45 45253351, Fax +45 45882673 [email protected] www.imm.dtu.dk IMM-PHD: ISSN 0909-3192 Summary Wireless sensor networking is a challenging and emerging technology that will soon become an inevitable part of our modern society.
    [Show full text]
  • Conformance Testing David Lee and Mihalis Yannakakis Bell
    Conformance Testing David Lee and Mihalis Yannakakis Bell Laboratories, Lucent Technologies 600 Mountain Avenue, RM 2C-423 Murray Hill, NJ 07974 - 2 - System reliability can not be overemphasized in software engineering as large and complex systems are being built to fulfill complicated tasks. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. Testing software contains very wide fields with an extensive literature. See the articles in this volume. We discuss testing of software systems that can be modeled by finite state machines or their extensions to ensure that the implementation conforms to the design. A finite state machine contains a finite number of states and produces outputs on state transitions after receiving inputs. Finite state machines are widely used to model software systems such as communication protocols. In a testing problem we have a specification machine, which is a design of a system, and an implementation machine, which is a ‘‘black box’’ for which we can only observe its I/O behavior. The task is to test whether the implementation conforms to the specification. This is called the conformance testing or fault detection problem. A test sequence that solves this problem is called a checking sequence. Testing finite state machines has been studied for a very long time starting with Moore’s seminal 1956 paper on ‘‘gedanken-experiments’’ (31), which introduced the basic framework for testing problems. Among other fundamental problems, Moore posed the conformance testing problem, proposed an approach, and asked for a better solution.
    [Show full text]
  • Xi Chen: Curriculum Vitae
    Xi Chen Associate Professor Phone: 1-212-939-7136 Department of Computer Science Email: [email protected] Columbia University Homepage: http://www.cs.columbia.edu/∼xichen New York, NY 10027 Date of Preparation: March 12, 2016 Research Interests Theoretical Computer Science, including Algorithmic Game Theory and Economics, Complexity Theory, Graph Isomorphism Testing, and Property Testing. Academic Training B.S. Physics / Mathematics, Tsinghua University, Sep 1999 { Jul 2003 Ph.D. Computer Science, Tsinghua University, Sep 2003 { Jul 2007 Advisor: Professor Bo Zhang, Tsinghua University Thesis Title: The Complexity of Two-Player Nash Equilibria Academic Positions Associate Professor (with tenure), Columbia University, Mar 2016 { Now Associate Professor (without tenure), Columbia University, Jul 2015 { Mar 2016 Assistant Professor, Columbia University, Jan 2011 { Jun 2015 Postdoctoral Researcher, Columbia University, Aug 2010 { Dec 2010 Postdoctoral Researcher, University of Southern California, Aug 2009 { Aug 2010 Postdoctoral Researcher, Princeton University, Aug 2008 { Aug 2009 Postdoctoral Researcher, Institute for Advanced Study, Sep 2007 { Aug 2008 Honors and Awards SIAM Outstanding Paper Award, 2016 EATCS Presburger Award, 2015 Alfred P. Sloan Research Fellowship, 2012 NSF CAREER Award, 2012 Best Paper Award The 4th International Frontiers of Algorithmics Workshop, 2010 Best Paper Award The 20th International Symposium on Algorithms and Computation, 2009 Xi Chen 2 Silver Prize, New World Mathematics Award (Ph.D. Thesis) The 4th International Congress of Chinese Mathematicians, 2007 Best Paper Award The 47th Annual IEEE Symposium on Foundations of Computer Science, 2006 Grants Current, Natural Science Foundation, Title: On the Complexity of Optimal Pricing and Mechanism Design, Period: Aug 2014 { Jul 2017, Amount: $449,985.
    [Show full text]
  • Distance-Sensitive Hashing∗
    Distance-Sensitive Hashing∗ Martin Aumüller Tobias Christiani IT University of Copenhagen IT University of Copenhagen [email protected] [email protected] Rasmus Pagh Francesco Silvestri IT University of Copenhagen University of Padova [email protected] [email protected] ABSTRACT tight up to lower order terms. In particular, we extend existing Locality-sensitive hashing (LSH) is an important tool for managing LSH lower bounds, showing that they also hold in the asymmetric high-dimensional noisy or uncertain data, for example in connec- setting. tion with data cleaning (similarity join) and noise-robust search (similarity search). However, for a number of problems the LSH CCS CONCEPTS framework is not known to yield good solutions, and instead ad hoc • Theory of computation → Randomness, geometry and dis- solutions have been designed for particular similarity and distance crete structures; Data structures design and analysis; • Informa- measures. For example, this is true for output-sensitive similarity tion systems → Information retrieval; search/join, and for indexes supporting annulus queries that aim to report a point close to a certain given distance from the query KEYWORDS point. locality-sensitive hashing; similarity search; annulus query In this paper we initiate the study of distance-sensitive hashing (DSH), a generalization of LSH that seeks a family of hash functions ACM Reference Format: Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Francesco Silvestri. such that the probability of two points having the same hash value is 2018. Distance-Sensitive Hashing. In Proceedings of 2018 International Confer- a given function of the distance between them. More precisely, given ence on Management of Data (PODS’18).
    [Show full text]
  • Arxiv:2102.08942V1 [Cs.DB]
    A Survey on Locality Sensitive Hashing Algorithms and their Applications OMID JAFARI, New Mexico State University, USA PREETI MAURYA, New Mexico State University, USA PARTH NAGARKAR, New Mexico State University, USA KHANDKER MUSHFIQUL ISLAM, New Mexico State University, USA CHIDAMBARAM CRUSHEV, New Mexico State University, USA Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular techniques for finding approximate nearest neighbor searches in high-dimensional spaces. The main benefits of LSH are its sub-linear query performance and theoretical guarantees on the query accuracy. In this survey paper, we provide a review of state-of-the-art LSH and Distributed LSH techniques. Most importantly, unlike any other prior survey, we present how Locality Sensitive Hashing is utilized in different application domains. CCS Concepts: • General and reference → Surveys and overviews. Additional Key Words and Phrases: Locality Sensitive Hashing, Approximate Nearest Neighbor Search, High-Dimensional Similarity Search, Indexing 1 INTRODUCTION Finding nearest neighbors in high-dimensional spaces is an important problem in several diverse applications, such as multimedia retrieval, machine learning, biological and geological sciences, etc. For low-dimensions (< 10), popular tree-based index structures, such as KD-tree [12], SR-tree [56], etc. are effective, but for higher number of dimensions, these index structures suffer from the well-known problem, curse of dimensionality (where the performance of these index structures is often out-performed even by linear scans) [21]. Instead of searching for exact results, one solution to address the curse of dimensionality problem is to look for approximate results.
    [Show full text]
  • Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University
    Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University. Linda A. Cicero/Stanford News Service. Whitfield Diffie Martin E. Hellman ernment–private sector relations, and attracts billions of Whitfield Diffie, former chief security officer of Sun Mi- dollars in research and development,” said ACM President crosystems, and Martin E. Hellman, professor emeritus Alexander L. Wolf. “In 1976, Diffie and Hellman imagined of electrical engineering at Stanford University, have been a future where people would regularly communicate awarded the 2015 A. M. Turing Award of the Association through electronic networks and be vulnerable to having for Computing Machinery for their critical contributions their communications stolen or altered. Now, after nearly to modern cryptography. forty years, we see that their forecasts were remarkably Citation prescient.” The ability for two parties to use encryption to commu- “Public-key cryptography is fundamental for our indus- nicate privately over an otherwise insecure channel is try,” said Andrei Broder, Google Distinguished Scientist. fundamental for billions of people around the world. On “The ability to protect private data rests on protocols for a daily basis, individuals establish secure online connec- confirming an owner’s identity and for ensuring the integ- tions with banks, e-commerce sites, email servers, and the rity and confidentiality of communications. These widely cloud. Diffie and Hellman’s groundbreaking 1976 paper, used protocols were made possible through the ideas and “New Directions in Cryptography,” introduced the ideas of methods pioneered by Diffie and Hellman.” public-key cryptography and digital signatures, which are Cryptography is a practice that facilitates communi- the foundation for most regularly used security protocols cation between two parties so that the communication on the Internet today.
    [Show full text]
  • SIGMOD Flyer
    DATES: Research paper SIGMOD 2006 abstracts Nov. 15, 2005 Research papers, 25th ACM SIGMOD International Conference on demonstrations, Management of Data industrial talks, tutorials, panels Nov. 29, 2005 June 26- June 29, 2006 Author Notification Feb. 24, 2006 Chicago, USA The annual ACM SIGMOD conference is a leading international forum for database researchers, developers, and users to explore cutting-edge ideas and results, and to exchange techniques, tools, and experiences. We invite the submission of original research contributions as well as proposals for demonstrations, tutorials, industrial presentations, and panels. We encourage submissions relating to all aspects of data management defined broadly and particularly ORGANIZERS: encourage work that represent deep technical insights or present new abstractions and novel approaches to problems of significance. We especially welcome submissions that help identify and solve data management systems issues by General Chair leveraging knowledge of applications and related areas, such as information retrieval and search, operating systems & Clement Yu, U. of Illinois storage technologies, and web services. Areas of interest include but are not limited to: at Chicago • Benchmarking and performance evaluation Vice Gen. Chair • Data cleaning and integration Peter Scheuermann, Northwestern Univ. • Database monitoring and tuning PC Chair • Data privacy and security Surajit Chaudhuri, • Data warehousing and decision-support systems Microsoft Research • Embedded, sensor, mobile databases and applications Demo. Chair Anastassia Ailamaki, CMU • Managing uncertain and imprecise information Industrial PC Chair • Peer-to-peer data management Alon Halevy, U. of • Personalized information systems Washington, Seattle • Query processing and optimization Panels Chair Christian S. Jensen, • Replication, caching, and publish-subscribe systems Aalborg University • Text search and database querying Tutorials Chair • Semi-structured data David DeWitt, U.
    [Show full text]
  • Curriculum Vitae
    Massachusetts Institute of Technology School of Engineering Faculty Personnel Record Date: April 1, 2020 Full Name: Charles E. Leiserson Department: Electrical Engineering and Computer Science 1. Date of Birth November 10, 1953 2. Citizenship U.S.A. 3. Education School Degree Date Yale University B. S. (cum laude) May 1975 Carnegie-Mellon University Ph.D. Dec. 1981 4. Title of Thesis for Most Advanced Degree Area-Efficient VLSI Computation 5. Principal Fields of Interest Analysis of algorithms Caching Compilers and runtime systems Computer chess Computer-aided design Computer network architecture Digital hardware and computing machinery Distance education and interaction Fast artificial intelligence Leadership skills for engineering and science faculty Multicore computing Parallel algorithms, architectures, and languages Parallel and distributed computing Performance engineering Scalable computing systems Software performance engineering Supercomputing Theoretical computer science MIT School of Engineering Faculty Personnel Record — Charles E. Leiserson 2 6. Non-MIT Experience Position Date Founder, Chairman of the Board, and Chief Technology Officer, Cilk Arts, 2006 – 2009 Burlington, Massachusetts Director of System Architecture, Akamai Technologies, Cambridge, 1999 – 2001 Massachusetts Shaw Visiting Professor, National University of Singapore, Republic of 1995 – 1996 Singapore Network Architect for Connection Machine Model CM-5 Supercomputer, 1989 – 1990 Thinking Machines Programmer, Computervision Corporation, Bedford, Massachusetts 1975
    [Show full text]
  • Lower Bounds on Lattice Sieving and Information Set Decoding
    Lower bounds on lattice sieving and information set decoding Elena Kirshanova1 and Thijs Laarhoven2 1Immanuel Kant Baltic Federal University, Kaliningrad, Russia [email protected] 2Eindhoven University of Technology, Eindhoven, The Netherlands [email protected] April 22, 2021 Abstract In two of the main areas of post-quantum cryptography, based on lattices and codes, nearest neighbor techniques have been used to speed up state-of-the-art cryptanalytic algorithms, and to obtain the lowest asymptotic cost estimates to date [May{Ozerov, Eurocrypt'15; Becker{Ducas{Gama{Laarhoven, SODA'16]. These upper bounds are useful for assessing the security of cryptosystems against known attacks, but to guarantee long-term security one would like to have closely matching lower bounds, showing that improvements on the algorithmic side will not drastically reduce the security in the future. As existing lower bounds from the nearest neighbor literature do not apply to the nearest neighbor problems appearing in this context, one might wonder whether further speedups to these cryptanalytic algorithms can still be found by only improving the nearest neighbor subroutines. We derive new lower bounds on the costs of solving the nearest neighbor search problems appearing in these cryptanalytic settings. For the Euclidean metric we show that for random data sets on the sphere, the locality-sensitive filtering approach of [Becker{Ducas{Gama{Laarhoven, SODA 2016] using spherical caps is optimal, and hence within a broad class of lattice sieving algorithms covering almost all approaches to date, their asymptotic time complexity of 20:292d+o(d) is optimal. Similar conditional optimality results apply to lattice sieving variants, such as the 20:265d+o(d) complexity for quantum sieving [Laarhoven, PhD thesis 2016] and previously derived complexity estimates for tuple sieving [Herold{Kirshanova{Laarhoven, PKC 2018].
    [Show full text]
  • Finding Rising Stars in Co-Author Networks Via Weighted Mutual Influence
    Finding Rising Stars in Co-Author Networks via Weighted Mutual Influence Ali Daud a,b Naif Radi Aljohani a Rabeeh Ayaz Abbasi a,c a Faculty of Computing and a Faculty of Computing and c Department of Computer Science, Information Technology, King Information Technology, King Quaid-i-Azam University, Islamabad, Abdulaziz University, Jeddah, Saudi Abdulaziz University, Jeddah, Saudi Pakistan Arabia Arabia [email protected] [email protected] [email protected] b b d Zahid Rafique Tehmina Amjad Hussain Dawood b Department of Computer Science b Department of Computer Science d Faculty of Computing and and Software Engineering, and Software Engineering, Information Technology, University International Islamic University, International Islamic University, of Jeddah, Jeddah, Saudi Arabia Islamabad, Pakistan Islamabad, Pakistan [email protected] [email protected] [email protected] a Khaled H. Alyoubi a Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia [email protected] ABSTRACT KEYWORDS Finding rising stars is a challenging and interesting task which is Bibliographic databases; Citations; Author Order; Rising Stars; Mutual being investigated recently in co-author networks. Rising stars are Influence; Co-Author Networks authors who have a low research profile in the start of their career but may become experts in the future. This paper introduces a new method Weighted Mutual Influence Rank (WMIRank) for finding 1. INTRODUCTION rising stars. WMIRank exploits influence of co-authors’ citations, The rapid evolution of scientific research has created large order of appearance and publication venues. Comprehensive volumes of publications every year, and is expected to continue in experiments are performed to analyze the performance of near future [21].
    [Show full text]