2012 - Fellow of the American Association for the Advancement of Science (AAAS)
2012 - ACM Fellow For contributions to graph drawing, algorithms and data structures and to computer science education.
2009 - IEEE Fellow For contributions to graph drawing and computer-science education
2006 - Edward J. McCluskey Technical Achievement Award, IEEE Computer Society For pioneering the field of graph drawing and for outstanding contributions to the design of graph and geometric algorithms
His scientific interests lie mostly in Combinatorics, Theoretical computer science, Discrete mathematics, Computer network and Planar graph. The study incorporates disciplines such as Inverse function and Upper and lower bounds in addition to Combinatorics. His Theoretical computer science research incorporates themes from Algorithm, Correctness, Representation, Computer graphics and Grid.
His Planar graph research is multidisciplinary, relying on both Planarity testing, Planar straight-line graph and Edge. His Planarity testing study integrates concerns from other disciplines, such as Graph drawing and Book embedding. His research investigates the link between Graph drawing and topics such as Graph theory that cross with problems in Slope number.
His primary areas of study are Theoretical computer science, Combinatorics, Graph drawing, Discrete mathematics and Data structure. His work in Theoretical computer science addresses subjects such as Zero-knowledge proof, which are connected to disciplines such as Verifiable secret sharing. His Combinatorics research is multidisciplinary, incorporating perspectives in Planar and Point location.
Roberto Tamassia has researched Graph drawing in several fields, including Graph database, Graph, Graph theory and Force-directed graph drawing. His study on Discrete mathematics is mostly dedicated to connecting different topics, such as Planarity testing. Roberto Tamassia works mostly in the field of Data structure, limiting it down to topics relating to Database and, in certain cases, Cloud computing.
Roberto Tamassia mostly deals with Theoretical computer science, Database, Data structure, Cloud computing and Verifiable secret sharing. His Theoretical computer science study incorporates themes from Cryptography, Zero-knowledge proof, Correctness and Set, Set operations. His work carried out in the field of Database brings together such families of science as Information retrieval, Search engine, Web crawler, Encryption and Server.
Roberto Tamassia combines subjects such as Java and Data retention with his study of Data structure. His research integrates issues of Computer security and Data integrity in his study of Verifiable secret sharing. His study explores the link between Data access and topics such as Computer network that cross with problems in Distributed computing.
Theoretical computer science, Distributed computing, Correctness, Database and Computer network are his primary areas of study. His Theoretical computer science research incorporates elements of Authentication, Algorithm, Computation, Data integrity and Data structure. His Algorithm research includes elements of SPQR tree, Graph rewriting, Graph and Force-directed graph drawing.
His studies deal with areas such as Wireless sensor network and Cloud computing as well as Distributed computing. Roberto Tamassia has included themes like Range query, Cloud computing security, Plaintext, Encryption and Server in his Database study. His work deals with themes such as Scheme, Rank and Upload, which intersect with Computer network.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Graph Drawing: Algorithms for the Visualization of Graphs
Giuseppe Di Battista;Peter Eades;Roberto Tamassia;Ioannis G. Tollis.
(1998)
Graph Drawing: Algorithms for the Visualization of Graphs
Giuseppe Di Battista;Peter Eades;Roberto Tamassia;Ioannis G. Tollis.
(1998)
Algorithms for drawing graphs: an annotated bibliography
Giuseppe Di Battista;Peter Eades;Roberto Tamassia;Ioannis G. Tollis.
Computational Geometry: Theory and Applications (1988)
Algorithms for drawing graphs: an annotated bibliography
Giuseppe Di Battista;Peter Eades;Roberto Tamassia;Ioannis G. Tollis.
Computational Geometry: Theory and Applications (1988)
Dynamic provable data possession
Chris Erway;Alptekin Küpçü;Charalampos Papamanthou;Roberto Tamassia.
computer and communications security (2009)
On embedding a graph in the grid with the minimum number of bends
Roberto Tamassia.
SIAM Journal on Computing (1987)
On embedding a graph in the grid with the minimum number of bends
Roberto Tamassia.
SIAM Journal on Computing (1987)
Data Structures and Algorithms in Java
Michael T. Goodrich;Roberto Tamassia.
(1998)
Data Structures and Algorithms in Java
Michael T. Goodrich;Roberto Tamassia.
(1998)
Automatic graph drawing and readability of diagrams
R. Tamassia;G. Di Battista;C. Batini.
systems man and cybernetics (1988)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, Irvine
Yale University
Roma Tre University
University of Crete
University of Perugia
Virginia Tech
University of Mississippi
Brown University
Harvard University
Northwestern University
Hong Kong University of Science and Technology
Tennessee Technological University
New York University
University of California, Los Angeles
University of Florida
University of Cyprus
Peking University
Biological Research Centre
University of Kent
National Academies of Sciences, Engineering, and Medicine
Niigata University
Washington University in St. Louis
Inserm : Institut national de la santé et de la recherche médicale
University of Tennessee at Knoxville
University of Oxford
University of California, Santa Barbara