default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Hegarty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i7]Peter Hegarty, Anders Martinsson, Edvin Wedin:
The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments. CoRR abs/1803.00823 (2018)- 2016
- [c2]Peter Hegarty, Anders Martinsson, Dmitry Zhelezov:
When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration? ICDCN 2016: 2:1-2:8 - 2015
- [j12]Peter Hegarty, Anders Martinsson:
Permutations Destroying Arithmetic Progressions in Finite Cyclic Groups. Electron. J. Comb. 22(4): 4 (2015) - [j11]Edvin Wedin, Peter Hegarty:
A Quadratic Lower Bound for the Convergence Rate in the One-Dimensional Hegselmann-Krause Bounded Confidence Dynamics. Discret. Comput. Geom. 53(2): 478-486 (2015) - [j10]Edvin Wedin, Peter Hegarty:
The Hegselmann-Krause Dynamics for the Continuous-Agent Model and a Regular Opinion Function Do Not Always Lead to Consensus. IEEE Trans. Autom. Control. 60(9): 2416-2421 (2015) - 2014
- [j9]Peter Hegarty, Dmitry Zhelezov:
On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices. Comb. Probab. Comput. 23(3): 449-459 (2014) - [p1]Peter Hegarty, Dmitry Zhelezov:
Can connected commuting graphs of finite groups have arbitrarily large diameter? Geometry, Structure and Randomness in Combinatorics 2014: 141-144 - [i6]Edvin Wedin, Peter Hegarty:
The Hegselmann-Krause dynamics for continuous agents and a regular opinion function do not always lead to consensus. CoRR abs/1402.7184 (2014) - [i5]Edvin Wedin, Peter Hegarty:
A quadratic lower bound for the convergence rate in the one-dimensional Hegselmann-Krause bounded confidence dynamics. CoRR abs/1406.0769 (2014) - [i4]Peter Hegarty, Edvin Wedin:
The Hegselmann-Krause dynamics for equally spaced agents. CoRR abs/1406.0819 (2014) - [i3]Peter Hegarty, Anders Martinsson, Edvin Wedin:
The Hegselmann-Krause dynamics on the circle converge. CoRR abs/1410.7330 (2014) - 2013
- [j8]Peter Hegarty:
Permutations all of whose patterns of a given length are distinct. J. Comb. Theory A 120(7): 1663-1671 (2013) - [i2]Peter Hegarty, Anders Martinsson, Dmitry Zhelezov:
A variant of the multi-agent rendezvous problem. CoRR abs/1306.5166 (2013) - 2012
- [i1]Peter Hegarty:
On the notion of balance in social network analysis. CoRR abs/1212.4303 (2012) - 2011
- [j7]Peter Hegarty:
A Cauchy-Davenport Type Result for Arbitrary Regular Graphs. Integers 11: A19 (2011) - [j6]Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel:
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412(8-10): 729-735 (2011) - 2010
- [j5]Peter Dukes
, Peter Hegarty, Sarada Herke:
On the Possible Orders of a Basis for a Finite Cyclic Group. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j4]Peter Hegarty, Steven J. Miller:
When almost all sets are difference dominated. Random Struct. Algorithms 35(1): 118-136 (2009) - 2007
- [j3]Peter Hegarty:
Extremal Subsets of {1, ..., n} Avoiding Solutions to Linear Equations in Three Variables. Electron. J. Comb. 14(1) (2007) - 2006
- [c1]Peter Hegarty, Carmen Buechel, Simon Ungar:
Androcentric Preferences for Visuospatial Representations of Gender Differences. Diagrams 2006: 263-266 - 2005
- [j2]Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. Electron. J. Comb. 12 (2005) - 2004
- [j1]Peter Hegarty:
Permutations Avoiding Arithmetic Patterns. Electron. J. Comb. 11(1) (2004)
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-06-10 21:23 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:
