Curriculum Vitae
`
`Roberto Tamassia
`Department of Computer Science
`Brown University
`Providence, RI 02912–1910
`+1 (401) 863–7601 (office)
`+1 (401) 258–3298 (mobile)
`rt@cs.brown.edu
`http://www.cs.brown.edu/people/rt/
`
`(November 17, 2014)
`
`Brief Biography
`
`Roberto Tamassia is the Plastech Professor of Computer Science and the Chair of the Department of Com-
`puter Science at Brown University. He is also the Director of Brown’s Center for Geometric Computing.
`His research interests include information security, cryptography, analysis, design, and implementation of
`algorithms, graph drawing and computational geometry. He has published six textbooks and more than 250
`research articles and books in the above areas and has given more than 70 invited lectures worldwide. He is
`an AAAS Fellow, ACM Fellow, and IEEE Fellow and the recipient of a Technical Achievement Award from
`the IEEE Computer Society for pioneering the field of graph drawing. He is listed among the 360 most cited
`computer science authors by Thomson Scientific, Institute for Scientific Information (ISI). He serves regularly
`on program committees of international conferences. His research has been funded by ARO, DARPA, NATO,
`NSF, and several industrial sponsors. He received the Ph.D. degree in electrical and computer engineering
`from the University of Illinois at Urbana-Champaign in 1988.
`
`Education
`
`88
`
`Ph.D. in Electrical and Computer Engineering, University of Illinois at Urbana-Champaign.
`
`Advisor: Franco P. Preparata. Thesis Topic: “Dynamic Data Structures for Two-Dimensional
`Searching.”
`
`84
`
`“Laurea” (M.S.) in Electrical Engineering, University of Rome “La Sapienza.”
`
`Advisor: Carlo Batini. Thesis Topic: “Layout Algorithms and Tools.”
`
`Current Professional Appointments
`
`09–
`
`Plastech Professor of Computer Science, Brown University
`
`00– Director, Center for Geometric Computing, Brown University
`
`Previous Professional Appointments
`
`07–14
`
`Chair, Department of Computer Science, Brown University
`
`98–09
`
`Professor of Computer Science, Brown University
`
`1
`
`Petitioner Apple Inc. - Exhibit 1006, p. 1
`
`

`

`99–01 Adjunct Professor Department of Computer Science Johns Hopkins University
`
`93–98 Associate Professor, Department of Computer Science, Brown University
`
`88–93 Assistant Professor, Department of Computer Science, Brown University
`
`92 Visiting Associate Professor, Dipartimento di Informatica e Sistemistica, University of Rome
`“La Sapienza”
`
`92 Visiting Associate Professor, Istituto di Analisi dei Sistemi ed Informatica, Italian National
`Research Council
`
`88–89 Affiliated Research Faculty, Computer Learning Research Center, The University of Texas at
`Dallas
`
`86–88
`
`Research Assistant, Coordinated Science Laboratory, University of Illinois at Urbana-
`Champaign
`
`85
`
`Fulbright Grantee, Coordinated Science Laboratory, University of Illinois at Urbana-
`Champaign
`
`84–85
`
`Research Associate, Dipartimento di Informatica e Sistemistica, University of Rome “La
`Sapienza”
`
`Awards and Honors
`
`12-
`
`12-
`
`09-
`
`06-
`
`06
`
`Fellow, American Association for the Advancement of Science, (AAAS )
`
`Fellow, Association for Computing Machinery, (ACM )
`
`Fellow, Institute of Electrical and Electronics Engineers, (IEEE )
`
`Highly Cited Researcher in Computer Science, Thomson Scientific, Institute for Scientific In-
`formation (ISI). Listed among the 319 most cited computer science authors worldwide.
`
`Technical Achievement Award, IEEE Computer Society. Citation: “For pioneering the field
`of graph drawing and for outstanding contributions to the design of graph and geometric
`algorithms.”
`
`06
`
`Award for Technological Innovation, Brown University
`
`97–98
`
`Biographee in Who’s Who in the East
`
`90–92 ACM lecturer
`
`87 AICA (Italian Association for Computer Science) Award for Best Research Work in Computer
`Science, for the paper “On Embedding a Graph in the Grid with the Minimum Number of
`Bends”
`
`85
`
`Fulbright Grantee
`
`84 Graduation cum laude, University of Rome, “La Sapienza”
`
`2
`
`Petitioner Apple Inc. - Exhibit 1006, p. 2
`
`

`

`Teaching
`
`12–
`
`CS 2951E Topics in Computer Systems Security (Brown University)
`https://sites.google.com/site/browncs2951e/
`
`06-12
`
`89–05
`
`88–06
`
`CS 166 Introduction to Computer Systems Security (Brown University)
`http://www.cs.brown.edu/courses/cs166/
`
`CS 252 Computational Geometry (Brown University)
`http://www.cs.brown.edu/courses/cs252/
`
`CS 16 Algorithms and Data Structures (Brown University)
`http://cs16.net/
`
`92
`
`Computational Geometry (University of Rome)
`
`84–85 Data Structures and Pascal Programming (University of Rome)
`
`Consulting to Industry
`
`00–03 Algomagic Technologies, Inc.
`
`91–93 Arthur Andersen & Co., Chicago, Illinois
`
`89
`
`Cadre Technologies, Inc., Providence, Rhode Island
`
`88 Digital Equipment Corporation, Colorado Springs, Colorado
`
`85 Datamat, S.p.A., Rome, Italy
`
`85
`
`ENIDATA, S.p.A., Milan, Italy
`
`84 Data Base Informatica, S.p.A., Rome, Italy
`
`83
`
`ISDOS, Inc., Ann Arbor, Michigan
`
`Government Review Boards and Committees
`
`National Science Foundation, panelist and reviewer
`
`Army Research Office, reviewer
`
`Natural Sciences and Engineering Research Council of Canada, reviewer
`
`Ontario Council on Graduate Studies, appraiser
`
`Australian Research Council, reviewer
`
`Australian Academy of Science, reviewer
`
`Italian Ministry of Education, University and Scientific Research, member of Board of Experts
`
`3
`
`Petitioner Apple Inc. - Exhibit 1006, p. 3
`
`

`

`Research Interests
`
`Information Security
`
`Cryptography
`
`Analysis and Design of Algorithms
`
`Graph Drawing
`
`Computational Geometry
`
`Computer Science Education
`
`Research Grants and Corporate Gifts
`
`12–17 National Science Foundation, “Moving Objects Databases for Exploration of Virtual and Real
`Environments,” IIS–1212508, PI, $250,000.
`
`12–16 National Science Foundation, “Privacy-Preserving Distributed Storage and Computation,”
`CNS–1228485, PI, $400,169.
`
`12 NetApp, $40,000
`
`10–15 National Science Foundation, “Towards Trustworthy Interactions in the Cloud,” CNS–
`1012060, PI (with Anna Lysyanskaya and Rodrigo Fonseca), $1,000,000.
`
`10 NetApp, $40,000
`
`09 Google, $50,000 (with John Tyler)
`
`09 NetApp, $40,000
`
`08–13 National Science Foundation, “Algorithms for Graphs on Surfaces,” CCF–0830149, PI,
`$199,999.
`
`07–11 National Science Foundation, “Trust Management for Open Collaborative Information Repos-
`itories: The CalSWIM Cyberinfrastructure,” OCI–0724806 (with Cristina Lopes, Michael T.
`Goodrich and Stanley Grant), co-PI,$1,090,465.
`
`07–09 National Science Foundation, “Privacy Management, Measurement, and Visualization in Dis-
`tributed Environments,” IIS-0713403, PI, $224,995.
`
`07
`
`IAM Technology, Inc., $37,500
`
`03–08 National Science Foundation, “Context-Aware Computing with Applications to Public Health
`Management,” IIS-0324846, $399,000.
`(This medium ITR project is in collaboration with
`Isabel F. Cruz and Peter Scheuermann, and has an overall funding of $2M.)
`
`03–06 National Science Foundation, “An Algorithmic Approach to Cyber-Security,” CCR-0311510,
`$100,000.
`
`06
`
`IAM Technology, Inc., $131,000.
`
`03–06 National Science Foundation, “The Brown Internet Computing Laboratory,” EIA-0303577
`(with Steven P. Reiss, Eliezer Upfal, Maurice Herlihy, and Shriram Krishnamurthi), $640,000.
`
`05
`
`IAM Technology, $32,500.
`
`03–04
`
`Sun Microsystems, $20,000.
`
`4
`
`Petitioner Apple Inc. - Exhibit 1006, p. 4
`
`

`

`03–04 National Science Foundation, “Teaching Data Structures to the Millennial Generation,” DUE–
`0231202, $124,999.
`
`04
`
`03
`
`IAM Registry Corporation, $30,000.
`
`Sun Microsystems (with Thomas W. Doeppner), $20,000.
`
`01–04 National Science Foundation, “Graph Visualization and Geometric Algorithm Design,” CCR–
`0098068 (with Michael T. Goodrich), $400,000.
`
`00–03 Defense Advanced Research Projects Agency, “Efficient and Scalable Infrastructure Support
`for Dynamic Coalitions,”F30602–00–2–0509 (with Michael T. Goodrich and Robert F. Cohen),
`$1,497,376.
`
`98–02 National Science Foundation, “Geometric Algorithm Design and Implementation,” CCR–
`9732327, $230,991.
`
`97–03 National Science Foundation, “A Networked Computing Environment for the Manipulation
`and Visualization of Geometric Data,” Research Infrastructure Grant CDA-97-03080 (with
`Lawrence B. Wolff et al.), $1,226,127.
`
`99 Microsoft Research, $8,000.
`
`96
`
`Tom Sawyer Software, Inc., $40,000.
`
`95–01 Army Research Office, “Applicable and Robust Geometric Computing” (with P. Agarwal, R.
`Kosaraju, M. T. Goodrich, F. P. Preparata, and J. S. Vitter), DAAH04–96–1–0013, $4,484,247.
`
`95–98 National Science Foundation, “Graph Drawing,” CCR–9423847, $225,107.
`
`94–95 NATO Scientific Affairs Division, “Algorithms for Graph Connectivity” (with G. Di Battista
`and A. Kanevsky), $6,000.
`
`93–96 Army Research Office, “High Performance Algorithms for Computational Geometry” (with
`Jeffrey S. Vitter), DAAH04–93–G–0134, $65,000.
`
`91–94 National Science Foundation, “Algorithmic Issues in High Performance Computing” (with
`Jeffrey S. Vitter), CCR–9007851, $346,802.
`
`91–93 Army Research Office, “Algorithmic Issues in High Performance Computing” (with Jeffrey S.
`Vitter), DAAL03–91–G–0035, $150,000.
`
`91–93 Office of Naval Research and Defense Advanced Research Projects Agency, “High-Performance
`Design Environments” (with E. Charniak, T.W. Doeppner, J. Hughes, P.C. Kanellakis, P.N.
`Klein, D.P. Lopresti, F.P. Preparata, S.P. Reiss, J.E. Savage, A. van Dam, P. Van Hentenryck,
`J.S. Vitter, P. Wegner, F.K. Zadeck, and S.B. Zdonik), N00014–91–J–4052, ARPA order 8225,
`$2,654,835.
`
`91–93 NATO Scientific Affairs Division, “Algorithms for Graph Connectivity” (with G. Di Battista
`and A. Kanevsky), $6,708.
`
`91 AT&T Foundation, “Parallelism in Instructional Computing,” $10,000
`
`91
`
`89
`
`Cadre Technologies, Inc., $10,000
`
`Cadre Technologies, Inc., $25,000
`
`5
`
`Petitioner Apple Inc. - Exhibit 1006, p. 5
`
`

`

`Postdoctoral Associates and Research Associates
`
`Bernardo Palazzi (January 2007 – April 2010)
`
`Luca Vismara (May 1996 – December 1997, June 2000 – August 2003)
`
`Michael Shin (February 2002 – May 2002)
`
`David Emory (July 2001 – August 2002)
`
`Andrea Carmignani (February 2001 – July 2001)
`
`Ulrik Brandes (July 1999 – December 1999)
`
`Ashim Garg (January 1986 – August 1997)
`
`Giuseppe Liotta (May 1995 – October 1996)
`
`Maurizio Pizzonia (May 1998 – December 1998)
`
`Graduate Students
`
`Esha Ghosh (Ph.D., current)
`
`James Kelley (Ph.D., current)
`
`Evgenios M. Kornaropoulos (Ph.D., current)
`
`Olya Ohrimenko (Ph.D., 2013)
`
`Joshua W. S. Brown (Sc.M., 2013)
`
`Duy A. Nguyen (Sc.M., 2012)
`
`Charalampos Papamanthou (Ph.D., 2011)
`
`Daniel J. Rosenberg (Sc.M., 2010)
`
`Yash Thakore (Sc.M., 2010)
`
`Juexin Wang (Sc.M., 2010)
`
`Danfeng Yao (Ph.D., 2007)
`
`Nikos Triandopoulos (Ph.D., 2006)
`
`James Baker (Ph.D., on leave)
`
`Galina Shubina (Ph.D., on leave)
`
`Mehmood Ahmad (Sc.M., on leave)
`
`Sean Cannella (Sc.M., 2004)
`
`Stina S. Bridgeman (Ph.D., 2001)
`
`Lixin Pang (Sc.M,, 2000)
`
`Sumi Yunsun Choi (Sc.M., 1999)
`
`Baolin Yang (Sc.M., 1998)
`
`Luis D. Lejter (Sc.M., 1997)
`
`6
`
`Petitioner Apple Inc. - Exhibit 1006, p. 6
`
`

`

`Robinson Mason (Sc.M., 1997)
`
`Ashim Garg (Ph.D., 1995)
`
`Yi-Jen Chiang (Ph.D., 1995)
`
`Sairam Subramanian (Ph.D., 1994)
`
`Robert F. Cohen ( Ph.D., 1992)
`
`Sumeet K. Singh (Sc.M., 1991)
`
`Steering Committees and Advisory Boards
`
`Graph Drawing Symposium (GD), Steering Committee, Founding Member (Chair until 2012).
`
`Workshop on Algorithms and Data Structures (WADS), Steering Committee Member.
`
`Electronic Journal of the Argentine Society for Informatics and Operations Research (SADIO),
`Advisory Board Member.
`
`Program Committees
`
`Algorithm Engineering and Experiments (ALENEX), January 2015, San Diego, California.
`
`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2014, Dallas, Texas.
`
`ACM Conference on Computer and Communications Security (CCS), November 2013, Berlin,
`Germany.
`
`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2013, Orlando, Florida.
`
`European Symposium on Research in Computer Security (ESORICS), September 2013,
`Egham, United Kingdom
`
`IEEE Pacific Visualization Symposium (PacificVis), February 2013, Sydney.
`
`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2012, Redondo Beach, California.
`
`IEEE Pacific Visualization Symposium (PacificVis), March 2012, Songdo, Korea.
`
`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2011, Chicago, Illinois.
`
`Symposium on Graph Drawing (GD), September 2011, Eindhoven, The Netherlands.
`
`Conference on Email and Anti-Spam (CEAS), September 2011, Perth, Australia.
`
`IEEE Pacific Visualization Symposium (PacificVis), March 2011, Hong Kong.
`
`Workshop on Algorithm Engineering and Experimentation (ALENEX), January 2011, San
`Francisco, California.
`
`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2010, San Jose, California.
`
`Conference on Email and Anti-Spam (CEAS), July 2010, Redmond, Washington.
`
`7
`
`Petitioner Apple Inc. - Exhibit 1006, p. 7
`
`

`

`ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
`(GIS), November 2009, Seattle, Washington.
`
`Symposium on Graph Drawing (GD), September 2009, Chicago, Illinois.
`
`Conference on Email and Anti-Spam (CEAS), July 2009, Mountain View, California.
`
`ACM International Symposium on Advances in Geographic Information Systems (GIS),
`November 2008, Los Angeles, California.
`
`Conference on Email and Anti-Spam (CEAS), August 2008, Mountain View, California.
`
`Workshop on Algorithm Engineering (WAE), Provincetown, Massachusetts, May 2008.
`
`Symposium on Graph Drawing (GD), September 23–26, 2007, Sydney, Australia.
`
`Conference on Email and Anti-Spam (CEAS), August 2–3, 2007, Mountain View, California.
`
`Workshop on Algorithms and Data Structures (WADS), July 30—August 1, 2007, Ottawa,
`Canada
`
`IEEE International Conference on Data Engineering (ICDE), April 16–20, 2007, Istanbul,
`Turkey.
`
`International Workshop on Constraint Programming for Graphical Applications, September
`25, 2006, Nantes, France
`
`European Symposium on Algorithms (ESA), September 11–13, 2006, Z¨urich, Switzerland.
`
`Workshop on Visualization for Computer Security (VizSEC), October 26, 2005, Minneapolis,
`Minnesota.
`
`Workshop on Algorithm Engineering and Experimentation (ALENEX), January 22, 2005,
`Vancouver, Canada. (co-chair)
`
`Symposium on Graph Drawing (GD), September 29–October 2, 2004, New York, New York.
`
`Symposium on Graph Drawing (GD), September 21–24, 2003, Perugia, Italy.
`
`Workshop on Algorithms and Data Structures (WADS), July 30—August 1, 2003, Ottawa,
`Canada
`
`Symposium on Graph Drawing (GD), August 26–28, 2002, Irvine, California.
`
`International Symposium on Algorithms and Computation (ISAAC), November 21–23, 2002,
`Vancouver, Canada.
`
`Workshop on Algorithms and Data Structures (WADS), August 8–10 2001, Providence, Rhode
`Island. (co-chair)
`
`Symposium on Graph Drawing (GD), September 20–23, 2000, Colonial Williamsburg, Virginia.
`
`Workshop on Algorithm Engineering (WAE), September 5–8, 2000, Saarbr¨ucken, Germany.
`
`Sixth Annual International Computing and Combinatorics Conference (COCOON), July 26–
`28, 2000, Sydney, Australia.
`
`Italian Conference on Algorithms and Complexity (CIAC), March 1–3, 2000, Rome, Italy.
`
`6th Workshop on Algorithms and Data Structures (WADS), August 12–14, 1999, Vancouver,
`Canada. (co-chair)
`
`8
`
`Petitioner Apple Inc. - Exhibit 1006, p. 8
`
`

`

`International Computing and Combinatorics Conference (COCOON ’99), July 1999, Tokyo,
`Japan.
`
`Workshop on Algorithm Engineering and Experimentation (ALENEX), January 15–16, 1999,
`Baltimore, Maryland.
`
`International Symposium on Algorithms and Computation (ISAAC), December 14–16, 1998,
`South Korea.
`
`Symposium on Graph Drawing (GD), August 13–15, 1998, Montr´eal, Canada.
`
`Symposium on Graph Drawing (GD), September 18–20, 1997, Rome, Italy.
`
`5th Workshop on Algorithms and Data Structures (WADS), August 6–8, 1997 in Halifax,
`Canada. (co-chair)
`
`24th International Colloquium on Automata, Languages and Programming (ICALP), July 7–
`11, 1997, Bologna, Italy.
`
`Workshop on Orders, Algorithms and Applications (ORDAL), August 5–9 1996, Ottawa,
`Canada.
`
`Workshop on Advanced Visual Interfaces (AVI), May 27–29, 1996, Gubbio, Italy.
`
`Symposium on Graph Drawing (GD), September 20–22, 1995, Passau, Germany.
`
`4th Workshop on Algorithms and Data Structures (WADS), August 16–18, 1995, Kingston,
`Ontario, Canada.
`
`Graph Drawing (GD, DIMACS Workshop), October 10–12, 1994, Princeton, New Jersey. (co-
`chair)
`
`10th ACM Annual Symposium on Computational Geometry, June 6–8 1994, Stony Brook, New
`York.
`
`26th ACM Symposium on Theory of Computing (STOC), May 23–25, 1994, Montr´eal, Canada.
`
`Graph Drawing (GD, ALCOM Workshop), September 25–29, 1993, Paris, France.
`
`3rd Workshop on Algorithms and Data Structures (WADS), August 11–13 1993, Montr´eal,
`Canada.
`
`19th Workshop on Graph-Theoretic Concepts in Computer Science (WG), June 16–18, 1993,
`Utrecht, the Netherlands.
`
`2nd Workshop on Algorithms and Data Structures (WADS), August 14–16, 1991, Ottawa,
`Canada.
`
`Other Committees
`
`IEEE Computer Society Fellows Evaluation Committee, 2012
`
`Excursions in Algorithmics: A late festschrift for Franco P. Preparata, October 27-28, 2006
`Providence, Rhode Island. Co-organizer.
`
`7th Workshop on Algorithms and Data Structures (WADS 2001), August 8–10 2001, Provi-
`dence, Rhode Island. Conference Chair.
`
`3rd CGC Workshop on Computational Geometry, October 11-12, 1998, Providence, Rhode
`Island, Workshop Co-Chair.
`
`9
`
`Petitioner Apple Inc. - Exhibit 1006, p. 9
`
`

`

`Dagstuhl Workshop on Graph Algorithms and Applications, July 27–31, 1998, Dagstuhl, Ger-
`many, Workshop Co-Chair.
`
`Working group on Computational Geometry, ACM Workshop on Strategic Directions in Com-
`puting Research, Cambridge, June 14–15, 1996, Working Group Chair.
`
`Dagstuhl Workshop on Graph Algorithms and Applications, May 11–17, 1996, Dagstuhl, Ger-
`many, Workshop Co-Chair.
`
`Graph Drawing (GD ’94, DIMACS Workshop), October 10–12, 1994, Princeton, New Jersey,
`Workshop Co-Chair.
`
`Work Meeting on Graph Drawing, June 3–5 1992, Marino (Rome), Italy, Workshop Co-Chair.
`
`Editorships
`
`14-
`
`Journal of Graph Algorithms and Applications, executive committee member.
`
`96–13
`
`Journal of Graph Algorithms and Applications, editor-in-chief.
`
`96
`
`Journal of Graph Algorithms and Applications, founding editor.
`
`95–06
`
`Computational Geometry: Theory and Applications, editor.
`
`96–01
`
`IEEE Transactions on Computers, associate editor.
`
`Theoretical Computer Science, Excursions in Algorithmics: A Collection of Papers in Honor
`of Franco P. Preparata, vol. 408, no. 2–3, 2008, co-guest editor.
`
`ACM Journal of Experimental Algorithmics, Special Issue on selected papers presented at the
`2005 Workshop on Algorithm Engineering and Experimentation, vol. 12, 2008, co-guest editor.
`
`International Journal of Computational Geometry and Applications, Special Issue on selected
`papers presented at the 1997 CGC Workshop on Computational Geometry, vol. 13, no. 1,
`guest editor.
`
`Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the 1998
`Dagstuhl Seminar on Graph Algorithms and Applications vol. 5, no. 5, 2001, co-guest editor.
`
`Algorithmica, Special Issue on selected papers presented at the 1996 Dagstuhl Seminar on
`Graph Algorithms and Applications, vol. 26, no. 1, 2000, co-guest editor.
`
`Computational Geometry: Theory and Applications, Special Issue on Geometric Representa-
`tions of Graphs, vol. 9, no. 1–2, 1998, co-guest editor.
`
`Journal of Computer and System Sciences, Special Issue on selected papers presented at the
`26th ACM Symposium on Theory of Computing (STOC ’94), vol. 55, no. 1, 1997, co-guest
`editor.
`
`Algorithmica, Special Issue on Graph Drawing, vol. 16, no. 1, 1996, co-guest editor.
`
`Invited Lectures
`
`07/14 University of Utah
`
`07/14 University of California, Irvine
`
`04/14 University of Roma Tre, Italy
`
`03/14 University of California, Irvine
`
`10
`
`Petitioner Apple Inc. - Exhibit 1006, p. 10
`
`

`

`10/13
`
`SUNY Stony Brook, New York (distinguished lecture)
`
`05/13 Alta Scuola ASTRE, University of Roma Tre, Italy
`
`04/13 NetApp, Waltham, Massachusetts
`
`09/12 Workshop on Theory and Practice of Graph Drawing, Redmond, Washington
`
`04/12
`
`Stevens Institute of Technology, Hoboken, New Jersey (distinguished lecture)
`
`01/12 NetApp, Waltham, Massachusetts
`
`06/11 University of Roma Tre, Italy
`
`03/11 University of Roma Tre, Italy
`
`11/09
`
`CRA-W/CDC Workshop on Computational Geometry, Medford, Massachusetts
`
`11/09 Northwestern University, Evanston, Illinois (distinguished lecture)
`
`06/09 University of Roma Tre, Italy
`
`06/09 University of Milan Bicocca, Italy
`
`03/09 University of Roma Tre, Italy
`
`12/08
`
`Rutgers University
`
`09/08
`
`Symposium on Graph Drawing, Heraklion, Greece
`
`06/08 Yahoo! Research, Mountain View, California
`
`11/07
`
`NSF Workshop on Algorithms, Combinatorics, and Geometry, Denton, Texas
`
`12/05 University of Roma Tre, Italy
`
`03/04
`
`Purdue University
`
`12/03 University of Roma Tre, Italy
`
`09/03
`
`European Symposium on Algorithms, Budapest, Hungary
`
`5/02
`
`NSF/CBMS Regional Research Conference in Mathematical Sciences on Geometric Graph
`Theory, University of North Texas, Denton
`
`7/99
`
`VIII Encuentros de Geometria Computacional, Castellon, Spain
`
`12/98
`
`International Symposium on Algorithms and Computation, Taejon, Korea
`
`10/98 Washington University, St. Louis, Missouri
`
`9/98 Worcester Polytechnic Institute, Massachusetts
`
`7/98 University of Konstanz, Germany
`
`7/98 DIMACS Program on Network Visualization
`
`6/97 Workshop on Geometric Computing, Sophia-Antipolis, France
`
`2/97
`
`Purdue University
`
`12/96 AT&T Laboratories, Murray Hill, New Jersey
`
`8/96
`
`Eight Canadian Conference on Computational Geometry, Ottawa, Canada
`
`11
`
`Petitioner Apple Inc. - Exhibit 1006, p. 11
`
`

`

`8/96 Workshop on Orders, Algorithms and Applications (ORDAL ’96), Ottawa, Canada
`
`6/96
`
`SIAM Discrete Mathematics Conference, Baltimore, Maryland
`
`12/95 University of Seville, Spain
`
`9/95
`
`International Workshop on Constraints for Graphics and Visualization, Marseilles, France
`
`2/95
`
`Tufts University
`
`1/95 University of Rome Tor Vergata, Italy
`
`10/94
`
`IEEE Symposium on Visual Languages (VL ’94), St. Louis
`
`7/94 Workshop on Orders, Algorithms and Applications (ORDAL ’94), Lyon, France
`
`6/94
`
`Sixth Australasian Workshop on Combinatorial Algorithms, Darwin, Australia
`
`6/94 Griffith University, Brisbane, Australia
`
`6/94 University of Newcastle, Australia
`
`4/94
`
`892nd Meeting of the American Mathematical Society, Brooklyn, New York
`
`2/94
`
`Second Italian Conference on Algorithms and Complexity (CIAC ’94), Rome, Italy
`
`12/93 University of Rome La Sapienza, Italy
`
`10/93
`
`State University of New York at Buffalo
`
`11/92 Dartmouth College
`
`8/92
`
`Fourth Canadian Conference on Computational Geometry, St. John’s, Newfoundland
`
`7/92
`
`Fujitsu Laboratories, Numazu, Japan
`
`7/92
`
`Fujitsu Laboratories, Tokio, Japan
`
`6/92 University of Rome “Tor Vergata”
`
`5/92
`
`Johns Hopkins University
`
`3/92
`
`International Computer Science Institute, University of California, Berkeley
`
`3/92
`
`ALCOM Final Project Workshop, Utrecht, the Netherlands
`
`2/92
`
`Italian National Research Council, Rome
`
`11/91 University of Texas at Dallas
`
`8/91
`
`ALCOM Summer School on Efficient Algorithm Design, Aarhus, Denmark
`
`7/91
`
`Algorithms on Combinatorial Structures: International Symposium, Curtin University, Perth
`
`6/91 University of Rome, “La Sapienza”
`
`3/91
`
`Texas A&M University
`
`3/91 University of Texas at Austin
`
`12/90
`
`23rd Midwest Theory Consortium, Northwestern University
`
`11/90
`
`State University of New York, Stony Brook
`
`11/90
`
`Tulane University
`
`12
`
`Petitioner Apple Inc. - Exhibit 1006, p. 12
`
`

`

`11/90
`
`Louisiana State University
`
`11/90 University of Texas at Dallas
`
`7/90
`
`Italian National Research Council, Pisa
`
`7/90 University of Rome, “La Sapienza”
`
`5/90
`
`Conference on Computer Graphics in Pure Mathematics, Iowa City
`
`4/90
`
`14th Computational Geometry Day, New York University
`
`11/89 University of Texas at Dallas
`
`10/89 DIMACS Workshop on Geometric Complexity, Princeton University
`
`10/89
`
`Columbia University
`
`7/89
`
`Australasian Conference on Combinatorics and Computing, Brisbane
`
`6/89 University of Passau
`
`3/89
`
`IBM T.J. Watson Research Center
`
`11/88
`
`Carleton University
`
`11/88 University of Texas at Dallas
`
`10/88 Dartmouth College
`
`7/88 University of Rome, “La Sapienza”
`
`5/88 University of Michigan
`
`4/88 University of Texas at Dallas
`
`3/88 University of Ottawa
`
`12/87
`
`Italian National Research Council, Rome
`
`7/87 University of Rome, “La Sapienza”
`
`2/87 McGill University
`
`6/86 University of Rome, “La Sapienza”
`
`10/85 University of Illinois at Urbana-Champaign
`
`Professional Societies
`
`American Association for the Advancement of Science (AAAS), Fellow
`
`Association for Computing Machinery (ACM), Fellow
`
`Institute of Electrical and Electronic Engineers (IEEE), Fellow
`
`13
`
`Petitioner Apple Inc. - Exhibit 1006, p. 13
`
`

`

`Patents
`
`R. Tamassia, N. Triandopoulos, and C. Papamanthou, System and Method for Optimal Veri-
`fication of Operations on Dynamic Sets, United States Patent no. 8,572,385 B2, 2013.
`
`R. Tamassia and N. Triandopoulos, Efficient Content Authentication In Peer-To-Peer Net-
`works, United States Patent no. 7,974,221, 2011.
`
`M. T. Goodrich and R. Tamassia, Efficient authenticated dictionaries with skip lists and com-
`mutative hashing, United States Patent no. 7,257,711, 2007.
`
`Publications
`
`Books
`
`1. M. T. Goodrich, R. Tamassia and M. H. Goldwasser, Data Structures and Algorithms in Python, Wiley,
`2013.
`
`2. M. T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, Second Edition,
`Wiley, 2011.
`
`3. M. T. Goodrich and R. Tamassia, Introduction to Computer Security, Addison-Wesley, 2011.
`
`4. M. T. Goodrich and R. Tamassia, Data Structures and Algorithms in Java, Fifth Edition, Wiley, 2010.
`
`5. M. T. Goodrich and R. Tamassia, Data Structures and Algorithms in Java, Fourth Edition, Wiley,
`2005.
`
`6. M. T. Goodrich and R. Tamassia, Data Structures and Algorithms in Java, Third Edition, Wiley, 2004.
`
`7. M. T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++, Wiley, 2003.
`
`8. M. T. Goodrich and R. Tamassia, Algorithm Design, Wiley, 2002.
`
`9. M. T. Goodrich and R. Tamassia, Data Structures and Algorithms in Java, Second Edition, Wiley,
`2001.
`
`10. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing, Prentice-Hall, 1999.
`
`11. M. T. Goodrich and R. Tamassia, Data Structures and Algorithms in Java, Wiley, 1998.
`
`Edited Books
`
`12. R. Tamassia (Ed.), Handbook of Graph Drawing and Visualization, CRC Press, 2013.
`
`13. F. Dehne, J.-R. Sack, and R. Tamassia (Eds.), Algorithms and Data Structures (Proceedings of
`WADS ’01), Lecture Notes in Computer Science, vol. 2125, Springer-Verlag (2001).
`
`14. F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia (Eds.), Algorithms and Data Structures (Proceedings
`of WADS ’99), Lecture Notes in Computer Science, vol. 1663, Springer-Verlag (1999).
`
`15. F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia (Eds.), Algorithms and Data Structures (Pro-
`ceedings of WADS ’97), Lecture Notes in Computer Science, vol. 1272, Springer-Verlag (1997).
`
`16. R. Tamassia and I.G. Tollis (Eds.), Graph Drawing (Proceedings of GD ’94), Lecture Notes in Computer
`Science vol. 894, Springer-Verlag (1995).
`
`14
`
`Petitioner Apple Inc. - Exhibit 1006, p. 14
`
`

`

`Journals
`
`17. M. T. Goodrich, D. Nguyen, O. Ohrimenko, C. Papamanthou, R. Tamassia, N. Triandopoulos, C. V.
`Lopes. “Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers,” Proc.
`VLDB Endowment (PVLDB), vol. 5, no. 10, pp. 920-931, 2012.
`
`18. F. Zhou, G. Trajcevski, O. Ghica, R. Tamassia, P. Scheuermann, and A. A. Khokhar, “Deflection-Aware
`Tracking-Principal Selection in Active Wireless Sensor Networks,” IEEE Transactions on Vehicular
`Technology, vol. 61, no. 7, pp. 3240–3254, 2012.
`
`19. M. T. Goodrich, R. Tamassia, and N. Triandopoulos, “Efficient Authenticated Data Structures for
`Graph Connectivity and Geometric Search Problems,” Algorithmica, vol. 60, no. 3, pp. 505–552, 2011.
`
`20. G. Trajcevski, R. Tamassia, I. F. Cruz, P. Scheuermann, D. Hartglass, C. Zamierowski, “Ranking
`continuous nearest neighbors for uncertain trajectories,” VLDB J. vol. 20, no. 5, pp. 767–791, 2011.
`
`21. R. Tamassia, D. Yao, and W. Winsborough, “Independently Verifiable Decentralized Role-Based Del-
`egation,” IEEE Transactions on System, Man and Cybernetics, vol. 40, no. 6, pp. 1206–1219, 2010.
`
`22. A. Lysyanskaya, R. Tamassia and N. Triandopoulos, “Authenticated Error-Correcting Codes with
`Applications to Multicast Authentication,” ACM Transactions on Information and System Security,
`vol. 13, no. 2, 2010.
`
`23. D. Yao and R. Tamassia, “Compact and Anonymous Role-Based Authorization Chain,” ACM Trans-
`actions on Information and System Security, vol. 12, no. 3, article 15, pp. 1–27, 2009.
`
`24. D. Yao, K. Frikken, M. Atallah, and R. Tamassia, “Private Information: To Reveal or Not To Reveal,”
`ACM Transactions on Information and System Security, vol. 12, no. 1, article 6, pp. 1–27, 2008.
`
`25. M. T. Goodrich, R. Tamassia, and D. Yao, “Notarized Federated Identity Management for Increased
`Trust in Web Services,” Journal of Computer Security, vol. 16, no. 4, pp. 399-418, 2008.
`
`26. T. M. Chan, M. T. Goodrich, S. R. Kosaraju and R. Tamassia, “Optimizing area and aspect ratio in
`straight-line orthogonal tree drawings,” Computational Geometry: Theory and Applications vol. 23,
`no. 2, pp. 153–162, 2002.
`
`27. S. Bridgeman and R. Tamassia, “A User Study in Similarity Measures for Graph Drawing,” Journal
`of Graph Algorithms and Applications, Special Issue on Selected Papers from the 2000 Symposium on
`Graph Drawing, M. Kaufmann, ed., vol. 6, no. 3, pp. 225–254, 2002.
`
`28. A. Garg and R. Tamassia, “On the Computational Complexity of Upward and Rectilinear Planarity
`Testing,” SIAM J. Computing, vol. 31, no. 2, pp. 601–625 (2001).
`
`29. G. Di Battista, R. Tamassia, and L. Vismara, “Incremental Convex Planarity Testing,” Information
`and Computation, vol. 166, pp. 1–33 (2001).
`
`30. R. Tamassia and L. Vismara, “A case study in Algorithm Engineering for Geometric Computing,” Int.
`J. Computational Geometry & Applications, vol. 11, no. 1, pp. 15–70 (2001).
`
`31. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu and L. Vismara,
`“Drawing Directed Acyclic Graphs: An Experimental Study,” Int. J. Computational Geometry &
`Applications, vol. 10, no. 6, pp. 623–648 (2000).
`
`32. S. Bridgeman and R. Tamassia, “Difference Metrics for Interactive Orthogonal Graph Drawing Algo-
`rithms,” Journal of Graph Algorithms and Applications, special issue on selected papers from the 1998
`Symposium on Graph Drawing, G. Liotta and S. Whitesides eds., vol. 4, no. 3, pp. 47–74 (2000).
`
`33. L. Vismara, G. Di Battista, A. Garg, G. Liotta, R. Tamassia and F. Vargiu, “Experimental Studies on
`Graph Drawing Algorithms,” Software Practice and Experience, special issue on Discrete Algorithms
`Engineering, K. Weihe and D. Wagner, eds., vol. 30, pp. 1235–1284 (2000).
`
`15
`
`Petitioner Apple Inc. - Exhibit 1006, p. 15
`
`

`

`34. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara, “Turn-Regularity
`and Optimal Area Drawings of Orthogonal Representations,” Computational Geometry: Theory and
`Applications, vol. 16, no. 1, pp. 53-93 (2000).
`
`35. R. Tamassia, I. G. Tollis, and J. S. Vitter, “A Parallel Algorithm for Planar Orthogonal Grid Drawings,”
`Parallel Processing Letters, vol. 10, no. 1, pp. 141–150 (2000).
`
`36. S. Bridgeman, A. Garg, and R. Tamassia, “A Graph Drawing and Translation Service on the World
`Wide Web,” Int. J. Computational Geometry & Applications, vol. 9, no. 4–5, pp. 419–446 (1999).
`
`37. G. Barequet,C. A. Duncan, M. T. Goodrich, S. S. Bridgeman, and R. Tamassia, “Geometric Computing
`over the Internet,” IEEE Internet Computing, vol. 3, no. 2, pp. 21–29 (1999).
`
`38. R. Tamassia, “Advances in the Theory and Practice of Graph Drawing,” Theoretical Computer Science,
`special issue on selected papers from the ORDAL ’96 Workshop, I. Rival, ed., vol. 217, no.2, pp. 235-254
`(1999).
`
`39. J. E. Baker, I. F. Cruz, G. Liotta, and R. Tamassia, “Visualizing Geometric Algorithms over the Web,”
`Computational Geometry: Theory and Applications, vol. 12, no. 1–2, pp. 125–152 (1999).
`
`40. G. Di Battista, R. Tamassia, and L. Vismara, “Output-Sensitive Reporting of Disjoint Paths,” Algo-
`rithmica, vol. 23, no. 4, pp. 302–340 (1999).
`
`41. O. Devillers, G. Liotta, F. P. Preparata, and R. Tamassia, “Checking the Convexity of Polytopes and
`the Planarity of Subdivisions,” Computational Geometry: Theory and Applications, vol. 11, no. 3–4,
`pp. 187–208 (1998).
`
`42. G. Liotta, F. P. Preparata, and R. Tamassia, “Robust Proximity Queries: a