Kostas Tsichlas

From MaRDI portal
(Redirected from Kostas Tsichlas)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Message recovery attack in NTRU through VFK lattices
Acta Informatica
2026-01-28Paper
Sequential pattern detection: similarities and differences across various fields
Data Mining and Knowledge Discovery
2025-07-22Paper
Investigation of Database Models for Evolving Graphs2023-10-02Paper
scientific article; zbMATH DE number 7651110 (Why is no real title available?)
(available as arXiv preprint)
2023-02-07Paper
Threshold-based network structural dynamics
Theoretical Computer Science
2023-01-30Paper
Batched predecessor and sorting with size-priced information in external memory
(available as arXiv preprint)
2022-10-13Paper
Threshold-based network structural dynamics
Structural Information and Communication Complexity
2022-03-22Paper
A space-optimal hidden surface removal algorithm for iso-oriented rectangles
International Journal of Foundations of Computer Science
2021-04-19Paper
I/O-efficient 2-d orthogonal range skyline and attrition priority queues
Computational Geometry
2021-01-07Paper
Dynamic layers of maxima with applications to dominating queries
Computational Geometry
2021-01-07Paper
Dynamic planar range skyline queries in log logarithmic expected time
Information Processing Letters
2020-10-07Paper
Fully persistent B-trees
Theoretical Computer Science
2020-09-17Paper
Dynamic interpolation search revisited
Information and Computation
2020-01-17Paper
Fully persistent B-trees2019-05-10Paper
\(D^{3}\)-tree: a dynamic deterministic decentralized structure
Algorithms - ESA 2015
2015-11-19Paper
\(D^2\)-tree: a new overlay with deterministic bounds
Algorithmica
2015-09-02Paper
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
Theoretical Computer Science
2014-03-13Paper
Improved bounds for finger search on a RAM
Algorithmica
2013-05-13Paper
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
2011-01-20Paper
\(D^{2}\)-tree: a new overlay with deterministic bounds
Algorithms and Computation
2010-12-09Paper
Optimal finger search trees in the pointer machine
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
2010-08-05Paper
Improved bounds for finger search on a RAM
Lecture Notes in Computer Science
2010-03-03Paper
Dynamic 3-sided planar range queries with expected doubly logarithmic time
Algorithms and Computation
2009-12-17Paper
Scheduling algorithms for procrastinators
Journal of Scheduling
2009-08-28Paper
Reflected min-Max heaps
Information Processing Letters
2009-03-23Paper
Dynamic Interpolation Search Revisited
Automata, Languages and Programming
2009-03-12Paper
Purely Functional Worst Case Constant Time Catenable Sorted Lists
Lecture Notes in Computer Science
2008-03-11Paper
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
2007-10-30Paper
Algorithms and Computation
Lecture Notes in Computer Science
2006-11-14Paper
String Processing and Information Retrieval
Lecture Notes in Computer Science
2006-10-24Paper
Optimal finger search trees in the pointer machine
Journal of Computer and System Sciences
2004-11-18Paper
scientific article; zbMATH DE number 2105039 (Why is no real title available?)2004-10-01Paper
scientific article; zbMATH DE number 2105040 (Why is no real title available?)2004-10-01Paper
scientific article; zbMATH DE number 2087049 (Why is no real title available?)2004-08-11Paper
Optimal solutions for the temporal precedence problem
Algorithmica
2002-12-01Paper
scientific article; zbMATH DE number 1809602 (Why is no real title available?)2002-01-01Paper


Research outcomes over time


This page was built for person: Kostas Tsichlas