DOCSLIB.ORG

Most Prolific DBLP Authors

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Most Prolific DBLP Authors Most Prolific DBLP Authors http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/prolific/index... Most Prolific DBLP Authors number of publications / names 484 Philip S. Yu 428 Chin-Chen Chang 421 Elisa Bertino 415 Edwin R. Hancock 412 Sudhakar M. Reddy 410 Grzegorz Rozenberg 393 Alberto L. Sangiovanni-Vincentelli 390 Thomas S. Huang 378 Micha Sharir - Kang G. Shin 375 Wei Wang 373 Mahmut T. Kandemir 349 Wen Gao 345 Irith Pomeranz 341 Hector Garcia-Molina 339 Moshe Y. Vardi 336 Joseph Y. Halpern 329 Noga Alon 322 Anil K. Jain 321 Sushil Jajodia - Ming Li - Wei Li 318 Sajal K. Das 317 Jiawei Han 316 Kaushik Roy - Donald F. Towsley 312 Hans-Peter Seidel 311 Jack Dongarra 302 Josef Kittler 297 Azriel Rosenfeld 296 Christos H. Papadimitriou 293 HongJiang Zhang 286 Mario Piattini - Moti Yung 278 Francky Catthoor 275 Witold Pedrycz 274 Leonidas J. Guibas 273 Kurt Mehlhorn 272 Stephan Olariu 1／26 2008/4/14 上午 11:38 Most Prolific DBLP Authors http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/prolific/index... 268 Christoph Meinel - Ugo Montanari 266 Horst Bunke - Niraj K. Jha - Massoud Pedram 263 Divyakant Agrawal - Michel Raynal - Jie Wu 262 Tharam S. Dillon 261 Hsinchun Chen - John Mylopoulos - Viktor K. Prasanna 260 Oscar H. Ibarra 257 Andrew B. Kahng 255 Hans-Peter Kriegel - Paul G. Spirakis 254 David Eppstein - Martin D. F. Wong 252 Henri Prade 251 Luca Benini - Makoto Takizawa 250 Alok N. Choudhary - Hartmut Ehrig 248 Mary Jane Irwin - Gerhard Weikum 247 Oded Goldreich 245 Gheorghe Paun - David Peleg 243 Erik D. Demaine - Qing Li 242 Didier Dubois 241 Diane Crawford - Amir Pnueli 240 Prithviraj Banerjee - Jeffrey D. Ullman 239 Gerhard J. Woeginger 238 Ben Shneiderman 236 Amr El Abbadi - Robert K. Brayton 235 Ian T. Foster 234 Li Zhang 232 Pankaj K. Agarwal - Nicholas R. Jennings - Wei-Ying Ma - Krithi Ramamritham 231 Mario Gerla 230 José Duato - Robert Endre Tarjan 229 David J. Evans - Nancy A. Lynch - Elke A. Rundensteiner 227 Geoffrey Fox 226 Daniel Thalmann 225 Nikil D. Dutt 223 Christos Faloutsos - Matthias Jarke - Hermann A. Maurer 222 Robert L. Glass - Hai Jin - Kishor S. Trivedi 221 Thomas A. Henzinger 220 Kwang-Ting Cheng - Takeo Kanade - Kian-Lee Tan - Katsumi Tanaka 219 Thomas Eiter - Saharon Shelah - Michael Stonebraker 217 Tao Jiang - Arto Salomaa 215 Alberto Del Bimbo - Bart Preneel - Jun Wang 214 Jacob A. Abraham - Alan M. Frieze - Jeffrey Scott Vitter - Derick Wood 213 Stefano Ceri - Georg Gottlob - Marek Karpinski - Heinrich Niemann - Avi Wigderson 212 José Meseguer 210 Serge Abiteboul 2／26 2008/4/14 上午 11:38 Most Prolific DBLP Authors http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/prolific/index... 208 Herbert Edelsbrunner - Edward A. Fox - Sartaj Sahni 207 Jason Cong - C. C. Jay Kuo - Manuela M. Veloso 206 Edmund M. Clarke - Majid Sarrafzadeh 204 Hamid R. Arabnia - Lane A. Hemaspaandra - Vladik Kreinovich 203 Luc J. Van Gool - John H. Reif - Hong Shen - Harry Shum 202 Rama Chellappa - Hideki Imai 201 Ming-Syan Chen - Ling Liu - Ching Y. Suen 200 Jiannong Cao - H. Vincent Poor - Howard Jay Siegel 199 Manfred Broy - Giovanni De Micheli 198 Fabrizio Lombardi 197 Rolf Drechsler - Yahiko Kambayashi - Nadia Magnenat-Thalmann 196 Ricardo A. Baeza-Yates 195 Narayanan Vijaykrishnan - Zhaohui Wu 194 David Maier - Yishay Mansour - S. Muthukrishnan - Dhabaleswar K. Panda - Abraham Silberschatz 193 Azzedine Boukerche - Miodrag Potkonjak - V. S. Subrahmanian 192 Mark H. Overmars - Munindar P. Singh - Richard T. Snodgrass - Jie Yang 191 David E. Goldberg - Michael T. Goodrich - H. V. Jagadish 190 C. Lee Giles - Ramesh Jain - John-Jules Ch. Meyer - Hong Yan 189 Guang R. Gao - Lionel M. Ni - Wayne Wolf - Michael Wooldridge - Ronald R. Yager 188 John A. Stankovic 187 Larry S. Davis - Barry Smyth - Peter J. Stuckey 186 Wei Zhang 185 Bill Hancock - Sanjay Jain 184 Won Kim - Douglas C. Schmidt - Clement T. Yu 183 Alexandru Nicolau - Raghu Ramakrishnan - Jack Snoeyink 182 Ee-Peng Lim - Wei Zhao 181 Vishwani D. Agrawal - Manfred Glesner - Mohamed Ould-Khaoua - Mihalis Yannakakis 180 Dharma P. Agrawal - Vijay Kumar - Xin Li - Amit P. Sheth - Lei Zhang - Yan Zhang 179 Boi Faltings - Toshio Fukuda - Yi Pan - Stamatis Vassiliadis 178 Masaru Kitsuregawa - Maurizio Lenzerini - Beng Chin Ooi - Joel H. Saltz - Tuomas Sandholm 177 Victor R. Basili - David Blaauw - Xianlong Hong - Klara Nahrstedt - Sachin S. Sapatnekar - Jun Zhang 176 Maurice Bruynooghe - Minglu Li - Katia P. Sycara - Roberto Tamassia - Paul M. B. Vitányi 175 Gregor von Bochmann - Rachid Guerraoui - Richard M. Karp - Vipin Kumar - Hanan Samet - Sebastian Thrun 174 Martín Abadi - Karl Aberer - Narendra Ahuja - Abhijit Chatterjee - W. Bruce Croft - Victor R. Lesser - Ioannis Pitas - Ralf Steinmetz - Gio Wiederhold - Qiang Yang 173 Krishnendu Chakrabarty - Bernard Chazelle - Zvi Galil - Karsten Schwan - David Taniar - Ingo Wegener 172 Ajith Abraham - Béla Bollobás - Rajiv Gupta - Christian S. Jensen - Yannis Manolopoulos - Joseph S. B. Mitchell - Moni Naor - Andrzej Pelc - Matteo Sonza Reorda - Tieniu Tan - Jan Treur - Andrew Zisserman 3／26 2008/4/14 上午 11:38 Most Prolific DBLP Authors http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/prolific/index... 171 Nicholas Ayache - Alon Y. Halevy - Toshihide Ibaraki - Randy H. Katz - David Zhang - Hui Zhang 170 Michael J. Carey - David J. DeWitt - Subhash Suri - Mateo Valero 169 Wil M. P. van der Aalst - Rajeev Alur - Mikhail J. Atallah - Hans L. Bodlaender - Malgorzata Marek-Sadowska - Rajeev Motwani 168 Rakesh Agrawal - Antonio González - Calton Pu - Gunter Saake - Vijay Varadharajan 167 David Harel - Brian Henderson-Sellers - Manuel V. Hermenegildo - Gonzalo Navarro - Joseph O'Rourke - Donatella Sciuto 166 Carole A. Goble - Frank Thomson Leighton - Zohar Manna - Dinesh Manocha - Wolfgang Nejdl - Peter Stone 165 Jan A. Bergstra - Xiaotie Deng - Franco P. Preparata - Kotagiri Ramamohanarao - Andrzej Skowron - Chak-Kuen Wong 164 Elizabeth Chang - Evangelos Kranakis - Alex Pentland - Arnold L. Rosenberg - Reihaneh Safavi-Naini - Hans-Jörg Schek - Marianne Winslett 163 Umeshwar Dayal - Ophir Frieder - Jim Gray - Edward J. McCluskey - M. Tamer Özsu - Jean-Jacques Quisquater 162 Pascal Van Hentenryck - Richard J. Lipton - Vijay V. Raghavan - Ian H. Witten - Carlo Zaniolo 161 Hongjun Lu - Vojtech Rödl - Patrick Valduriez - Ranga Vemuri 160 Thomas Ertl - Yuri Gurevich - Klaus Jansen - Seong-Whan Lee - Divesh Srivastava - Michael G. Strintzis - Jennifer Widom 159 Ian F. Akyildiz - Baruch Awerbuch - Barry W. Boehm - J. J. Garcia-Luna-Aceves - Ming-Yang Kao - Luís Moniz Pereira - Steffen Staab - Benjamin W. Wah - Jun Yang - Ning Zhong 158 Danny Dolev - Erol Gelenbe - Chong-Sun Hwang - Hugo De Man - Janak H. Patel - Ivan Stojmenovic - Chew Lim Tan - Peter Widmayer 157 Hideo Fujiwara - Robert M. Haralick - Arie E. Kaufman - Ken Kennedy - Wei Liu - David B. Lomet - Emilio Luque - Burkhard Monien - Shojiro Nishio - P. Sadayappan - Vaidy S. Sunderam 156 Dimitris N. Metaxas - Takao Nishizeki - Prabhakar Raghavan - Nicola Santoro - Scott Shenker - Franco Zambonelli - Jian Zhang 155 Roberto Cipolla - Paul Erdös - Bernd Girod - Aggelos K. Katsaggelos - Sharad Malik - Wojciech Rytter - Timothy K. Shih - Laurence Tianruo Yang - Chengqi Zhang 154 Frank S. de Boer - Lakhmi C. Jain - Mohamed S. Kamel - Taghi M. Khoshgoftaar - Tok Wang Ling - Ravi S. Sandhu - Xiaoou Tang - Shusaku Tsumoto 153 Shi-Kuo Chang - Wayne Luk - Enrico Macii - Shamkant B. Navathe - B. John Oommen - Hui Wang - Yiyu Yao - Albert Y. Zomaya 152 Reda Alhajj - Franz Baader - Alex Orailoglu 151 Selim G. Akl - Bernd Becker - Prosenjit Bose - Klaus R. Dittrich - Rajesh K. Gupta - Licheng Jiao - James F. Kurose - Nicola Leone - Tao Li - Andrzej Lingas - Timos K. Sellis - Sang Hyuk Son 150 Bharat K. Bhargava - Hyunseung Choo - Masahiro Fujita - Sarit Kraus - Bertrand Meyer - Miroslaw Truszczynski 149 Heikki Mannila - Anand Raghunathan 148 Daniel Gajski - Brad A. Myers - Dan Suciu - Lei Wang - Xiaodong Zhang 147 Srinivas Devadas - Lance Fortnow - Ian Horrocks - Mitsuru Ishizuka - Daphne Koller - Svetha Venkatesh - Xin Wang 146 Philip A. Bernstein - Koen De Bosschere - Roy H. Campbell - Charles J. Colbourn - Theo Härder - Lawrence T. Pileggi - Justin Zobel 4／26 2008/4/14 上午 11:38 Most Prolific DBLP Authors http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/prolific/index... 145 Chung-Kuan Cheng - Andrzej Ehrenfeucht - Katsushi Ikeuchi - Miron Livny - Rami G. Melhem - Cauligi S. Raghavendra - Mukesh Singhal - Bernhard Thalheim 144 Tzi-cker Chiueh - Ahmed K. Elmagarmid - Mohamed G. Gouda - David R. Karger - Wolfgang Maass - Joseph Naor - Andrea Omicini - Maarten de Rijke - Frank Stephan - Toby Walsh 143 Shih-Fu Chang - Lei He - Maurice Herlihy - János Pach - Milind Tambe - Yervant Zorian 142 Dov M. Gabbay - D. T. Lee - Thomas Lengauer - Zhen Liu - Michael R. Lyu - Richard R. Muntz - Dennis Shasha - Stanley Y. W. Su 141 Jake K. Aggarwal - Surajit Chaudhuri - Giuseppe De Giacomo - Frank K. Hwang - Ravishankar K. Iyer - Michael I. Jordan - Kim Guldstrand Larsen - Jiming Liu - Alberto O. Mendelzon - Jeffrey F. Naughton - Erich J. Neuhold - Peter Willett - Hee Yong Youn - Aidong Zhang 140 Floriana Esposito - Sergio Greco - Danny Krizanc - Jun Li - Bing Liu - John C. Mitchell - Simon Parsons - Mubarak Shah - Bernhard Steffen 139 David A. Bell - Steve Benford - Nick Cercone - Danny Z. Chen - Wei Chen - Sung-Bae Cho - David Hung-Chang Du - Nicolas D. Georganas - Wiebe van der Hoek - Juhani Karhumäki - Carlos José Pereira de Lucena - Enrico Pontelli - Yves Robert
Load more

Recommended publications
  • Thomas Ströhlein's Endgame Tables: a 50Th Anniversary
    Thomas Ströhlein's Endgame Tables: a 50th Anniversary Article Supplemental Material The Festschrift on the 40th Anniversary of the Munich Faculty of Informatics Haworth, G. (2020) Thomas Ströhlein's Endgame Tables: a 50th Anniversary. ICGA Journal, 42 (2-3). pp. 165-170. ISSN 1389-6911 doi: https://doi.org/10.3233/ICG-200151 Available at http://centaur.reading.ac.uk/90000/ It is advisable to refer to the publisher’s version if you intend to cite from the work. See Guidance on citing . Published version at: https://content.iospress.com/articles/icga-journal/icg200151 To link to this article DOI: http://dx.doi.org/10.3233/ICG-200151 Publisher: The International Computer Games Association All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement . www.reading.ac.uk/centaur CentAUR Central Archive at the University of Reading Reading’s research outputs online 40 Jahre Informatik in Munchen:¨ 1967 – 2007 Festschrift Herausgegeben von Friedrich L. Bauer unter Mitwirkung von Helmut Angstl, Uwe Baumgarten, Rudolf Bayer, Hedwig Berghofer, Arndt Bode, Wilfried Brauer, Stephan Braun, Manfred Broy, Roland Bulirsch, Hans-Joachim Bungartz, Herbert Ehler, Jurgen¨ Eickel, Ursula Eschbach, Anton Gerold, Rupert Gnatz, Ulrich Guntzer,¨ Hellmuth Haag, Winfried Hahn (†), Heinz-Gerd Hegering, Ursula Hill-Samelson, Peter Hubwieser, Eike Jessen, Fred Kroger,¨ Hans Kuß, Klaus Lagally, Hans Langmaack, Heinrich Mayer, Ernst Mayr, Gerhard Muller,¨ Heinrich Noth,¨ Manfred Paul, Ulrich Peters, Hartmut Petzold, Walter Proebster, Bernd Radig, Angelika Reiser, Werner Rub,¨ Gerd Sapper, Gunther Schmidt, Fred B.
    [Show full text]
  • A Comparison of On-Line Computer Science Citation Databases
    A Comparison of On-Line Computer Science Citation Databases Vaclav Petricek1,IngemarJ.Cox1,HuiHan2, Isaac G. Councill3, and C. Lee Giles3 1 University College London, WC1E 6BT, Gower Street, London, United Kingdom [email protected], [email protected] 2 Yahoo! Inc., 701 First Avenue, Sunnyvale, CA, 94089 [email protected] 3 The School of Information Sciences and Technology, The Pennsylvania State University, University Park, PA 16802, USA [email protected] [email protected] Abstract. This paper examines the difference and similarities between the two on-line computer science citation databases DBLP and CiteSeer. The database entries in DBLP are inserted manually while the CiteSeer entries are obtained autonomously via a crawl of the Web and automatic processing of user submissions. CiteSeer’s autonomous citation database can be considered a form of self-selected on-line survey. It is important to understand the limitations of such databases, particularly when citation information is used to assess the performance of authors, institutions and funding bodies. We show that the CiteSeer database contains considerably fewer single author papers. This bias can be modeled by an exponential process with intuitive explanation. The model permits us to predict that the DBLP database covers approximately 24% of the entire literature of Computer Science. CiteSeer is also biased against low-cited papers. Despite their difference, both databases exhibit similar and signif- icantly different citation distributions compared with previous analysis of the Physics community. In both databases, we also observe that the number of authors per paper has been increasing over time. 1 Introduction Several public1 databases of research papers became available due to the advent of the Web [1,22,5,3,2,4,8] These databases collect papers in different scientific disciplines, index them and annotate them with additional metadata.
    [Show full text]
  • ACM Honors Eminent Researchers for Technical Innovations That Have Improved How We Live and Work 2016 Recipients Made Contribu
    Contact: Jim Ormond 212-626-0505 [email protected] ACM Honors Eminent Researchers for Technical Innovations That Have Improved How We Live and Work 2016 Recipients Made Contributions in Areas Including Big Data Analysis, Computer Vision, and Encryption NEW YORK, NY, May 3, 2017 – ACM, the Association for Computing Machinery (www.acm.org), today announced the recipients of four prestigious technical awards. These leaders were selected by their peers for making significant contributions that have had far-reaching impact on how we live and work. The awards reflect achievements in file sharing, broadcast encryption, information visualization and computer vision. The 2016 recipients will be formally honored at the ACM Awards Banquet on June 24 in San Francisco. The 2016 Award Recipients include: • Mahadev Satyanarayanan, Michael L. Kazar, Robert N. Sidebotham, David A. Nichols, Michael J. West, John H. Howard, Alfred Z. Spector and Sherri M. Nichols, recipients of the ACM Software System Award for developing the Andrew File System (AFS). AFS was the first distributed file system designed for tens of thousands of machines, and pioneered the use of scalable, secure and ubiquitous access to shared file data. To achieve the goal of providing a common shared file system used by large networks of people, AFS introduced novel approaches to caching, security, management and administration. AFS is still in use today as both an open source system and as the file system in commercial applications. It has also inspired several cloud-based storage applications. The 2016 Software System Award recipients designed and built the Andrew File System in the 1980s while working as a team at the Information Technology Center (ITC), a partnership between Carnegie Mellon University and IBM.
    [Show full text]
  • Linking Educational Resources on Data Science
    The Thirty-First AAAI Conference on Innovative Applications of Artificial Intelligence (IAAI-19) Linking Educational Resources on Data Science Jose´ Luis Ambite,1 Jonathan Gordon,2∗ Lily Fierro,1 Gully Burns,1 Joel Mathew1 1USC Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, California 90292, USA 2Department of Computer Science, Vassar College, 124 Raymond Ave, Poughkeepsie, New York 12604, USA [email protected], [email protected], flfierro, burns, [email protected] Abstract linked data (Heath and Bizer 2011) with references to well- known entities in DBpedia (Auer et al. 2007), DBLP (Ley The availability of massive datasets in genetics, neuroimag- 2002), and ORCID (orcid.org). Here, we detail the meth- ing, mobile health, and other subfields of biology and ods applied to specific problems in building ERuDIte. First, medicine promises new insights but also poses significant we provide an overview of our project. In later sections, we challenges. To realize the potential of big data in biomedicine, the National Institutes of Health launched the Big Data to describe our resource collection effort, the resource schema, Knowledge (BD2K) initiative, funding several centers of ex- the topic ontology, our linkage approach, and the linked data cellence in biomedical data analysis and a Training Coordi- resource provided. nating Center (TCC) tasked with facilitating online and in- The National Institutes of Health (NIH) launched the Big person training of biomedical researchers in data science. A Data to Knowledge (BD2K) initiative to fulfill the promise major initiative of the BD2K TCC is to automatically identify, of biomedical “big data” (Ohno-Machado 2014). The NIH describe, and organize data science training resources avail- BD2K program funded 15 major centers to investigate how able on the Web and provide personalized training paths for data science can benefit diverse fields of biomedical research users.
    [Show full text]
  • SETL for Internet Data Processing
    SETL for Internet Data Processing by David Bacon A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Computer Science New York University January, 2000 Jacob T. Schwartz (Dissertation Advisor) c David Bacon, 1999 Permission to reproduce this work in whole or in part for non-commercial purposes is hereby granted, provided that this notice and the reference http://www.cs.nyu.edu/bacon/phd-thesis/ remain prominently attached to the copied text. Excerpts less than one PostScript page long may be quoted without the requirement to include this notice, but must attach a bibliographic citation that mentions the author’s name, the title and year of this disser- tation, and New York University. For my children ii Acknowledgments First of all, I would like to thank my advisor, Jack Schwartz, for his support and encour- agement. I am also grateful to Ed Schonberg and Robert Dewar for many interesting and helpful discussions, particularly during my early days at NYU. Terry Boult (of Lehigh University) and Richard Wallace have contributed materially to my later work on SETL through grants from the NSF and from ARPA. Finally, I am indebted to my parents, who gave me the strength and will to bring this labor of love to what I hope will be a propitious beginning. iii Preface Colin Broughton, a colleague in Edmonton, Canada, first made me aware of SETL in 1980, when he saw the heavy use I was making of associative tables in SPITBOL for data processing in a protein X-ray crystallography laboratory.
    [Show full text]
  • Compact E-Cash and Simulatable Vrfs Revisited
    Compact E-Cash and Simulatable VRFs Revisited Mira Belenkiy1, Melissa Chase2, Markulf Kohlweiss3, and Anna Lysyanskaya4 1 Microsoft, [email protected] 2 Microsoft Research, [email protected] 3 KU Leuven, ESAT-COSIC / IBBT, [email protected] 4 Brown University, [email protected] Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing product equations (Eurocrypt 2008) to two related cryptographic problems: compact e-cash (Eurocrypt 2005) and simulatable verifiable random functions (CRYPTO 2007). We present the first efficient compact e-cash scheme that does not rely on a ran- dom oracle. To this end we construct efficient GS proofs for signature possession, pseudo randomness and set membership. The GS proofs for pseudorandom functions give rise to a much cleaner and substantially faster construction of simulatable verifiable random functions (sVRF) under a weaker number theoretic assumption. We obtain the first efficient fully simulatable sVRF with a polynomial sized output domain (in the security parameter). 1 Introduction Since their invention [BFM88] non-interactive zero-knowledge proofs played an important role in ob- taining feasibility results for many interesting cryptographic primitives [BG90,GO92,Sah99], such as the first chosen ciphertext secure public key encryption scheme [BFM88,RS92,DDN91]. The inefficiency of these constructions often motivated independent practical instantiations that were arguably conceptually less elegant, but much more efficient ([CS98] for chosen ciphertext security). We revisit two important cryptographic results of pairing-based cryptography, compact e-cash [CHL05] and simulatable verifiable random functions [CL07], that have very elegant constructions based on non-interactive zero-knowledge proof systems, but less elegant practical instantiations.
    [Show full text]
  • Benchmarks for IP Forwarding Tables
    Reviewers James Abello Richard Cleve Vassos Hadzilacos Dimitris Achilioptas James Clippinger Jim Hafner Micah Adler Anne Condon Torben Hagerup Oswin Aichholzer Stephen Cook Armin Haken William Aiello Tom Cormen Shai Halevi Donald Aingworth Dan Dooly Eric Hansen Susanne Albers Oliver Duschka Refael Hassin Eric Allender Martin Dyer Johan Hastad Rajeev Alur Ran El-Yaniv Lisa Hellerstein Andris Ambainis David Eppstein Monika Henzinger Amihood Amir Jeff Erickson Tom Henzinger Artur Andrzejak Kousha Etessami Jeremy Horwitz Boris Aronov Will Evans Russell Impagliazzo Sanjeev Arora Guy Even Piotr Indyk Amotz Barnoy Ron Fagin Sandra Irani Yair Bartal Michalis Faloutsos Ken Jackson Julien Basch Martin Farach-Colton David Johnson Saugata Basu Uri Feige John Jozwiak Bob Beals Joan Feigenbaum Bala Kalyandasundaram Paul Beame Stefan Felsner Ming-Yang Kao Steve Bellantoni Faith Fich Haim Kaplan Micahel Ben-Or Andy Fingerhut Bruce Kapron Josh Benaloh Paul Fischer Michael Kaufmann Charles Bennett Lance Fortnow Michael Kearns Marshall Bern Steve Fortune Sanjeev Khanna Nikolaj Bjorner Alan Frieze Samir Khuller Johannes Blomer Anna Gal Joe Kilian Avrim Blum Naveen Garg Valerie King Dan Boneh Bernd Gartner Philip Klein Andrei Broder Rosario Gennaro Spyros Kontogiannis Nader Bshouty Ashish Goel Gilad Koren Adam Buchsbaum Michel Goemans Dexter Kozen Lynn Burroughs Leslie Goldberg Dina Kravets Ran Canetti Paul Goldberg S. Ravi Kumar Pei Cao Oded Goldreich Eyal Kushilevitz Moses Charikar John Gray Stephen Kwek Chandra Chekuri Dan Greene Larry Larmore Yi-Jen Chiang
    [Show full text]
  • FOCS 2005 Program SUNDAY October 23, 2005
    FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H.
    [Show full text]
  • R ˘Azvan Diaconescu
    RA˘ ZVAN DIACONESCU list of publications MONOGRAPHS AND TEXTBOOKS [1-B] Institution-independent Model Theory. volume of Studies in Universal Logic series. Birkhauser¨ Basel, 2008. (386 pages). [2-B] (with K. Futatsugi) CafeOBJ Report: the language, proof techniques, and methodologies for object-oriented algebraic specification, volume 6 of AMAST Series in Computing. World Scientific Singapore, 1998. (174 pages) [3-B] Category-based Semantics for Equational and Constraint Logic Programming. D.Phil thesis, University of Oxford, 1994. (published as OUCL Monograph PRG-116, 120 pages) JOURNAL ARTICLES [4-J] Borrowing interpolation. Journal of Logic and Computation, Oxford Univ. Press. DOI:10.1093/logcom/exr007 [5-J] An axiomatic approach to structuring specifications. Theoretical Computer Science, 433:20–42, Elsevier, 2012. [6-J] Interpolation for predefined types. Mathematical Structures in Computer Science, 22(1):1–24, Cambridge Univ. Press, 2012. [7-J] Grothendieck inclusion systems. Applied Categorical Structures, 19(5):783–802, Springer, 2011. [8-J] Structural Induction in Institutions. Information and Computation, 209(9):1197–1222, Elsevier, 2011. [9-J] (with I. T¸ut¸u) On the Algebra of Structured Specifications. Theoretical Computer Science, 412(28):3145–3174, Elsevier, 2011. [10-J] On quasi-varieties of multiple valued logic models. Mathematical Logic Quarterly, 57(2):194–203, Wiley, 2011. [11-J] Coinduction for preordered algebras. Information and Computation, 209(2):108–117, Elsevier, 2011. [12-J] (with M. Petria) Saturated models in institutions. Archive for Mathematical Logic, 49(6):693–723, Springer, 2010. [13-J] Quasi-Boolean encodings and conditionals in algebraic specification. Journal of Logic and Algebraic Programming, 79(2):174–188, Elsevier, 2010.
    [Show full text]
  • Hierarchical Clustering with Global Objectives: Approximation Algorithms and Hardness Results
    HIERARCHICAL CLUSTERING WITH GLOBAL OBJECTIVES: APPROXIMATION ALGORITHMS AND HARDNESS RESULTS ADISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Evangelos Chatziafratis June 2020 © 2020 by Evangelos Chatziafratis. All Rights Reserved. Re-distributed by Stanford University under license with the author. This work is licensed under a Creative Commons Attribution- Noncommercial 3.0 United States License. http://creativecommons.org/licenses/by-nc/3.0/us/ This dissertation is online at: http://purl.stanford.edu/bb164pj1759 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Tim Roughgarden, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Moses Charikar, Co-Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Li-Yang Tan I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Gregory Valiant Approved for the Stanford University Committee on Graduate Studies. Stacey F. Bent, Vice Provost for Graduate Education This signature page was generated electronically upon submission of this dissertation in electronic format.
    [Show full text]
  • January 2011 Prizes and Awards
    January 2011 Prizes and Awards 4:25 P.M., Friday, January 7, 2011 PROGRAM SUMMARY OF AWARDS OPENING REMARKS FOR AMS George E. Andrews, President BÔCHER MEMORIAL PRIZE: ASAF NAOR, GUNTHER UHLMANN American Mathematical Society FRANK NELSON COLE PRIZE IN NUMBER THEORY: CHANDRASHEKHAR KHARE AND DEBORAH AND FRANKLIN TEPPER HAIMO AWARDS FOR DISTINGUISHED COLLEGE OR UNIVERSITY JEAN-PIERRE WINTENBERGER TEACHING OF MATHEMATICS LEVI L. CONANT PRIZE: DAVID VOGAN Mathematical Association of America JOSEPH L. DOOB PRIZE: PETER KRONHEIMER AND TOMASZ MROWKA EULER BOOK PRIZE LEONARD EISENBUD PRIZE FOR MATHEMATICS AND PHYSICS: HERBERT SPOHN Mathematical Association of America RUTH LYTTLE SATTER PRIZE IN MATHEMATICS: AMIE WILKINSON DAVID P. R OBBINS PRIZE LEROY P. S TEELE PRIZE FOR LIFETIME ACHIEVEMENT: JOHN WILLARD MILNOR Mathematical Association of America LEROY P. S TEELE PRIZE FOR MATHEMATICAL EXPOSITION: HENRYK IWANIEC BÔCHER MEMORIAL PRIZE LEROY P. S TEELE PRIZE FOR SEMINAL CONTRIBUTION TO RESEARCH: INGRID DAUBECHIES American Mathematical Society FOR AMS-MAA-SIAM LEVI L. CONANT PRIZE American Mathematical Society FRANK AND BRENNIE MORGAN PRIZE FOR OUTSTANDING RESEARCH IN MATHEMATICS BY AN UNDERGRADUATE STUDENT: MARIA MONKS LEONARD EISENBUD PRIZE FOR MATHEMATICS AND OR PHYSICS F AWM American Mathematical Society LOUISE HAY AWARD FOR CONTRIBUTIONS TO MATHEMATICS EDUCATION: PATRICIA CAMPBELL RUTH LYTTLE SATTER PRIZE IN MATHEMATICS M. GWENETH HUMPHREYS AWARD FOR MENTORSHIP OF UNDERGRADUATE WOMEN IN MATHEMATICS: American Mathematical Society RHONDA HUGHES ALICE T. S CHAFER PRIZE FOR EXCELLENCE IN MATHEMATICS BY AN UNDERGRADUATE WOMAN: LOUISE HAY AWARD FOR CONTRIBUTIONS TO MATHEMATICS EDUCATION SHERRY GONG Association for Women in Mathematics ALICE T. S CHAFER PRIZE FOR EXCELLENCE IN MATHEMATICS BY AN UNDERGRADUATE WOMAN FOR JPBM Association for Women in Mathematics COMMUNICATIONS AWARD: NICOLAS FALACCI AND CHERYL HEUTON M.
    [Show full text]
  • Arxiv:2008.08417V2 [Cs.DS] 3 Nov 2020
    Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets Jean Cardinal∗ John Iacono† Abstract a number of operations on a persistent collection strings, e modular subset sum problem consists of deciding, given notably, split and concatenate, as well as nding the longest a modulus m, a multiset S of n integers in 0::m − 1, and common prex (LCP) of two strings, all in at most loga- a target integer t, whether there exists a subset of S with rithmic time with updates being with high probability. We elements summing to t (mod m), and to report such a inform the reader of the independent work of Axiotis et + set if it exists. We give a simple O(m log m)-time with al., [ABB 20], contains much of the same results and ideas high probability (w.h.p.) algorithm for the modular sub- for modular subset sum as here has been accepted to ap- set sum problem. is builds on and improves on a pre- pear along with this paper in the proceedings of the SIAM vious O(m log7 m) w.h.p. algorithm from Axiotis, Backurs, Symposium on Simplicity in Algorithms (SOSA21). + Jin, Tzamos, and Wu (SODA 19). Our method utilizes the As the dynamic string data structure of [GKK 18] is ADT of the dynamic strings structure of Gawrychowski quite complex, we provide in §4 a new and far simpler alter- et al. (SODA 18). However, as this structure is rather com- native, which we call the Data Dependent Tree (DDT) struc- plicated we present a much simpler alternative which we ture.
    [Show full text]