Kostas Tsichlas

From MaRDI portal
Revision as of 04:51, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Kostas Tsichlas to Kostas Tsichlas: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:494809

Available identifiers

zbMath Open tsichlas.kostasMaRDI QIDQ494809

List of research outcomes





PublicationDate of PublicationType
Investigation of Database Models for Evolving Graphs2023-10-02Paper
https://portal.mardi4nfdi.de/entity/Q58744472023-02-07Paper
Threshold-based network structural dynamics2023-01-30Paper
Batched predecessor and sorting with size-priced information in external memory2022-10-13Paper
Threshold-based network structural dynamics2022-03-22Paper
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles2021-04-19Paper
I/O-efficient 2-d orthogonal range skyline and attrition priority queues2021-01-07Paper
Dynamic layers of maxima with applications to dominating queries2021-01-07Paper
Dynamic planar range skyline queries in log logarithmic expected time2020-10-07Paper
Fully persistent B-trees2020-09-17Paper
Dynamic interpolation search revisited2020-01-17Paper
https://portal.mardi4nfdi.de/entity/Q57434242019-05-10Paper
D 3-Tree: A Dynamic Deterministic Decentralized Structure2015-11-19Paper
\(D^2\)-tree: a new overlay with deterministic bounds2015-09-02Paper
Dynamic 3-sided planar range queries with expected doubly-logarithmic time2014-03-13Paper
Improved bounds for finger search on a RAM2013-05-13Paper
ISB-tree: A new indexing scheme with efficient expected behaviour2011-01-20Paper
D2-Tree: A New Overlay with Deterministic Bounds2010-12-09Paper
Optimal finger search trees in the pointer machine2010-08-05Paper
Algorithms - ESA 20032010-03-03Paper
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time2009-12-17Paper
Scheduling algorithms for procrastinators2009-08-28Paper
Reflected min-Max heaps2009-03-23Paper
Dynamic Interpolation Search Revisited2009-03-12Paper
Purely Functional Worst Case Constant Time Catenable Sorted Lists2008-03-11Paper
Algorithms for extracting motifs from biological weighted sequences2007-10-30Paper
Algorithms and Computation2006-11-14Paper
String Processing and Information Retrieval2006-10-24Paper
Optimal finger search trees in the pointer machine2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48208712004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208722004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376952004-08-11Paper
Optimal solutions for the temporal precedence problem2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q31501812002-01-01Paper

Research outcomes over time

This page was built for person: Kostas Tsichlas