MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Kostas Tsichlas" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 8 documents found, showing 1 through 8.
ATOM RSS
  • Approximate String Matching with Gaps  
  • by Maxime Crochemore, Christos Makris, Wojciech Rytter, Athanasios Tsakalidis, Kostas Tsichlas — 2002
  • …In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are sketched for each version and their time and space complexity is stated. The sp…
  • Cited by 6 (1 self) – Add To MetaCart
  • unknown title  
  • by Costas Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios Tsakalidis, Kostas Tsichlas
  • …k Abstract In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are s…
  • Add To MetaCart
  • Reflected Min-Max Heaps  
  • by Christos Makris Athanasios, Athanasios Tsakalidis, Kostas Tsichlas — 2003 — Information Processing Letters 86
  • …In this paper we present a simple and e#cient implementation of a min-max priority queue, reflected min-max priority queues. The main merits of our construction are threefold. First, the space utilization of the reflected min-max heaps is much better than the naive solution of putting two heaps b…
  • Add To MetaCart
  • Improved Bounds for Finger Search on a RAM  
  • by Alexis Kaporis, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas, Christos Zaroliagis — 2003 — In Algorithms – ESA 2003, LNCS Vol. 2832 (Springer 2003
  • …We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of computation for a large class of input distributions. The parameter d represents the number of elements (distance) between …
  • Cited by 1 (1 self) – Add To MetaCart
  • Geometric Retrieval for Grid Points in the RAM Model  
  • by Spyros Sioutas, Christos Makris, Nektarios Kitsios, George Lagogiannis, John Tsaknakis, Kostas Tsichlas, Bill Vassiliadis — Journal of Universal Computer Science
  • …Abstract: We consider the problem of d-dimensional searching (d ≥ 3) for four query types: range, partial range, exact match and partial match searching. LetN be the number of points, s be the number of keys specified in a partial match and partial range query and t be the number of points retrieved…
  • Cited by 1 (1 self) – Add To MetaCart
  • Geometric Retrieval for Grid Points in the RAM Model  
  • by Spyros Sioutas Christos, Christos Makris, Nektarios Kitsios, George Lagogiannis, John Tsaknakis, Kostas Tsichlas, Bill Vassiliadis — Journal of Universal Computer Science
  • …We consider the problem of d-dimensional searching (d 3) for four query types: range, partial range, exact match and partial match searching. Let N be the number of points, s be the number of keys specified in a partial match and partial range query and t be the number of points retrieved. We pre…
  • Add To MetaCart
  • Optimal Finger Search Trees in the Pointer  
  • by Machine Gerth Stlting, Gerth Stølting Brodal A, George Lagogiannis B, Christos Makris B, Athanasios Tsakalidis B, Kostas Tsichlas B
  • …We develop a new finger search tree with worst case constant update time in the Pointer Machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over twenty years, while many attempts by researchers were made to solve it. The result c…
  • Add To MetaCart
Help! Showing 1 through 8.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB