![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Spyros Sioutas Alexis C. Kaporis , Christos Makris , Spyros Sioutas, Athanasios K. Tsakalidis , Kostas Tsichlas , Christos D. Zaroliagis : Improved Bounds for Finger Search on a RAM. ESA 2003 : 325-336 Costas S. Iliopoulos , Christos Makris , Spyros Sioutas, Athanasios K. Tsakalidis , Kostas Tsichlas : Identifying Occurrences of Maximal Pairs in Multiple Strings. CPM 2002 : 133-143 Gerth Stølting Brodal , Christos Makris , Spyros Sioutas, Athanasios K. Tsakalidis , Kostas Tsichlas : Optimal Solutions for the Temporal Precedence Problem. Algorithmica 33 (4): 494-510 (2002) Nectarios Kitsios , Christos Makris , Spyros Sioutas, Athanasios K. Tsakalidis , John Tsaknakis , Bill Vassiliadis : An optimal algorithm for reporting visible rectangles. Inf. Process. Lett. 81 (5): 283-288 (2002) Nectarios Kitsios , Christos Makris , Spyros Sioutas, Athanasios K. Tsakalidis , John Tsaknakis , Bill Vassiliadis : 2-D Spatial Indexing Scheme in Optimal Time. ADBIS-DASFAA 2000 : 107-116 Kostas Bovilas , Aspasia Kanta , Christos Makris , John Tsaknakis , Athanasios K. Tsakalidis , Jim Prentzas , Evangelos Sakkopoulos , Spyros Sioutas, Bill Vassiliadis : The Eurydices System: Objectives and Services. WebNet 2000 : 63-68 Vasilis Delis , Christos Makristos , Spyros Sioutas: A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval. ACM-GIS 1999 : 40-46 Spyros Sioutas, Athanasios K. Tsakalidis , John Tsaknakis , Bill Vassiliadis : An Index Structure for the Support of Partial and Exact Match Queries in Database Systems. ADBIS (Short Papers) 1999 : 24-30 1 [ 3 ] 2 [ 6 ] 3 [ 2 ] 4 [ 7 ] 5 [ 3 ] 6 [ 8 ] 7 [ 4 ] [ 5 ] 8 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 9 [ 2 ] 10 [ 3 ] 11 [ 3 ] 12 [ 1 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 13 [ 1 ] [ 3 ] [ 4 ] [ 5 ] 14 [ 6 ] [ 7 ] [ 8 ] 15 [ 1 ] [ 3 ] [ 4 ] [ 5 ] 16 [ 8 ] ![]() ©2004 Association for Computing Machinery |