Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Tamassia, Roberto"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Melbourne shuffle: Improving oblivious storage in the cloud
Olga Ohrimenko
,
Michael T. Goodrich
,
Roberto Tamassia
,
Eli Upfal
Lecture Notes in Computer Science
8573
, 2014, pp. 556-567
Graph drawing in the cloud: Privately visualizing relational data using small working storage
Michael T. Goodrich
,
Olga Ohrimenko
,
Roberto Tamassia
Lecture Notes in Computer Science
7704
, 2013, pp. 43-54
Efficient authenticated data structures for graph connectivity and geometric search problems
Michael T. Goodrich
,
Roberto Tamassia
,
Nikos Triandopoulos
Algorithmica
60
(3), 2011, pp. 505-552
Graph drawing for security visualization
Roberto Tamassia
,
Bernardo Palazzi
,
Charalampos Papamanthou
Lecture Notes in Computer Science
5417
, 2009, pp. 2-13
Computational bounds on hierarchical data processing with applications to information security
Roberto Tamassia
,
Nikos Triandopoulos
Lecture Notes in Computer Science
3580
, 2005, pp. 153-165
GDS - A graph drawing server on the Internet
Stina Bridgeman
,
Roberto Tamassia
Mathematics and Visualization
, 2004, pp. 193-213
Curvilinear graph drawing using the force-directed method
Benjamin Finkel
,
Roberto Tamassia
Lecture Notes in Computer Science
3383
, 2004, pp. 448-453
Authenticated data structures
Roberto Tamassia
Lecture Notes in Computer Science
2832
, 2003, pp. 2-5
The graph drawing server
Stina Bridgeman
,
Roberto Tamassia
Lecture Notes in Computer Science
2265
, 2002, pp. 448-450
Time responsive external data structures for moving points
Pankaj K. Agarwal
,
Lars Arge
,
Jan Vahrenhold
Lecture Notes in Computer Science
2125
, 2001, pp. 50-61
Reporting intersecting pairs of polytopes in two and three dimensions
Pankaj K. Agarwal
,
Mark de Berg
,
Sariel Har-Peled
,
Mark H. Overmars
,
Micha Sharir
,
Jan Vahrenhold
Lecture Notes in Computer Science
2125
, 2001, pp. 122-134
On external-memory planar depth first search
Lars Arge
,
Ulrich Meyer
,
Laura Toma
,
Norbert Zeh
Lecture Notes in Computer Science
2125
, 2001, pp. 471-482
When can you fold a map?
Esther M. Arkin
,
Michael A. Bender
,
Erik D. Demaine
,
Martin L. Demaine
,
Joseph S.B. Mitchell
,
Saurabh Sethia
,
Steven S. Skiena
Lecture Notes in Computer Science
2125
, 2001, pp. 401-413
On the reflexivity of point sets
Esther M. Arkin
,
Sándor P. Fekete
,
Ferran Hurtado
,
Joseph S.B. Mitchell
,
Marc Noy
,
Vera Sacristán
,
Saurabh Sethia
Lecture Notes in Computer Science
2125
, 2001, pp. 192-204
Secure multi-party computational geometry
Mikhail J. Atallah
,
Wenliang Du
Lecture Notes in Computer Science
2125
, 2001, pp. 165-179
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
David A. Bader
,
Bernard M.E. Moret
,
Mi Yan
Lecture Notes in Computer Science
2125
, 2001, pp. 365-376
Seller-focused algorithms for online auctioning
Amitabha Bagchi
,
Amitabh Chaudhary
,
Rahul Garg
,
Michael T. Goodrich
,
Vijay Kumar
Lecture Notes in Computer Science
2125
, 2001, pp. 135-147
Optimal Möbius transformations for information visualization and meshing
Marshall Bern
,
David Eppstein
Lecture Notes in Computer Science
2125
, 2001, pp. 14-25
Optimization over zonotopes and training Support Vector Machines
Marshall Bern
,
David Eppstein
Lecture Notes in Computer Science
2125
, 2001, pp. 111-121
Optimal algorithms for two-guard walkability of simple polygons
Binay Bhattacharya
,
Asish Mukhopadhyay
,
Giri Narasimhan
Lecture Notes in Computer Science
2125
, 2001, pp. 438-449
Fast Boolean matrix multiplication for highly clustered data
Andreas Bjor̈klund
,
Andrzej Lingas
Lecture Notes in Computer Science
2125
, 2001, pp. 258-263
Admission control to minimize rejections
Avrim Blum
,
Adam Kalai
,
Jon Kleinberg
Lecture Notes in Computer Science
2125
, 2001, pp. 155-164
The grid placement problem
Prosenjit Bose
,
Anil Maheshwari
,
Pat Morin
,
Jason Morrison
Lecture Notes in Computer Science
2125
, 2001, pp. 180-191
Visual ranking of link structures
Ulrik Brandes
,
Sabine Cornelsen
Lecture Notes in Computer Science
2125
, 2001, pp. 222-233
Fast layout methods for timetable graphs
Ulrik Brandes
,
Galina Shubina
,
Roberto Tamassia
,
Dorothea Wagner
Lecture Notes in Computer Science
1984
, 2001, pp. 127-138
Seiten 1
2
3
4
5
6
7
8
9
10
>