![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
David Pearson
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j11]Andrea Goethals, Clément Oury, David Pearson, Barbara Sierman
, Tobias Steinke:
Facing the Challenge of Web Archives Preservation Collaboratively: The Role and Work of the IIPC Preservation Working Group. D Lib Mag. 21(5/6) (2015) - 2014
- [c11]Peter McKinney, Steve Knight, Jay Gattuso, David Pearson, Libor Coufal, Kevin L. De Vorsey, David Anderson, Janet Delve, Ross Spencer, Jan Hutar:
A next generation technical registry: moving practice forward. iPRES 2014 - [c10]Sarah Slade, David Pearson, Libor Coufal:
A Digital Preservation Environment Maturity Matrix for NSLA Libraries. iPRES 2014 - [e1]Serena Coates, Ross King, Steve Knight, Christopher A. Lee, Peter McKinney, Erin O'Meara, David Pearson:
Proceedings of the 11th International Conference on Digital Preservation, iPRES 2014, Melbourne, Australia, October 6 - 10, 2014. 2014 [contents] - 2013
- [j10]Colin Webb, David Pearson, Paul Koerbin:
'Oh, you wanted us to preserve that?!' Statements of Preservation Intent for the National Library of Australia's Digital Collections. D Lib Mag. 19(1/2) (2013) - 2012
- [c9]Paul J. Goulart, Andrew Wynn
, David Pearson:
Optimal mode decomposition for high dimensional systems. CDC 2012: 4965-4970 - 2010
- [j9]Nick del Pozo, Andrew Stawowczyk Long, David Pearson:
"Land of the lost": a discussion of what can be preserved through digital preservation. Libr. Hi Tech 28(2): 290-300 (2010) - [c8]David Pearson, Sumita Mishra, Yin Pan:
Security Attacks And Defenses In Sensor Networks. Security and Management 2010: 286-292
2000 – 2009
- 2008
- [j8]Judith Pearce, David Pearson, Megan Williams, Scott Yeadon:
The Australian METS Profile - A Journey about Metadata. D Lib Mag. 14(3/4) (2008) - [j7]David Pearson, Colin Webb:
Defining File Format Obsolescence: A Risky Journey. Int. J. Digit. Curation 3(1): 89-106 (2008) - 2007
- [c7]David Pearson:
AONS II: continuing the trend towards preservation software 'Nirvana'. iPRES 2007 - [p1]Michael Wood, David Pearson, Colin Calder:
Comparing the effects of different 3D representations on human wayfinding. Location Based Services and TeleCartography 2007: 345-356 - 2005
- [j6]David Pearson:
A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33(3): 231-234 (2005) - 2003
- [c6]Mark McCartney
, David Pearson:
Social Agents in Dynamic Equilibrium. ICANNGA 2003: 256-259 - [c5]Chip Elliott, David Pearson, Gregory D. Troxel:
Quantum cryptography in practice. SIGCOMM 2003: 227-238
1990 – 1999
- 1996
- [j5]Benjamin Hao, David Pearson, Richard Zippel:
Global register allocation for SIMD multiprocessors. J. Comput. Sci. Technol. 11(3): 222-236 (1996) - [c4]Francis Hunt, David Pearson:
A condition for a unique equilibrium point in a recurrent neural network. ICNN 1996: 1308-1311 - 1995
- [c3]Benjamin Hao, David Pearson:
Instruction Scheduling and Global Register Allocation for SIMD Multiprocessors. IRREGULAR 1995: 81-86 - 1994
- [c2]Richard Johnson, David Pearson, Keshav Pingali:
The Program Structure Tree: Computing Control Regions in Linear Time. PLDI 1994: 171-185 - 1993
- [j4]David Pearson, Vijay V. Vazirani:
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. J. Algorithms 14(2): 171-179 (1993) - 1992
- [j3]Penelope A. Yates-Mercer, David Pearson:
Charging policies and practice in corporate information units in the UK 1: To charge or not to charge? J. Inf. Sci. 18(1): 11-21 (1992) - [j2]David Pearson, Penelope A. Yates-Mercer:
Charging policies and practice in corporate information units in the UK 2: How to charge. J. Inf. Sci. 18(2): 127-137 (1992) - 1990
- [j1]David Pearson, S. Unnikrishna Pillai, Youngjik Lee:
An algorithm for near-optimal placement of sensor elements. IEEE Trans. Inf. Theory 36(6): 1280-1284 (1990) - [c1]David Pearson, Vijay V. Vazirani:
A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS 1990: 225-231
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint