DOCSLIB.ORG

Giuseppe F. Italiano

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Giuseppe F. Italiano Giuseppe F. Italiano Dipartimento di Ingegneria Civile e Ingegneria Informatica +39-06-72597394 Università di Roma “Tor Vergata” Fax +39-06-72597460 via del Politecnico 1 [email protected] 00133 Roma, Italy http://people.uniroma2.it/giuseppe.italiano/ RESEARCH INTERESTS My interests are in the design, analysis, implementation and experimental evaluation of algorithms and data structures. My research areas include algorithm engineering, combinatorial algorithms, computer security, graph algorithms and string algorithms. PERSONAL Born on March 16, 1961 in Italy. Italian Citizen. Married plus four. Enjoy running. EDUCATION 1988 - 91 Ph.D. in Computer Science. Columbia University, New York, NY. Thesis Advisor: Prof. Zvi Galil. Thesis Title: “Dynamic data structures for graphs”. 1990 M.Phil. Columbia University, New York, NY. 1987 - 88 M.Sc. in Computer Science. Columbia University, New York, NY. 1979 - 85 Laurea summa cum laude in Electrical Engineering. University of Rome “La Sapienza”, Roma, Italy. Thesis Advisor: Prof. Giorgio Ausiello. EMPLOYMENT 1998 - Professor of Computer Science. University of Rome “Tor Vergata”, Italy. 2004 - 12 Chair of the Department of Computer Science, Systems and Production. University of Rome “Tor Vergata”. 1995 - 98 Professor of Computer Science. University of Venice “Ca’ Foscari”, Italy. 1994 - 95 Professor of Computer Science. University of Salerno, Italy. 1991 - 95 Research Staff Member. IBM Research Division, T.J. Watson Research Center, Com- munication Systems Department. 1989 - 94 Assistant Professor. University of Rome “La Sapienza”, Italy. OTHER APPOINTMENTS 2017 - Panel Member for Mathematics, Statistics and Computer Science. Danish Council for Independent Research (DFF). 2013 - Vice-Rector for Quality, Evaluation and Performance. University of Rome “Tor Ver- gata". 2012 - Adjunct Professor, LUISS University, Rome. 2012 - Member of the Board of Directors. In-Time (http://www.innovazioniperlaterra.org/). Start-up focusing on information technologies for the environment. 2012 - Member of the Scientific Committee, CeRSI, Research Center in Information Systems, LUISS University, Rome. 2011 - 14 Member of the Gödel Award Committee, Chair in 2014. 2009 - Co-founder, TrustMyPhone (http://trustmyphone.com). Start-up focusing on secu- rity for mobile devices. 4 2006 - 13 Member of the Council. European Association for Theoretical Computer Science. 2002 - 08 Chair of the Evaluation Committee. University of Rome “Tor Vergata”. 2002 - 08 Member of the Council. European Association for Theoretical Computer Science, Ital- ian Chapter. 2001 - 07 Member of the Board of Directors. Roma Ricerche Consortium. 2001 - 16 Co-founder, Wireless Lab (http://www.w-lab.it). Start up focusing on wireless tech- nologies and on pervasive and mobile computing. 2000 Visiting Professor. Department of Computer Science, Columbia University. 2000 Member of the EATCS Doctoral Dissertation Thesis Award Committee, EATCS Italian Chapter 1998 Visiting Professor. Department of Computer Science, The Hong Kong University of Science & Technology. AWARDS AND HONORS 2016 EATCS Fellow for “fundamental contributions to the design and analysis of algorithms for solving theoretical and applied problems in graphs and massive data sets, and for his role in establishing the field of algorithm engineering”. 2011 Best Paper Award at the 8th Symposium on String Processing and Information Retrieval (SPIRE 2011). 1997 Distinguished Visiting Professor. Max–Planck–Institut für Informatik, Saarbrücken, Germany. 1988 - 91 IBM Graduate Fellowship. 1986 - 87 Italian National Research Council Fellowship. EDITORIAL ACTIVITIES Journal Editorial Boards 2008–2014 Editor-in-Chief, ACM Journal on Experimental Algorithmics 2007– Associate Editor, Algorithmica 2002– Associate Editor, Theoretical Computer Science, Track A 2008–2010 Associate Editor, Journal of Discrete Algorithms 1999–2008 Editor-in-Chief, Journal of Discrete Algorithms 1999–2008 Associate Editor, ACM Journal on Experimental Algorithmics 1995–2007 Associate Editor, Journal of Complexity 1997–2003 Associate Editor, Discrete Mathematics and Theoretical Computer Science 1995–2003 Associate Editor, Journal of Computing and Information Journal Guest Editor 1. Algorithmica, vol. 73(4), 2015. Special issue on the 21st European Symposium on Algorithms. 2. Journal of Discrete Algorithms, vol. 7(3), 2009. Special issue on the 6th Int. Conf. on Algo- rithms and Complexity. 3. Theoretical Computer Science, vol. 380 (1–2), 2007. Special issue on the 32nd Int. Coll. on Automata, Languages and Programming. 4. ACM Journal on Experimental Algorithmics. Special issue on the 6th Workshop on Algorithm Engineering and Experimentation. 5. Journal of Discrete Algorithms, Special Issue, vol. 4 (3), September 2006. 6. Journal of Algorithms, 49, 1 (2003). Special Issue on the European Symposium on Algorithms 98. 5 7. Algorithmica vol. 30 (4), 2001, Special issue on Algorithm Engineering. 8. Journal on Complexity 15 (1), 1999. Festschrift for Zvi Galil. 9. ACM Journal on Experimental Algorithmics 3 (1998). Special Issue on the Workshop on Algorithm Engineering 1997. 10. Theoretical Computer Science 130 (1), 1994. Special Issue on Dynamic and On-line Algo- rithms. KEYNOTE LECTURES Invited Lectures at International Schools 1. Summer school ADDICTION: ADdressing DIfficult problems in a Computationally Tractable fashION , in Lisbon, Portugal, 16–21 November 2014. 2. 3rd School on Graph Theory, Algorithms and Applications, Erice, Italy, 8–16 September, 2014. 3. Microsoft School on Algorithms and Systems for Large Datasets, Moscow, Russia, July 31 – August 7, 2013. 4. 17th Estonian Winter School in Computer Science (EWSCS), Palmse, Estonia, February 26 -March 2, 2012 . 5. Microsoft Data Structures and Algorithms School (MIDAS), St. Petersburg, Russia, August 8-14, 2010. 6. School on Graph Theory, Algorithms and Applications, Erice, Italy, 8–16 September, 2008. 7. 20th International School on Algorithms: Science and Engineering, Lipari, Italy, July 13 – July 26, 2008. 8. Summer School on Shortest Paths - Between Algorithms and Optimization (PATH05), July 4-8, 2005, Copenhagen, Denmark. Invited Lectures at Conferences 1. 24th Annual European Symposium on Algorithms (ESA 2016), Aarhus, Denmark August 22–24, 2016. 2. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Helsinki, Finland, August 17–19, 2016. 3. 10th International Workshop on Algorithms and Computation (WALCOM 2016), March 29- 31, 2016 Kathmandu, Nepal. 4. 25th International Symposium on Algorithms and Computation (ISAAC 2014), December 15–17, 2014 Jeonju, Korea. 5. Theoretical Computer Science (TCS 2014), September 1–3, 2014, Rome, Italy. 6. NATO Technology for Information, Decision and Execution Superiority (TIDE) Sprint, 16-20 April 2012. Utrecht, The Netherlands. 7. 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), January 21-27, 2012, Spindler˘ ˙uvMlýn, Czech Republic. 8. 7th International Conference on Algorithms and Complexity (CIAC 2010), May 26-28, 2010 Rome, Italy. 9. 4th International Symposium on Experimental Algorithms (SEA 2010), Ischia, Italy, May 20-22 2010. 10. 12th International Conference on Principles and Practice of Constraint Programming (CP 2006), September 25-29, 2006, Nantes, France. 11. ALGO 2005 (Joint Symposium and Workshops: ESA 2005, WABI 2005, WAOA 2005, AT- MOS 2005), 3-7 October 2005, Palma de Mallorca, Spain. 12. 3rd Workshop on Experimental Algorithms (WEA 04), May 25–28 2004, Angra dos Reis, Brazil. 6 13. 11th International Symposium on Graph Drawing (GD 2003), September 21–24 2003, Perugia, Italy. 14. 14th Australasian Workshop on Combinatorial Algorithms (AWOCA 2003), July 13–16 2003, Seoul, Korea. 15. “Silver Jubilee”, 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), August 28 – September 1, 2000, Bratislava, Slovakia. 16. Workshop on Advances in Data Structures, December 11–12 1999, Chennai, India. 17. Workshop on Dynamic Graph Problems, Thematic Programme on Graph Theory and Com- binatorial Optimization, June 5–9, 2000, Victoria, Canada. 18. “Fundamentals” Track (Foundations of Computer Science), 15th IFIP World Computer Congress (IFIP 98), August 31 – September 4, 1998, Vienna (Austria), 1998. 19. 1st South American Workshop on String Processing (WSP 93), 13-15 September 1993, Belo Horizonte, Brazil, 1993. 20. 20th Theory Day at Columbia University, New York, U.S.A., 1992. ADVISORY BOARDS, STEERING COMMITTEES, TASK GROUPS 2012–2015 Steering Committee Member of the European Symposium on Algorithms (ESA), Chair from 2013. 2012–2014 Member of the NATO RTO Task Group “Trusted Information Sharing for Partnerships" (IST-114). 2010– Steering Committee Member of the International Conference on Algorithms and Com- plexity (CIAC). 2009– Member of the Advisory Board. MADALGO - Center for MAssive Data ALGOrithmics, Aarhus, Denmark. 2007–2010 Steering Committee Member of the European Symposium on Algorithms (ESA). 2005– Steering Committee Member of the Workshop/Symposium on Experimental Algorithms (WEA / SEA). 2004–2007 Steering Committee Member of the Workshop on Algorithm Engineering and Experi- mentation (ALENEX). 1997–2000 Steering Committee Member of the Workshop on Algorithm Engineering (WAE). 1997–2000 Steering Committee Member of the European Symposium on Algorithms (ESA). PROGRAM COMMITTEES Program Committee Member / Chair 1. 34th International Symposium on Theoretical Aspects of Computer Science (STACS
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]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Lecture Notes in Computer Science
    D. Dolev Z. Galil M. Rodeh (Eds.) Theory of Computing and Systems ISTCS '92, Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo Hong Kong Barcelona Budapest Series Editors Gerhard Goos Juris Hartmanis Universit~it Karlsruhe Department of Computer Science Postfach 69 80 Cornell University Vincenz-Priessnitz-Stral3e 1 5149 Upson Hall W-7500 Karlsruhe, FRG Ithaca, NY 14853, USA Volume Editors Danny Dolev Hebrew University Givat Ram, Jerusalem, Israel Zvi Galil Columbia University, New York, NY 10027, USA and Tel Aviv University Ramat Aviv, Tel Aviv, Israel Michael Rodeh IBM Israel Ltd., Science and Technology, Technion City Haifa 32000, Israel CR Subject Classification (1991): F.1-4, B.3, C.2, G.1-2, 1.1, E.4, D.2-3 ISBN 3-540-55553-6 Springer-Verlag Berlin Heidelberg New York ISBN 0-387-55553-6 Springer-Verlag New York Berlin Heidelberg This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law. Springer-Verlag Berlin Heidelberg 1992 Printed in Germany Typesetting: Camera ready by author/editor Printing and binding: Druckhaus Beltz, Hemsbach/Bergstr.
    [Show full text]
  • Sparsification–A Technique for Speeding up Dynamic Graph Algorithms
    Sparsification–A Technique for Speeding Up Dynamic Graph Algorithms DAVID EPPSTEIN University of California, Irvine, Irvine, California ZVI GALIL Columbia University, New York, New York GIUSEPPE F. ITALIANO Universita` “Ca’ Foscari” di Venezia, Venice, Italy AND AMNON NISSENZWEIG Tel-Aviv University, Tel-Aviv, Israel Abstract. We provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties with the following times: minimum spanning forests, graph connectivity, graph 2-edge connectivity, and bipartiteness in time O(n1/2) per change; 3-edge connectivity, in time O(n2/3) per change; 4-edge connectivity, in time O(na(n)) per change; k-edge connectivity for constant k, in time O(nlogn) per change; 2-vertex connectivity, and 3-vertex connectivity, in time O(n) per change; and 4-vertex connectivity, in time O(na(n)) per change. A preliminary version of this paper was presented at the 33rd Annual IEEE Symposium on Foundations of Computer Science (Pittsburgh, Pa.), 1992. D. Eppstein was supported in part by National Science Foundation (NSF) Grant CCR 92-58355. Z. Galil was supported in part by NSF Grants CCR 90-14605 and CDA 90-24735. G. F. Italiano was supported in part by the CEE Project No. 20244 (ALCOM-IT) and by a research grant from Universita` “Ca’ Foscari” di Venezia; most of his work was done while at IBM T. J. Watson Research Center. Authors’ present addresses: D. Eppstein, Department of Information and Computer Science, University of California, Irvine, CA 92717, e-mail: [email protected], internet: http://www.ics.
    [Show full text]
  • Efficient Algorithms for Finding Maximum Matching in Graphs
    Efficient Algorithms for Finding Maximum Matching in Graphs ZVI GALIL Department of Computer Science, Columbia University, New York, N. Y., 10027 and Tel-Aviv University, Tel-Aviv, Israel This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-computation on discrete structures; G.2.2 [Discrete Mathematics]: Graph Theory-graph algorithms General Terms: Algorithms, Theory, Verification Additional Key Words and Phrases: Algorithmic tools, the asexual case, assignment problem, augmenting path, blossoms, data structures, d-heap, duality, ET, generalized priority queue, Main Theorem of Botany, matching, monsters, moonlighting, polygamy, primal-dual method, shmathematics, shrink, warm-up INTRODUCTION tools are “divide and conquer” and dynamic There are no recipes for designing efficient programming [Aho et al. 19741. Alterna- algorithms. This is somewhat unfortunate tively, we may try to find a way to reduce from the point of view of applications: Any the number of steps in the original algo- time we have to design an algorithm, we rithm by finding a better way to organize may have to start (almost) from scratch. the information. However, it is fortunate from the point of (c) Data Structures. Sometimes we can view of researchers: It is unlikely that we speed up an algorithm by using an efficient are going to run out of problems or chal- data structure that supports the primitive lenges.
    [Show full text]
  • Secure Fault-Tolerant Protocols and the Public-Key Model
    Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model (Extended Abstract) Zvi Galil'. 2* Stuart Habedl Moti Yung'r 3*4 Department of Computer Science, Columbia University Department of Computer Science, Tei Aviv University We give a general procedure for designing correct, secure, and fault-tolerant cryptographic protocols for many parties, thus enlarging the domain of tasks that can be performed efficiently by cryptographic means. We model the most general sort of feasible adversarial behavior, and describe fault-recovery procedures that can tolerate it. Our constructions minimize the use of cryptographic resources. By applying the complexity-theoretic approach to knowledge, we are able to measure and control the computational knowledge released to the various users, as well as its temporal availability. Supported in part by NSF grants MCS-8303139 and DCR-8511713. Supported in part by an IBM graduate fellowship. C. Pomerance (Ed.): Advances in Cryptology - CRYPT0 '87, LNCS 293, pp. 135-155, 1988. 0 Springer-Verlag Berlin Heidelberg 1988 136 s-rg An important area of research in cryptography is the design of protocols for cawing on certain uansactions in a communications network, such as playing poker or holding an election. Many of the pr~tocolsproposed in this area have required the expensive on-line generation of a large number of new keys. On the other hand, fundamental research in the traditional problems of cryptography, such as encryption and authentication, has developed the public-key model, in which each user has a single validated public key. This model is appropriate to those situations in which generation and validation of new keys is very costly or is othewise limited.
    [Show full text]
  • Curriculum Vitae for Matt Franklin
    Curriculum Vitae for Matt Franklin Education Feb 1994 Ph.D. in Computer Science, Columbia University, New York, NY. Thesis Advisors: Zvi Galil, Moti Yung. Thesis: Efficiency and Security of Distributed Protocols. May 1985 M.A. in Mathematics, University of California, Berkeley, CA. Thesis Advisors: Elwyn Berlekamp, Gilles Brassard. Thesis: Mathematical Investigations of the Data Encryption Standard. May 1983 B.A. in Mathematics, Pomona College, Claremont, CA. Recent Professional Experience July 2000-present U. C. Davis, CS Dept (Professor 2004, Assoc Prof 2002). 1998-2000 Xerox PARC, Palo Alto, CA, Member of Research Staff. 1994-98 AT&T Research (aka Bell Labs), Principal Technical Staff Member. Fellowships and Awards Godel Prize (2013), ACM SIGACT / EATCS. Packard Foundation Fellowship in Science and Engineering (2001-08). NSF CAREER Award (2001-06). AT&T Bell Labs Ph.D. Scholar (1990-94). Editorial Boards J. Cryptology 2000-present (Editor in Chief 2009-14); J. Computer Security 2001-08; IET Information Security 2005-08; Int. J. Inf. and Comp. Security 2006-08; Int. J. Applied Crypto 2007-08; Int. J. Security and Networks 2006-08. Conference Chairs CANS 2008 (Co-Chair); Crypto 2004 (Chair); Financial Crypto 1999 (Chair). Program Committees Mathematical Foundations of Computer Science (2015); Crypto (2008,2007,2002,1998); Eurocrypt (2006, 2001); Asiacrypt (2002); Theory of Cryptography (2009); Public Key Cryptography (2008); Finan- cial Crypto (2001,1998,1997); ACM Security (1999,1996); Computer Secu- rity Foundations (2000); Selected Areas in Cryptography (2001); ACM E- Commerce (2001); Network and Distributed Systems Security (2003); ACM Digital Rights Management (2003), ICDCS Security Track (2005), ICALP Crypto/Security Track (2005).
    [Show full text]
  • Dynamic Approximate Vertex Cover and Maximum Matching
    Dynamic Approximate Vertex Cover and Maximum Matching The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Onak, Krzysztof, and Ronitt Rubinfeld. “Dynamic Approximate Vertex Cover and Maximum Matching.” Property Testing. Ed. Oded Goldreich. LNCS Vol. 6390. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 341–345. As Published http://dx.doi.org/10.1007/978-3-642-16367-8_28 Publisher Springer Berlin / Heidelberg Version Author's final manuscript Citable link http://hdl.handle.net/1721.1/73896 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike 3.0 Detailed Terms http://creativecommons.org/licenses/by-nc-sa/3.0/ Dynamic Approximate Vertex Cover and Maximum Matching Krzysztof Onak∗ Ronitt Rubinfeld† MIT MIT, Tel Aviv University [email protected] [email protected] February 15, 2010 Abstract We consider the problem of maintaining a large matching or a small vertex cover in a dynam- ically changing graph. Each update to the graph is either an edge deletion or an edge insertion. We give the first data structure that simultaneously achieves a constant approximation factor and handles a sequence of k updates in k polylog(n) time. Previous data structures require a polynomial amount of computation per update.· The starting point of our construction is a distributed algorithm of Parnas and Ron (Theor. Comput. Sci. 2007), which they designed for their sublinear-time approximation algorithm for the vertex cover size. This leads us to wonder whether there are other connections between sublinear algorithms and dynamic data structures. 1 Introduction Suppose one is given the task of solving a combinatorial problem, such as maximum matching or minimum vertex cover, for a very large and constantly changing graph.
    [Show full text]
  • Herzliya Conference February 2-4, 2009 Policy, Statecraft and Leadership for Trying Times
    on the Balance of Israel’s National Security Conference Conclusions The Ninth Herzliya Conference February 2-4, 2009 Policy, Statecraft and Leadership for Trying Times Institute for Policy and Strategy Lauder School of Government, Diplomacy & Strategy The Interdisciplinary Center (IDC) Herzliya Table Of Contents 1 About the Herzliya Conference 9 Conference Conclusions 10 Preface 12 Strategic Trends for Israel 17 The World Order: A Multiple-Crisis Global Arena 26 The Middle East: Regional Issues and Key Players 31 Israel’s Global and Regional Security and Political Challenges 39 Israel and Jewish Peoplehood: Reinforcing the National Resilience 41 Israel in the Global Era: Challenges at Home 49 Conference Program 54 About IDC & IPS 57 Conference Participants 66 Acknowledgments About the Herzliya Conference 1 HERZLIYA | 2009 Israel’s premier global policy gathering, the Herzliya Conference exclusively draws together international and Israeli participants from the highest levels of government, business and academia to address the most pressing national, regional and global issues. The Conference offers leaders timely and authoritative assessments and policy recommendations needed to guide their organizations through the challenging geopolitical, economic and social developments. Harnessing path-breaking methodologies, the Conference’s task force reports and the commissioned studies present an accurate, coherent, continuous and comprehensive picture of the region and the world. Strategic and political processes and events emanating from an ever-turbulent Middle East increasingly impact the global arena. Shaping the regional and international policy debates and directly influencing decision-making, the deliberations at Herzliya cover a broad span of issues, ranging from nuclear proliferation and the Middle East peace process to world finance, energy security and global warming.
    [Show full text]
  • Minimum-Knowledge Interactive Proofs for Decision Problems*
    SIAM J. COMPUT. (C) 1989 Society for Industrial and Applied Mathematics Vol. 18, No. 4, pp. 711-739, August 1989 0O6 MINIMUM-KNOWLEDGE INTERACTIVE PROOFS FOR DECISION PROBLEMS* ZVI GALIL'?, STUART HABER$, AND MOTI YUNG Abstract. Interactive communication of knowledge from the point of view of resource-bounded compu- tational complexity is studied. Extending the work of Goldwasser, Micali, and Rackoff [Proc. 17th Annual ACM Symposium on the Theory of Computing, 1985, pp. 291-304; SIAM J. Comput., 18 (1989), pp. 186-208], the authors define a protocol transferring the result of any fixed computation to be minimum-knowledge if it communicates no additional knowledge to the recipient besides the intended computational result. It is proved that such protocols may be combined in a natural way so as to build more complex protocols. A protocol is introduced for two parties, a prover and a verifier, with the following properties: (1) Following the protocol, the prover gives to the verifier a proof of the value, 0 or 1, of a particular Boolean predicate, which is (assumed to be) hard for the verifier to compute. Such a deciding "interactive proof-system" extends the interactive proof-systems of [op. cit.], which are used only to confirm that a certain predicate has value 1. (2) The protocol is minimum-knowledge. (3) The protocol is result-indistinguishable: an eavesdropper, overhearing an execution of the protocol, does not learn the value of the predicate that is proved. The value of the predicate is a cryptographically secure bit, shared by the two parties to the protocol. This security is achieved without the use of encryption functions, all messages being sent in the clear.
    [Show full text]
  • BRIDGE Linking Engin Ee Ring and Soci E T Y
    Spring 2007 The BRIDGE LINKING ENGIN ee RING AND SOCI E TY Lessons from Hurricane Katrina John T. Christian Effects of the 2004 Sumatra-Andaman Earthquake and Indian Ocean Tsunami in Aceh Province Lloyd S. Cluff Engineering Research for Non-Engineered Buildings Melvyn Green Critical Infrastructure, Interdependencies, and Resilience T.D. O’Rourke Building a Resilient Organization Yossi Sheffi Promoting the technological welfare of the nation by marshalling the knowledge and insights of eminent members of the engineering profession. The BRIDGE NATIONAL ACADEMY OF EnGINEERING Craig R. Barrett, Chair Wm. A. Wulf, President Maxine L. Savitz, Vice President W. Dale Compton, Home Secretary George Bugliarello, Foreign Secretary William L. Friend, Treasurer Editor in Chief (interim): George Bugliarello Managing Editor: Carol R. Arenberg Production Assistant: Penelope Gibbs The Bridge (USPS 551-240) is published quarterly by the National Academy of Engineering, 2101 Constitution Avenue, N.W., Washington, DC 20418. Periodicals postage paid at Washington, DC. Vol. 37, No. 1, Spring 2007 Postmaster: Send address changes to The Bridge, 2101 Constitution Avenue, N.W., Washington, DC 20418. Papers are presented in The Bridge on the basis of general interest and time- liness. They reflect the views of the authors and not necessarily the position of the National Academy of Engineering. The Bridge is printed on recycled paper. © 2007 by the National Academy of Sciences. All rights reserved. Erratum In “The Changing Face of Engineering Education” (pp. 5–13) in the summer 2006 issue, the line at the bottom of Figures 4, 5, and 6 should read “5 point scale, where 1 = no ability and 5 = high ability.” A complete copy of The Bridge is available in PDF format at http://www.nae.edu/TheBridge.
    [Show full text]
  • Business Unusual in the Ivory Tower - Haaretz - Israel News Page 1 of 5
    Business unusual in the ivory tower - Haaretz - Israel News Page 1 of 5 Subscribe to Print Edition | Thu., July 23, 2009 Av 2, 5769 | | Israel Time: 22:06 (EST+7) Search Back to Homepage web haaretz.com Haaretz Toolbar Diplomacy Defense Jewish World Opinion National Print Edition Car Rental Books Haaretz Magazine Business Real Estate Maccabiah Travel Week's End Anglo File Share | Business unusual in the ivory tower By Or Kashti Tags: Israel News Ads by Google Reuters Salary Reuters Jobs News on Israel Israel Rabbi Special Offers June 19 was the last day of classes at Tel Aviv University, but unlike in previous Advertisement years, it was far from heralding the beginning of a relaxing summer vacation. hotel Jerusalem David Citadel Hotel, come Eleven days later, university president Zvi Galil unexpectedly announced his stay at the finest of resignation, and tension erupted between two of the highest-ranking forums at Jerusalem hotels. this important institution: the executive council, some of whose members are ISRAEL ARMY businessmen, and the senate, the supreme academic body, which consists of SURPLUS STORE IDF insignia,Uniforms, deans and senior professors. The resignation was at first presented as a personal Paladium Boots Watches, decision by Galil, but it soon emerged that his departure was the outcome of a Israel Army T-shirts & passionate struggle revolving around a single question: Who controls the largest Collectibles Dead Sea Skin Care university in Israel? Quality cosmetics from the Dead Sea. Coupon code "That was the first public battle between the businessmen and us, the HAARETZ for 12% off! academics," declared one TAU professor this week.
    [Show full text]