default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlex Brodsky
Person information
- affiliation: Dalhousie University, Halifax, Canada
- affiliation (2005 - 2009): University of Winnipeg, Canada
- affiliation (PhD 2003): University of British Columbia, Canada
Other persons with the same name
- Alexander Brodsky 0001
![[0000-0002-0312-2105]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-0312-2105")
— George Mason University, Fairfax, Virginia, USA (and 1 more) - Alexander Brodsky 0002 — Stevens Institute of Technology, Hoboken, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j9]Maria Virvou, Alex Brodsky, Nikolaos G. Bourbakis:
Editorial. Int. J. Artif. Intell. Tools 27(7): 1802003:1-1802003:1 (2018)- 2011
- [j8]Alex Brodsky, Faith Ellen, Philipp Woelfel:
Fully-adaptive algorithms for long-lived renaming. Distributed Comput. 24(2): 119-134 (2011) - 2008
- [j7]Jan Bækgaard Pedersen, Alex Brodsky, Jeffrey Sampson:
Approximating the buffer allocation problem using epochs. J. Parallel Distributed Comput. 68(9): 1263-1282 (2008) - [j6]Alex Brodsky, Shlomo Hoory:
Simple permutations mix even better. Random Struct. Algorithms 32(3): 274-289 (2008) - 2005
- [j5]Alex Brodsky:
An impossibility gap between width-4 and width-5 permutation branching programs. Inf. Process. Lett. 94(4): 159-164 (2005) - [j4]Alex Brodsky, Jan Bækgaard Pedersen, Alan S. Wagner:
On the complexity of buffer allocation in message passing systems. J. Parallel Distributed Comput. 65(6): 692-713 (2005) - 2003
- [j3]Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discret. Math. 262(1-3): 59-77 (2003) - 2002
- [j2]Alex Brodsky, Nicholas Pippenger:
Characterizations of 1-Way Quantum Finite Automata. SIAM J. Comput. 31(5): 1456-1478 (2002) - 2001
- [j1]Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K10 is 62. Electron. J. Comb. 8(1) (2001)
Conference and Workshop Papers
- 2021
- [c10]Angela A. Siegel, Tavis Bragg, Alexander Brodsky, Eric Poitras:
Exploring the Use of Auto-Grading Systems to Improve the Efficacy of Feedback through Small, Scaffolded Programming Assignments. ITiCSE (2) 2021: 607-608 - 2008
- [c9]Alex Brodsky:
Our brothers' keepers. PODC 2008: 430 - [c8]Alex Brodsky, Scott Lindenberg:
Our Brothers' Keepers: Secure Routing with High Performance. SSS 2008: 218-232 - 2007
- [c7]Alex Brodsky, Dmitry Brodsky:
A Distributed Content Independent Method for Spam Detection. HotBots 2007 - [c6]Alex Brodsky, Dmitry Brodsky:
Trinity: distributed defense against transient spam-bots. PODC 2007: 378-379 - 2006
- [c5]Alex Brodsky, Faith Ellen, Philipp Woelfel:
Fully-Adaptive Algorithms for Long-Lived Renaming. DISC 2006: 413-427 - 2005
- [c4]Matei David, Alex Brodsky, Faith Ellen Fich:
Restricted Stack Implementations. DISC 2005: 137-151 - 2004
- [c3]Alex Brodsky:
Reversible Circuit Realizations of Boolean Functions. IFIP TCS 2004: 67-80 - [c2]Alex Brodsky, Faith Ellen Fich:
Efficient synchronous snapshots. PODC 2004: 70-79 - 2002
- [c1]Dmitry Brodsky, Alex Brodsky, Jody Pomkoski, Shihao Gong, Michael J. Feeley, Norman C. Hutchinson:
Using File-Grain Connectivity to Implement a Peer-to-Peer File System. SRDS 2002: 318-323
Informal and Other Publications
- 2008
- [i5]Alex Brodsky, Scott Lindenberg:
Our Brothers' Keepers: Secure Routing with High Performance. CoRR abs/0808.1744 (2008) - 2003
- [i4]Alex Brodsky, Jan Bækgaard Pedersen, Alan S. Wagner:
On the Complexity of Buffer Allocation in Message Passing Systems. CoRR cs.DC/0301035 (2003) - [i3]Alex Brodsky, Nicholas Pippenger:
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function. CoRR cs.DM/0302028 (2003) - 2000
- [i2]Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K_10 is 62. CoRR cs.DM/0009023 (2000) - [i1]Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics. CoRR cs.DM/0009028 (2000)
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:25 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:
