default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHüseyin Acan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Hüseyin Acan
, Alan M. Frieze, Boris G. Pittel:
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. J. Appl. Probab. 59(2): 299-324 (2022)- [j12]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928: 151-166 (2022) - 2021
- [j11]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Encodings for Families of Interval Graphs. Algorithmica 83(3): 776-794 (2021) - [j10]Hüseyin Acan, Charles F. Burnette, Sean Eberhard, Eric Schmutz, James Thomas:
Permutations with equal orders. Comb. Probab. Comput. 30(5): 800-810 (2021) - [c4]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132 - 2020
- [j9]Hüseyin Acan, Boris G. Pittel:
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph. Random Struct. Algorithms 56(1): 37-62 (2020) - [i3]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR abs/2010.04333 (2020)
2010 – 2019
- 2019
- [j8]Hüseyin Acan, Pat Devlin, Jeff Kahn:
Proof of an entropy conjecture of Leighton and Moitra. J. Comb. Theory A 161: 299-308 (2019) - [j7]Hüseyin Acan, Jeff Kahn:
Disproof of a packing conjecture of Alon and Spencer. Random Struct. Algorithms 55(3): 531-544 (2019) - [c3]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. WADS 2019: 1-13 - [i2]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. CoRR abs/1902.09228 (2019) - 2017
- [j6]Hüseyin Acan:
On a uniformly random chord diagram and its intersection graph. Discret. Math. 340(8): 1967-1985 (2017) - [j5]Hüseyin Acan, Boris G. Pittel:
Formation of a giant component in the intersection graph of a random chord diagram. J. Comb. Theory B 125: 33-79 (2017) - [j4]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumor Spreading. SIAM J. Discret. Math. 31(2): 647-668 (2017) - 2016
- [j3]Hüseyin Acan, Pawel Hitczenko:
On random trees obtained from permutation graphs. Discret. Math. 339(12): 2871-2883 (2016) - 2015
- [j2]Hüseyin Acan, Pawel Hitczenko:
On the covariances of outdegrees in random plane recursive trees. J. Appl. Probab. 52(3): 904-907 (2015) - [c2]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract]. PODC 2015: 405-412 - 2014
- [i1]Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nick Wormald:
On the push&pull protocol for rumour spreading. CoRR abs/1411.0948 (2014) - 2013
- [j1]Hüseyin Acan, Boris G. Pittel:
On the connected components of a random permutation graph with a given number of edges. J. Comb. Theory A 120(8): 1947-1975 (2013)
2000 – 2009
- 2006
- [c1]Hüseyin Acan, Kamer Kaya, Ali Aydin Selçuk:
Capture Resilient ElGamal Signature Protocols. ISCIS 2006: 943-951
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-10-07 21:13 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:
