Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Kostas Tsichlas

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yufei Tao 0001

> Home > Persons > Kostas Tsichlas

Publications

2021
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/comgeo/Kejlberg-Rasmussen21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/Kejlberg-Rasmussen21
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon:
I/O-efficient 2-d orthogonal range skyline and attrition priority queues. Comput. Geom. 93: 101689 (2021)
2013
[c21]
- view
  authority control:
- export record
  dblp key:
  - conf/pods/Kejlberg-RasmussenTTTY13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/Kejlberg-RasmussenTTTY13
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon:
I/O-efficient planar range skyline and attrition priority queues. PODS 2013: 103-114
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/Kejlberg-RasmussenTTTY13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/Kejlberg-RasmussenTTTY13
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas Tsichlas, Jeonghun Yoon:
I/O-Efficient Planar Range Skyline and Attrition Priority Queues. CoRR abs/1306.2815 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.