Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSinan G. Aksoy
Person information
- affiliation: University of California San Diego, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Svitlana Volkova
, Dustin Arendt, Emily Saldanha, Maria Glenski, Ellyn Ayton, Joseph Cottam, Sinan Aksoy, Brett Jefferson, Karthnik Shrivaram:
Explaining and predicting human behavior and social dynamics in simulated virtual worlds: reproducibility, generalizability, and robustness of causal discovery methods. Comput. Math. Organ. Theory 29(1): 220-241 (2023)- [c11]Jim Follum, Sinan Aksoy, Sraddhanjoli Bhadra, John Buckheit, Nick Betzsold, Tianzhixi Yin, Tamara Becejac:
The Circular Variance as a Visual Summary of Synchronized Voltage Angle Measurements. HICSS 2023: 2612-2621 - [i16]Sinan G. Aksoy, Ryan Bennink, Yuzhou Chen, José Frías, Yulia R. Gel, Bill Kay, Uwe Naumann, Carlos Ortiz Marrero, Anthony V. Petyuk, Sandip Roy, Ignacio Segovia-Dominguez, Nate Veldt, Stephen J. Young:
Seven open problems in applied combinatorics. CoRR abs/2303.11464 (2023) - 2022
- [c10]Koby Hayashi, Sinan G. Aksoy, Haesun Park:
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. Big Data 2022: 555-564 - [c9]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Brenda Praggastis, Assefaw H. Gebremedhin:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. IPDPS 2022: 784-794 - [c8]Stephen J. Young, Sinan Aksoy, Jesun Firoz, Roberto Gioiosa, Tobias Hagge, Mark Kempton, Juan Escobedo, Mark Raugas:
SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks. IPDPS 2022: 1040-1050 - [i15]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Assefaw H. Gebremedhin, Brenda Praggastis:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. CoRR abs/2201.11326 (2022) - [i14]Koby Hayashi, Sinan G. Aksoy, Haesun Park:
Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs. CoRR abs/2203.01388 (2022) - 2021
- [j10]Sinan G. Aksoy, Mark Kempton, Stephen J. Young:
Spectral Threshold for Extremal Cyclic Edge-Connectivity. Graphs Comb. 37(6): 2079-2093 (2021) - [j9]Sinan G. Aksoy, Paul J. Bruillard, Stephen J. Young, Mark Raugas:
Ramanujan graphs and the spectral gap of supercomputing topologies. J. Supercomput. 77(2): 1177-1213 (2021) - [c7]Xu T. Liu, Jesun Firoz, Andrew Lumsdaine, Cliff A. Joslyn, Sinan Aksoy, Brenda Praggastis, Assefaw H. Gebremedhin:
Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs. HiPC 2021: 312-321 - [i13]Sinan Aksoy, Stephen J. Young, Jesun Firoz, Roberto Gioiosa, Mark Raugas, Juan Escobedo:
SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks. CoRR abs/2104.11725 (2021) - 2020
- [j8]Sinan G. Aksoy, Cliff A. Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, Emilie Purvine:
Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9(1): 16 (2020) - [c6]Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park:
Hypergraph Random Walks, Laplacians, and Clustering. CIKM 2020: 495-504 - [c5]Xiaoyuan Fan, Sinan Aksoy, Dexin Wang, Qiuhua Huang, James Ogle, Ahmad Tbaileh, Renke Huang:
Automated Realistic Testbed Synthesis for Power System Communication Networks based on Graph Metrics. ISGT 2020: 1-5 - [c4]Cliff A. Joslyn, Sinan Aksoy, Dustin Arendt, Jesun Firoz, Louis Jenkins, Brenda Praggastis, Emilie Purvine, Marcin Zalewski:
Hypergraph Analytics of Domain Name System Relationships. WAW 2020: 1-15 - [i12]Cliff A. Joslyn, Sinan Aksoy, Tiffany J. Callahan, Lawrence E. Hunter, Brett A. Jefferson, Brenda Praggastis, Emilie A. H. Purvine, Ignacio J. Tripodi:
Hypernetwork Science: From Multidimensional Networks to Computational Topology. CoRR abs/2003.11782 (2020) - [i11]Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park:
Hypergraph Random Walks, Laplacians, and Clustering. CoRR abs/2006.16377 (2020) - [i10]Sinan G. Aksoy, Emilie Purvine, Stephen J. Young:
Directional Laplacian Centrality for Cyber Situational Awareness. CoRR abs/2008.04357 (2020)
2010 – 2019
- 2019
- [j7]Sinan G. Aksoy, Kathleen E. Nowak, Emilie Purvine, Stephen J. Young:
Relative Hausdorff distance for network analysis. Appl. Netw. Sci. 4(1): 80:1-80:25 (2019) - [j6]Sinan G. Aksoy, Emilie Purvine, Eduardo Cotilla Sanchez, Mahantesh Halappanavar:
A generative graph model for electrical infrastructure networks. J. Complex Networks 7(1): 128-162 (2019) - [j5]Sinan G. Aksoy, Kathleen Nowak, Stephen J. Young:
A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance. SIAM J. Math. Data Sci. 1(4): 647-666 (2019) - [i9]Sinan G. Aksoy, Kathleen E. Nowak, Stephen J. Young:
A linear-time algorithm and analysis of graph Relative Hausdorff distance. CoRR abs/1903.01682 (2019) - [i8]Sinan G. Aksoy, Kathleen E. Nowak, Emilie Purvine, Stephen J. Young:
Relative Hausdorff Distance for Network Analysis. CoRR abs/1906.04936 (2019) - [i7]Sinan G. Aksoy, Cliff A. Joslyn, Carlos Ortiz Marrero, Brenda Praggastis, Emilie Purvine:
Hypernetwork Science via High-Order Hypergraph Walks. CoRR abs/1906.11295 (2019) - [i6]Sinan G. Aksoy, Paul J. Bruillard, Stephen J. Young, Mark Raugas:
Ramanujan Graphs and the Spectral Gap of Supercomputing Topologies. CoRR abs/1909.11694 (2019) - 2018
- [j4]Sinan G. Aksoy, Fan Chung, Michael Tait, Josh Tobin:
The maximum relaxation time of a random walk. Adv. Appl. Math. 101: 1-14 (2018) - [c3]Emilie Purvine, Sinan G. Aksoy, Cliff A. Joslyn, Kathleen Nowak, Brenda Praggastis, Michael Robinson:
A Topological Approach to Representational Data Models. HCI (4) 2018: 90-109 - [c2]Louis Jenkins, Tanveer Hossain Bhuiyan, Sarah Harun, Christopher Lightsey, David Mentgen, Sinan G. Aksoy, Timothy Stavcnger, Marcin Zalewski, Hugh R. Medal, Cliff A. Joslyn:
Chapel HyperGraph Library (CHGL). HPEC 2018: 1-6 - 2017
- [j3]Sinan Aksoy, Tamara G. Kolda, Ali Pinar:
Measuring and modeling bipartite graphs with community structure. J. Complex Networks 5(4): 581-603 (2017) - [i5]Sinan G. Aksoy, Emilie Purvine, Eduardo Cotilla Sanchez, Mahantesh Halappanavar:
A generative graph model for electrical infrastructure networks. CoRR abs/1711.11098 (2017) - 2016
- [j2]Sinan Aksoy, Fan Chung, Xing Peng:
Extreme values of the stationary distribution of random walks on directed graphs. Adv. Appl. Math. 81: 128-155 (2016) - [j1]Sinan Aksoy, Paul Horn:
Graphs with Many Strong Orientations. SIAM J. Discret. Math. 30(2): 1269-1282 (2016) - [i4]Sinan Aksoy, Tamara G. Kolda, Ali Pinar:
Measuring and Modeling Bipartite Graphs with Community Structure. CoRR abs/1607.08673 (2016) - 2013
- [i3]Sinan Aksoy, Alexander Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu:
School Choice as a One-Sided Matching Problem: Cardinal Utilities and Optimization. CoRR abs/1304.7413 (2013) - 2012
- [c1]Gizem Karaali, Sinan Aksoy, Adam Azzam, Chaya Coppersmith, Julie Glass, Xueying Zhao, Xinjing Zhu:
A Cost-Minimizing Algorithm for School Choice. ISAIM 2012 - 2011
- [i2]Sinan Aksoy, Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu:
Coalitions and Cliques in the School Choice Problem. CoRR abs/1104.5474 (2011) - 2010
- [i1]Sinan Aksoy, Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu:
A Cost-Minimizing Algorithm for School Choice. CoRR abs/1010.2312 (2010)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-05-15 01:18 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:
