default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNodari Sitchinava
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c27]Nodari Sitchinava
, Rolf Svenning:
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. SPAA 2024: 259-268- 2022
- [j6]Kyle Berney, Henri Casanova, Ben Karsin, Nodari Sitchinava:
Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts. IEEE Trans. Computers 71(5): 1104-1116 (2022) - [c26]Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava:
Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS 2022: 31-45 - 2021
- [c25]Michael T. Goodrich, Riko Jacob, Nodari Sitchinava:
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. SODA 2021: 2141-2153 - 2020
- [c24]Jonas Ellert, Johannes Fischer, Nodari Sitchinava:
LCP-Aware Parallel String Sorting. Euro-Par 2020: 329-342 - [c23]Kyle Berney, Nodari Sitchinava:
Engineering Worst-Case Inputs for Pairwise Merge Sort on GPUs. IPDPS 2020: 1133-1142 - [i12]Jonas Ellert, Johannes Fischer, Nodari Sitchinava:
LCP-Aware Parallel String Sorting. CoRR abs/2006.02219 (2020)
2010 – 2019
- 2019
- [c22]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [i11]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - [i10]John Iacono, Ben Karsin, Nodari Sitchinava:
A parallel priority queue with fast updates for GPU architectures. CoRR abs/1908.09378 (2019) - 2018
- [j5]Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. ACM J. Exp. Algorithmics 23 (2018) - [j4]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. J. Graph Algorithms Appl. 22(3): 431-459 (2018) - [c21]Ben Karsin, Volker Weichert, Henri Casanova, John Iacono, Nodari Sitchinava:
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. ICS 2018: 86-95 - [c20]Kyle Berney, Henri Casanova, Alyssa Higuchi, Ben Karsin, Nodari Sitchinava:
Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts. IPDPS 2018: 1070-1079 - 2017
- [c19]Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem. ALENEX 2017: 218-231 - [c18]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. GD 2017: 88-101 - [c17]Riko Jacob, Nodari Sitchinava:
Lower Bounds in the Asymmetric External Memory Model. SPAA 2017: 247-254 - [i9]Henri Casanova, John Iacono, Ben Karsin, Nodari Sitchinava, Volker Weichert:
An Efficient Multiway Mergesort for GPU Architectures. CoRR abs/1702.07961 (2017) - [i8]Nodari Sitchinava, Darren Strash:
Reconstructing Generalized Staircase Polygons with Uniform Step Length. CoRR abs/1708.09842 (2017) - 2016
- [j3]Friedhelm Meyer auf der Heide, Peter Sanders, Nodari Sitchinava:
Introduction to the Special Issue on SPAA 2014. ACM Trans. Parallel Comput. 3(1): 1:1-1:2 (2016) - 2015
- [c16]Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. ESA 2015: 13-24 - [c15]Ben Karsin, Henri Casanova, Nodari Sitchinava:
Efficient Batched Predecessor Search in Shared Memory on GPUs. HiPC 2015: 335-344 - [i7]Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. CoRR abs/1507.01391 (2015) - 2014
- [c14]Riko Jacob, Tobias Lieber, Nodari Sitchinava:
On the Complexity of List Ranking in the Parallel External Memory Model. MFCS (2) 2014: 384-395 - [c13]Peyman Afshani, Nodari Sitchinava:
I/O-Efficient Range Minima Queries. SWAT 2014: 1-12 - [i6]Riko Jacob, Tobias Lieber, Nodari Sitchinava:
On the Complexity of List Ranking in the Parallel External Memory Model. CoRR abs/1406.3279 (2014) - 2013
- [c12]Deepak Ajwani, Nodari Sitchinava:
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. ESA 2013: 25-36 - [c11]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava:
Efficient Parallel and External Matching. Euro-Par 2013: 659-670 - [c10]Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava:
On (Dynamic) Range Minimum Queries in External Memory. WADS 2013: 37-48 - [i5]Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz, Nodari Sitchinava:
Efficient Parallel and External Matching. CoRR abs/1302.4587 (2013) - [i4]Deepak Ajwani, Nodari Sitchinava:
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. CoRR abs/1306.4521 (2013) - [i3]Nodari Sitchinava, Volker Weichert:
Provably Efficient GPU Algorithms. CoRR abs/1306.5076 (2013) - 2012
- [j2]Nodari Sitchinava:
Computational geometry in the parallel external memory model. ACM SIGSPATIAL Special 4(2): 18-23 (2012) - [c9]Nodari Sitchinava, Norbert Zeh:
A parallel buffer tree. SPAA 2012: 214-223 - 2011
- [c8]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. IPDPS 2011: 1114-1123 - [c7]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. ISAAC 2011: 374-383 - [i2]Michael T. Goodrich, Nodari Sitchinava, Qin Zhang:
Sorting, Searching, and Simulation in the MapReduce Framework. CoRR abs/1101.1902 (2011) - 2010
- [c6]Deepak Ajwani, Nodari Sitchinava, Norbert Zeh:
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). ESA (2) 2010: 75-86 - [c5]Lars Arge, Michael T. Goodrich, Nodari Sitchinava:
Parallel external memory graph algorithms. IPDPS 2010: 1-11
2000 – 2009
- 2008
- [c4]Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava:
Fundamental parallel algorithms for private-cache chip multiprocessors. SPAA 2008: 197-206 - 2007
- [c3]David Eppstein, Michael T. Goodrich, Nodari Sitchinava:
Guard placement for efficient point-in-polygon proofs. SCG 2007: 27-36 - 2006
- [i1]David Eppstein, Michael T. Goodrich, Nodari Sitchinava:
Guard Placement For Wireless Localization. CoRR abs/cs/0603057 (2006) - 2004
- [c2]Nodari Sitchinava, Samitha Samaranayake, Rohit Kapur, Emil Gizdarski, Frederic Neuveux, Thomas W. Williams:
Changing the Scan Enable during Shift. VTS 2004: 73-78 - 2003
- [c1]Samitha Samaranayake, Emil Gizdarski, Nodari Sitchinava, Frederic Neuveux, Rohit Kapur, Thomas W. Williams:
A Reconfigurable Shared Scan-in Architecture. VTS 2003: 9-14 - 2002
- [j1]Samitha Samaranayake, Nodari Sitchinava, Rohit Kapur, Minesh B. Amin, Thomas W. Williams:
Dynamic Scan: Driving Down the Cost of Test. Computer 35(10): 63-68 (2002)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
