Egemen Tanin

Author: Egemen Tanin

Publications

Publication period start: 2003
Number of co-authors: 16

Co-authors

Number of publications with favourite co-authors
Leana Golubchik
2
Frantisek Brabec
3
Hanan Samet
9

Productive Colleagues

Most productive colleagues in number of publications
Hanan Samet
38
Catherine Plaisant
78
Ben Shneiderman
225

Publications

Samet, Hanan, Alborzi, Houman, Brabec, Frantisek, Esperança, Claudio, Hjaltason, Gísli R., Morgan, Frank, Tanin, Egemen (2003): Use of the SAND spatial browser for digital government applications. In Communications of the ACM, 46 (1) pp. 61-64. https://dl.acm.org/doi/10.1145/602421.602453

Tanin, Egemen, Lotem, Amnon, Haddadin, Ihab, Shneiderman, Ben, Plaisant, Catherine, Slaughter, Laura (2000): Facilitating Data Exploration with Query Previews: A Study of User Performance and Prefere. In Behaviour and Information Technology, 19 (6) pp. 393-403.

Sankaranarayanan, Jagan, Tanin, Egemen, Samet, Hanan, Brabec, Frantisek (2003): Accessing Diverse Geo-Referenced Data Sources with the SAND Spatial DBMS. In: DG.O 2003 , 2003, . https://diggov.org/dgrc/dgo2003/cdrom/DEMOS/sankaranarayanan.pdf

Samet, Hanan, Tanin, Egemen, Golubchik, Leana (2004): Scalable Data Collection Infrastructure for Digital Government Applications. In: DG.O 2004 , 2004, . https://dgrc.org/dgo2004/disc/posters/monposters/ph_samet.pdf

Samet, Hanan, Tanin, Egemen, Golubchik, Leana (2005): Scalable data collection infrastructure for digital government applications. In: Delcambre, Lois M. L., Giuliano, Genevieve (eds.) DG.O 2005 - Proceedings of the 2005 National Conference on Digital Government Research May 15-18, 2005, Atlanta, Georgia, USA. pp. 305-306. https://doi.acm.org/10.1145/1065226.1065333

Sankaranarayanan, Jagan, Tanin, Egemen, Samet, Hanan, Brabec, Frantisek (2003): Accessing Diverse Geo-Referenced Data Sources with the SAND Spatial DBMS. In: DG.O 2003 , 2003, . https://diggov.org/dgrc/dgo2003/cdrom/POSTERS/sankaranarayanan.pdf

Tanin, Egemen, Harwood, Aaron, Samet, Hanan (2004): Indexing Distributed Complex Data for Complex Queries. In: DG.O 2004 , 2004, . https://dgrc.org/dgo2004/disc/presentations/statistics/tanin.pdf

Tanin, Egemen, Nayar, Deepa, Samet, Hanan (2005): An efficient nearest neighbor algorithm for P2P settings. In: Delcambre, Lois M. L., Giuliano, Genevieve (eds.) DG.O 2005 - Proceedings of the 2005 National Conference on Digital Government Research May 15-18, 2005, Atlanta, Georgia, USA. pp. 21-28. https://doi.acm.org/10.1145/1065226.1065237

Tanin, Egemen, Samet, Hanan (2002): APPOINT: An Approach for Peer-to-Peer Offloading the INTERnet. In: DG.O 2002 , 2002, . https://diggov.org/library/library/pdf/tanin.pdf

Tanin, Egemen, Samet, Hanan (2003): Improving Access to Large Volumes of Online Data. In: DG.O 2003 , 2003, . https://diggov.org/dgrc/dgo2003/cdrom/PAPERS/diglib_archives/tanin_samet.pdf

Tanin, Egemen, Beigel, Richard, Shneiderman, Ben (1997): Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Inte. In: InfoVis 1997 - IEEE Symposium on Information Visualization October 18-25, 1997, Phoenix, AZ, USA. pp. 81-86. https://csdl.computer.org/comp/proceedings/infovis/1997/8189/00/81890081abs.htm

New to UX Design? We're Giving You a Free eBook!

The Basics of User Experience Design

Download our free ebook “The Basics of User Experience Design” to learn about core concepts of UX design.

In 9 chapters, we’ll cover: conducting user interviews, design thinking, interaction design, mobile UX design, usability, UX research, and many more!

A valid email address is required.
314,847 designers enjoy our newsletter—sure you don’t want to receive it?

New to UX Design? We're Giving You a Free eBook!

The Basics of User Experience Design

Download our free ebook “The Basics of User Experience Design” to learn about core concepts of UX design.

In 9 chapters, we’ll cover: conducting user interviews, design thinking, interaction design, mobile UX design, usability, UX research, and many more!

A valid email address is required.
314,847 designers enjoy our newsletter—sure you don’t want to receive it?