![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Pedro José Marrón Susanne Bürklen , Pedro José Marrón, Kurt Rothermel : An Enhanced Hoarding Approach Based on Graph Analysis. Mobile Data Management 2004 : 358-369 Arno Wacker , Timo Heiber , Holger Cermann , Pedro José Marrón: A Fault-Tolerant Key-Distribution Scheme for Securing Wireless Ad Hoc Networks. Pervasive 2004 : 194-212 Pedro José Marrón, Georg Lausen , Martin Weber : Catalog Integration Made Easy. BTW 2003 : 98-107 Matthias Ihle , Pedro José Marrón, Georg Lausen : Processing XML on Top of Conventional Filesystems. Berliner XML Tage 2003 : 183-197 Pedro José Marrón, Georg Lausen , Martin Weber : Catalog Integration Made Easy. ICDE 2003 : 677-679 Pedro José Marrón, Georg Lausen : Efficient Cache Answerability for XPath Queries. DIWeb 2002 : 35-45 Pedro José Marrón, Georg Lausen : Efficient Cache Answerability for XPath Queries. EEXTT 2002 : 183-199 Georg Lausen , Pedro José Marrón: Adaptive Evaluation Techniques for Querying XML-based E-Catalogs. RIDE 2002 Lule Ahmedi , Pedro José Marrón, Georg Lausen : LDAP-based Ontology for Information Integration. BTW 2001 : 207-214 Lule Ahmedi , Pedro José Marrón, Georg Lausen : Ontology-based Access to heterogeneous XML Data. GI Jahrestagung (1) 2001 : 337-344 Pedro José Marrón, Georg Lausen : On Processing XML in LDAP. VLDB 2001 : 601-610 Pedro José Marrón: Design of a Middleware Service for Scalable Wide Area Network Applications. DOA 2000 : 263-272 Elke A. Rundensteiner , Harumi A. Kuno , Young-Gook Ra , Viviane Crestana-Taube , Matthew C. Jones , Pedro José Marrón: The MultiView Project: Object-Oriented View Technology and Applications. SIGMOD Conference 1996 : 555 1 [ 4 ] [ 5 ] 2 [ 13 ] 3 [ 12 ] 4 [ 1 ] 5 [ 12 ] 6 [ 10 ] 7 [ 1 ] 8 [ 1 ] 9 [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 10 [ 1 ] 11 [ 13 ] 12 [ 1 ] 13 [ 12 ] 14 [ 9 ] [ 11 ] ![]() ©2004 Association for Computing Machinery |