Ali Çivril

551 total citations
6 papers, 239 citations indexed

About

Ali Çivril is a scholar working on Computer Vision and Pattern Recognition, Computational Mechanics and Computational Theory and Mathematics. According to data from OpenAlex, Ali Çivril has authored 6 papers receiving a total of 239 indexed citations (citations by other indexed papers that have themselves been cited), including 3 papers in Computer Vision and Pattern Recognition, 3 papers in Computational Mechanics and 3 papers in Computational Theory and Mathematics. Recurrent topics in Ali Çivril's work include Sparse and Compressive Sensing Techniques (3 papers), Stochastic Gradient Optimization Techniques (2 papers) and Blind Source Separation Techniques (2 papers). Ali Çivril is often cited by papers focused on Sparse and Compressive Sensing Techniques (3 papers), Stochastic Gradient Optimization Techniques (2 papers) and Blind Source Separation Techniques (2 papers). Ali Çivril collaborates with scholars based in Türkiye and United States. Ali Çivril's co-authors include Malik Magdon‐Ismail, Uğur Doğrusöz and Emek Demir and has published in prestigious journals such as Information Sciences, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Ali Çivril

6 papers receiving 223 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ali Çivril Türkiye	5	81	69	66	51	31	6	239
Alex Gittens United States	11	104 1.3×	101 1.5×	192 2.9×	29 0.6×	28 0.9×	23	333
Thomas Bühler Germany	4	54 0.7×	97 1.4×	111 1.7×	79 1.5×	23 0.7×	4	293
Cameron Musco United States	8	85 1.0×	79 1.1×	176 2.7×	65 1.3×	34 1.1×	27	283
Alexander E. Litvak Canada	11	82 1.0×	23 0.3×	54 0.8×	61 1.2×	18 0.6×	43	443
Paweł Hitczenko United States	14	45 0.6×	22 0.3×	87 1.3×	61 1.2×	45 1.5×	59	568
Ashwin Pananjady United States	8	45 0.6×	20 0.3×	99 1.5×	47 0.9×	69 2.2×	28	256
Luis Rademacher United States	7	180 2.2×	98 1.4×	193 2.9×	98 1.9×	45 1.5×	26	401
Sushant Sachdeva United States	10	33 0.4×	31 0.4×	132 2.0×	154 3.0×	63 2.0×	32	307
Marko Budinich Italy	7	17 0.2×	61 0.9×	163 2.5×	108 2.1×	53 1.7×	28	341
Lorenzo Orecchia United States	11	59 0.7×	38 0.6×	141 2.1×	167 3.3×	109 3.5×	21	406

Countries citing papers authored by Ali Çivril

Since Specialization

Citations

This map shows the geographic impact of Ali Çivril's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ali Çivril with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ali Çivril more than expected).

Fields of papers citing papers by Ali Çivril

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ali Çivril. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ali Çivril. The network helps show where Ali Çivril may publish in the future.

Co-authorship network of co-authors of Ali Çivril

This figure shows the co-authorship network connecting the top 25 collaborators of Ali Çivril. A scholar is included among the top collaborators of Ali Çivril based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ali Çivril. Ali Çivril is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

6 of 6 papers shown

1.

Çivril, Ali. (2014). Column Subset Selection Problem is UG-hard. Journal of Computer and System Sciences. 80(4). 849–859. 21 indexed citations

2.

Çivril, Ali. (2013). A note on the hardness of sparse approximation. Information Processing Letters. 113(14-16). 543–545. 1 indexed citations

3.

Çivril, Ali & Malik Magdon‐Ismail. (2011). Column subset selection via sparse approximation of SVD. Theoretical Computer Science. 421. 1–14. 28 indexed citations

4.

Çivril, Ali & Malik Magdon‐Ismail. (2011). Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix. Algorithmica. 65(1). 159–176. 16 indexed citations

5.

Çivril, Ali & Malik Magdon‐Ismail. (2009). On selecting a maximum volume sub-matrix of a matrix and related problems. Theoretical Computer Science. 410(47-49). 4801–4811. 117 indexed citations

6.

Doğrusöz, Uğur, et al.. (2008). A layout algorithm for undirected compound graphs. Information Sciences. 179(7). 980–994. 56 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact