default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHünkar Can Tunç
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Hünkar Can Tunç
, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis:
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. ASPLOS (3) 2024: 223-238- [i6]Hünkar Can Tunç, Ameya Prashant Deshmukh, Berk Çirisci, Constantin Enea, Andreas Pavlogiannis:
CSSTs: A Dynamic Data Structure for Partial Orders in Concurrent Execution Analysis. CoRR abs/2403.17818 (2024) - 2023
- [j5]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proc. ACM Program. Lang. 7(PLDI): 761-785 (2023) - [j4]Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. Proc. ACM Program. Lang. 7(PLDI): 1733-1758 (2023) - [d3]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Version 2. Zenodo, 2023 [all versions]
- [d2]Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Version 5. Zenodo, 2023 [all versions] - [d1]Hünkar Can Tunç, Umang Mathur, Andreas Pavlogiannis, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. Zenodo, 2023 - [i5]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
Sound Dynamic Deadlock Prediction in Linear Time. CoRR abs/2304.03692 (2023) - [i4]Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. CoRR abs/2304.03714 (2023) - 2022
- [c4]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
A tree clock data structure for causal orderings in concurrent executions. ASPLOS 2022: 710-725 - [c3]Georgiana Caltais, Hossein Hojjat, Mohammad Reza Mousavi, Hünkar Can Tunç:
DyNetKAT: An Algebra of Dynamic Networks. FoSSaCS 2022: 184-204 - [c2]Marcello M. Bonsangue, Georgiana Caltais, Hui Feng, Hünkar Can Tunç:
A Language-Based Causal Model for Safety. TASE 2022: 290-307 - [i3]Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan:
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. CoRR abs/2201.06325 (2022) - 2021
- [j3]Georgiana Caltais, Hünkar Can Tunç:
Explaining safety failures in NetKAT. J. Log. Algebraic Methods Program. 121: 100676 (2021) - [i2]Georgiana Caltais, Hossein Hojjat, Mohammad Reza Mousavi, Hünkar Can Tunç:
DyNetKAT: An Algebra of Dynamic Networks. CoRR abs/2102.10035 (2021) - [i1]Georgiana Caltais, Hünkar Can Tunç:
Explaining Safety Failures in NetKAT. CoRR abs/2102.12448 (2021) - 2020
- [j2]Hünkar Can Tunç, Cemal Okan Sakar, Hulya Apaydin, Gorkem Serbes, Aysegul Günduz, Melih Tutuncu, Fikret Gürgen:
Estimation of Parkinson's disease severity using speech features and extreme gradient boosting. Medical Biol. Eng. Comput. 58(11): 2757-2773 (2020)
2010 – 2019
- 2019
- [j1]Cemal Okan Sakar, Gorkem Serbes, Aysegul Günduz, Hünkar Can Tunç, Hatice Nizam, Betul Erdogdu Sakar, Melih Tutuncu, Tarkan Aydin, M. Erdem Isenkul, Hulya Apaydin:
A comparative analysis of speech signal processing algorithms for Parkinson's disease classification and the use of the tunable Q-factor wavelet transform. Appl. Soft Comput. 74: 255-263 (2019) - [c1]Merih Bozbura, Hünkar Can Tunç, Miray Endican Kusak, Cemal Okan Sakar:
Detection of e-Commerce Anomalies using LSTM-recurrent Neural Networks. DATA 2019: 217-224
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-12-13 19:13 CET 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:
