| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Herbert Van de Sompel Patrick Hochstenbach , Henry Jerez , Herbert Van de Sompel: The OAI-PMH Static Repository and Static Repository Gateway. JCDL 2003 : 210- Herbert Van de Sompel, Carl Lagoze : Notes from the Interoperability Front: A Progress Report on the Open Archives Initiative. ECDL 2002 : 144-157 Herbert Van de Sompel, Donna Bergmark : A Distributed Registry for OpenURL Metadata Schemas with an OAI-PMH Conformant Central Repository. ICPP Workshops 2002 : 469-472 Michael L. Nelson , Herbert Van de Sompel, Simeon Warner : Advanced overview of version 2.0 of the open archives initiative protocol for metadata harvesting. JCDL 2002 : 418 William Y. Arms , Diane Hillmann , Carl Lagoze , Dean B. Krafft , Richard J. Marisa , John Saylor , Carol Terrizzi , Herbert Van de Sompel: A Spectrum of Interoperability: The Site for Science Prototype for the NSDL. D-Lib Magazine 8 (1): (2002) Michael L. Nelson , Herbert Van de Sompel, Carl Lagoze : Report on the 2nd Workshop on the Open Archives Initiative, Gaining Independence with e-Print Archives and OAI: 17 - 19 October 2002, CERN, Switzerland. D-Lib Magazine 8 (11): (2002) Carl Lagoze , Herbert Van de Sompel: The open archives initiative: building a low-barrier interoperability framework. JCDL 2001 : 54-62 Herbert Van de Sompel, Oren Beit-Arie : Generalizing the OpenURL Framework beyond References to Scholarly Works: The Bison-Futé Model. D-Lib Magazine 7 (7/8): (2001) Oren Beit-Arie , Miriam Blake , Priscilla Caplan , Dale Flecker , Tim Ingoldsby , Laurence W. Lannom , William H. Mischo , Edward Pentz , Sally Rogers , Herbert Van de Sompel: Linking to the Appropriate Copy: Report of a DOI-Based Prototype. D-Lib Magazine 7 (9): (2001) Miriam Blake , Herbert Van de Sompel: Just-in-Case Linking vs. Just-in-Time-Linking - the Library Without Walls Experience. ACM DL 1999 : 217-218 1 [ 6 ] 2 [ 2 ] [ 3 ] 3 [ 8 ] 4 [ 1 ] [ 2 ] 5 [ 2 ] 6 [ 2 ] 7 [ 6 ] 8 [ 10 ] 9 [ 2 ] 10 [ 10 ] 11 [ 6 ] 12 [ 4 ] [ 5 ] [ 6 ] [ 9 ] 13 [ 2 ] 14 [ 6 ] 15 [ 2 ] 16 [ 5 ] [ 7 ] 17 [ 2 ] 18 [ 2 ] 19 [ 6 ] 20 [ 6 ] 21 [ 7 ]  ©2004 Association for Computing Machinery |
