default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter M. Fenwick
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j22]Peter M. Fenwick:
A Note on Variable-Length Codes with Constant Hamming Weights. J. Univers. Comput. Sci. 21(9): 1136-1142 (2015)- 2012
- [j21]Peter M. Fenwick:
PPM compression without escapes. Softw. Pract. Exp. 42(2): 255-260 (2012)
2000 – 2009
- 2007
- [j20]Peter M. Fenwick:
Burrows-Wheeler compression: Principles and reflections. Theor. Comput. Sci. 387(3): 200-219 (2007) - 2003
- [c4]Peter M. Fenwick, Mark R. Titchener, Michelle Lorenz:
Burrows Wheeler - Alternatives to Move to Front. DCC 2003: 428 - 2002
- [j19]Peter M. Fenwick:
Burrows-Wheeler compression with variable length integer codes. Softw. Pract. Exp. 32(13): 1307-1316 (2002) - [j18]Peter M. Fenwick:
Variable-length integer codes based on the Goldbach conjecture, and other additive codes. IEEE Trans. Inf. Theory 48(8): 2412-2417 (2002) - 2001
- [j17]Peter M. Fenwick:
Fast string matching for multiple searches. Softw. Pract. Exp. 31(9): 815-833 (2001) - [j16]Peter M. Fenwick:
Some perils of performance prediction: a case study on pattern matching. Softw. Pract. Exp. 31(9): 835-843 (2001)
1990 – 1999
- 1999
- [c3]Mark R. Titchener, Peter M. Fenwick, M. C. Chen:
Towards a Calibrated Corpus for Compression Testing. Data Compression Conference 1999: 554 - 1998
- [j15]Peter M. Fenwick:
Symbol Ranking Text Compressors: Review and Implementation. Softw. Pract. Exp. 28(5): 547-559 (1998) - [c2]Peter M. Fenwick, Simon Brierley:
Compression of Unicode Files. Data Compression Conference 1998: 547 - 1997
- [j14]Peter M. Fenwick:
Symbol Ranking Text Compression with Shannon Recodings. J. Univers. Comput. Sci. 3(2): 70-85 (1997) - 1996
- [j13]Peter M. Fenwick:
The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements. Comput. J. 39(9): 731-740 (1996) - [j12]Peter M. Fenwick:
A New Data Structure for Cumulative Probability Tables: An Improved Frequency-to-Symbol Algorithm. Softw. Pract. Exp. 26(4): 489-490 (1996) - 1995
- [j11]Peter M. Fenwick:
High-Radix Division with Approximate Quotient-Digit Estimation. J. Univers. Comput. Sci. 1(1): 2-22 (1995) - [j10]Peter M. Fenwick:
Differential Ziv-Lempel Text Compression. J. Univers. Comput. Sci. 1(8): 591-602 (1995) - [j9]Peter M. Fenwick:
Huffman code efficiencies for extensions of sources. IEEE Trans. Commun. 43(2/3/4): 163-165 (1995) - 1994
- [j8]Peter M. Fenwick:
A New Data Structure for Cumulative Frequency Tables. Softw. Pract. Exp. 24(3): 327-336 (1994) - [j7]Peter M. Fenwick:
Corrections to "A New Data Structure for Cumulative Frequency Tables". Softw. Pract. Exp. 24(7): 677 (1994) - 1993
- [c1]Peter M. Fenwick:
Ziv-Lempel Encoding with Multi-Bit Flags. Data Compression Conference 1993: 138-147 - 1990
- [j6]Peter M. Fenwick:
Performance Measurements on a 39 km Extended Ethernet. Comput. J. 33(4): 314-322 (1990)
1980 – 1989
- 1987
- [j5]Peter M. Fenwick:
A Fast-Carry Adder with CMOS Transmission Gates. Comput. J. 30(1): 77-79 (1987) - 1985
- [j4]Peter M. Fenwick:
Some Aspects of the Dynamic Behavior of Hierarchical Memories. IEEE Trans. Computers 34(6): 570-573 (1985) - 1984
- [j3]Peter M. Fenwick:
Addressing operations for automatic data structure accessing. SIGARCH Comput. Archit. News 12(1): 44-57 (1984)
1970 – 1979
- 1972
- [j2]Peter M. Fenwick:
A Binary Representation for Decimal Numbers. Aust. Comput. J. 4(4): 146-149 (1972)
1960 – 1969
- 1969
- [j1]Peter M. Fenwick:
Binary Multiplication with Overlapped Addition Cycles. IEEE Trans. Computers 18(1): 71-74 (1969)
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:55 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:
