default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Clifford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i3]Peter Clifford, Raphaël Clifford:
Faster classical Boson Sampling. CoRR abs/2005.04214 (2020)
2010 – 2019
- 2018
- [c8]Peter Clifford, Raphaël Clifford:
The Classical Complexity of Boson Sampling. SODA 2018: 146-155 - 2017
- [i2]Peter Clifford, Raphaël Clifford:
The Classical Complexity of Boson Sampling. CoRR abs/1706.01260 (2017) - 2013
- [j8]Ayelet Butman, Peter Clifford, Raphaël Clifford
, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42(2): 611-633 (2013) - [c7]Peter Clifford, Ioana Cosma:
A simple sketching algorithm for entropy estimation over streaming data. AISTATS 2013: 196-206 - 2012
- [j7]Douglas J. Leith, Peter Clifford, Venkataramana Badarla, David Malone:
WLAN channel selection without communication. Comput. Networks 56(4): 1424-1441 (2012) - 2011
- [p1]Oliver Mason, Mark Verwoerd, Peter Clifford:
Inference of Protein Function from the Structure of Interaction Networks. Structural Analysis of Complex Networks 2011: 439-461 - [i1]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. CoRR abs/1109.1494 (2011)
2000 – 2009
- 2007
- [j6]David Malone, Peter Clifford, Douglas J. Leith:
MAC Layer Channel Quality Measurement in 802.11. IEEE Commun. Lett. 11(2): 143-145 (2007) - [j5]Douglas J. Leith, Christopher M. Kellett, Peter Clifford, Jonathan Epperlein, Robert N. Shorten:
A non-invasive method for link upgrade planning using coarse-grained measurements. IEEE Commun. Lett. 11(12): 1037-1039 (2007) - [j4]Peter Clifford, Raphaël Clifford:
Simple deterministic wildcard matching. Inf. Process. Lett. 101(2): 53-54 (2007) - [c6]Peter Clifford, Raphaël Clifford:
Self-normalised Distance with Don't Cares. CPM 2007: 63-70 - [c5]Peter Clifford, Douglas J. Leith:
Channel Dependent Interference and Decentralized Colouring. NET-COOP 2007: 95-104 - 2006
- [j3]David Malone, Peter Clifford, Douglas J. Leith:
On buffer sizing for voice in 802.11 WLANs. IEEE Commun. Lett. 10(10): 701-703 (2006) - [c4]Douglas J. Leith, Peter Clifford:
Convergence of Distributed Learning Algorithms for Optimal Wireless Channel Allocation. CDC 2006: 2980-2985 - [c3]Peter Clifford, Ken Duffy, John Foy, Douglas J. Leith, David Malone:
Modeling 802.11e for data traffic parameter design. WiOpt 2006: 28-37 - 2005
- [j2]Douglas J. Leith, Peter Clifford, David Malone, Anthony C. H. Ng:
TCP fairness in. 802.11e WLANs. IEEE Commun. Lett. 9(11): 964-966 (2005) - [c2]Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems. CPM 2005: 68-78 - [c1]Douglas J. Leith, Peter Clifford:
Using the 802.11e EDCF to Achieve TCP Upload Fairness over WLAN Links. WiOpt 2005: 109-118 - 2004
- [j1]Peter Clifford, Richard P. Stanley:
Bottom Schur Functions. 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-04-24 22:47 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:
