default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCan Kizilkale
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Can Kizilkale, Rakesh Vohra
:
Constrained Trading Networks. Math. Oper. Res. 49(1): 430-440 (2024)- [c4]Yu-Wen Chen, Can Kizilkale, Murat Arcak:
Solving Monotone Variational Inequalities with Best Response Dynamics. CDC 2024: 1751-1756 - [c3]Yasin Sonmez, Can Kizilkale, Alex A. Kurzhanskiy, Murat Arcak:
Optimal Electric Vehicle Charging Station Placement as a Congestion Game Problem. ECC 2024: 693-698 - [i4]Yu-Wen Chen, Can Kizilkale, Murat Arcak:
Solving Monotone Variational Inequalities with Best Response Dynamics. CoRR abs/2409.09961 (2024) - 2022
- [j4]Can Kizilkale, Farid Rashidi Mehrabadi, Erfan Sadeqi Azer, Eva Pérez-Guijarro, Kerrie Marie, Maxwell P. Lee, Chi-Ping Day, Glenn Merlino, Funda Ergün, Aydin Buluç, Süleyman Cenk Sahinalp, Salem Malikic:
Fast intratumor heterogeneity inference from single-cell sequencing data. Nat. Comput. Sci. 2(9): 577-583 (2022) - 2021
- [c2]Mikhail Burov, Can Kizilkale, Alexander Kurzhanskiy, Murat Arcak:
Detecting Braess Routes: An Algorithm Accounting for Queuing Delays With an Extended Graph. ITSC 2021: 2125-2130 - [i3]Mikhail Burov, Can Kizilkale, Alexander Kurzhanskiy, Murat Arcak:
Detecting Braess Routes: an Algorithm Accounting for Queuing Delays With an Extended Graph. CoRR abs/2107.08374 (2021) - 2020
- [i2]Can Kizilkale, Rakesh Vohra:
Constrained Trading Networks. CoRR abs/2008.09757 (2020)
2010 – 2019
- 2019
- [b1]Can Kizilkale:
Topics in Optimization: Restarted Moment Based Methods, Underdetermined Systems and Trade Networks. University of California, Santa Barbara, USA, 2019 - 2017
- [j3]Mustafa Ç. Pinar, Can Kizilkale:
Robust screening under ambiguity. Math. Program. 163(1-2): 273-299 (2017) - 2016
- [j2]Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç:
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IEEE Trans. Computers 65(11): 3239-3250 (2016) - 2015
- [i1]Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç:
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IACR Cryptol. ePrint Arch. 2015: 742 (2015)
2000 – 2009
- 2005
- [j1]Alper T. Erdogan, Can Kizilkale:
Fast and low complexity blind equalization via subgradient projections. IEEE Trans. Signal Process. 53(7): 2513-2524 (2005) - 2004
- [c1]Can Kizilkale, Alper T. Erdogan:
Fast blind equalization method based on subgradient projections. ICASSP (4) 2004: 873-876
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 2025-03-05 20:54 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:
