default search action
Brian Cloteaux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c13]Brian Cloteaux
, Vladimir Marbukh, Kamran Sayrafian
Impact of the Exposure Time and Distance Thresholds on the Performance of Automatic Contact Tracing. ICC Workshops 2023: 1701-1706 - 2022
- [c12]Kamran Sayrafian
Evaluation of the Bluetooth-based Proximity Estimation for Automatic Exposure Determination. CCNC 2022: 683-686 - [c11]Kamran Sayrafian
Impact of Using Soft Exposure Thresholds in Automatic Contact Tracing. HealthCom 2022: 1-6 - [c10]Kamran Sayrafian
On the Performance of Automatic Exposure Determination Using Bluetooth-based Proximity Estimation. ICC 2022: 3052-3057
2010 – 2019
- 2019
- [c9]Brian Cloteaux
SIS Contagion Avoidance on a Network Growing by Preferential Attachment. GRADES/NDA@SIGMOD/PODS 2019: 11:1-11:4 - 2018
- [j4]Brian Cloteaux
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - 2017
- [i2]Brian Cloteaux:
One-Pass Graphic Approximation of Integer Sequences. CoRR abs/1712.05240 (2017) - 2016
- [j3]Brian Cloteaux
Fast Sequential Creation of Random Realizations of Degree Sequences. Internet Math. 12(3): 205-219 (2016) - 2015
- [j2]Brian Cloteaux
Is This for Real? Fast Graphicality Testing. Comput. Sci. Eng. 17(6): 91-95 (2015) - 2013
- [c8]Brian Cloteaux
Limits in modeling power grid topology. NSW 2013: 16-22 - 2012
- [i1]Brian Cloteaux, Michael Drew Lamar, Elizabeth Moseman, James Shook:
Threshold Digraphs. CoRR abs/1212.1149 (2012) - 2011
- [c7]Brian Cloteaux
Extracting hierarchies with overlapping structure from network data. WSC 2011: 3335-3343 - 2010
- [c6]Brian Cloteaux
Modeling affiliations in networks. WSC 2010: 2958-2967
2000 – 2009
- 2009
- [c5]Brian Cloteaux, Desh Ranjan:
Lower Bounds for Accessing Information on Pure Pointer Machines. FCS 2009: 103-107 - [c4]Isabel Beichl, Brian Cloteaux
A Structural Approach to the Temporal Modeling of Networks. WSC 2009: 788-796 - 2008
- [c3]Isabel Beichl, Brian Cloteaux:
Generating Network Models Using the S-Metric. MSV 2008: 159-164 - [c2]Isabel Beichl, Brian Cloteaux
Measuring the effectiveness of the s-metric to produce better network models. WSC 2008: 1020-1028 - 2006
- [c1]Brian Cloteaux, Desh Ranjan:
Some Separation Results Between Classes of Pointer Algorithms. DCFS 2006: 232-240
1990 – 1999
- 1998
- [j1]Brian Cloteaux, Christoph F. Eick, Bernadette Bouchon-Meunier, Vladik Kreinovich:
From ordered beliefs to numbers: How to elicit numbers without asking for them (doable but computationally difficult). Int. J. Intell. Syst. 13(9): 801-820 (1998)
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-08-05 20:20 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: