![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Gerome Miklau Gerome Miklau, Dan Suciu : Implementing a Tamper-Evident Database System. ASIAN 2005 : 28-48 Nilesh N. Dalvi , Gerome Miklau, Dan Suciu : Asymptotic Conditional Probabilities for Conjunctive Queries. ICDT 2005 : 289-305 Gerome Miklau, Dan Suciu : Managing Integrity for Data Exchanged on the Web. WebDB 2005 : 13-18 Gerome Miklau, Dan Suciu : A Formal Analysis of Information Disclosure in Data Exchange. SIGMOD Conference 2004 : 575-586 Gerome Miklau, Dan Suciu : Modeling Integrity in Data Exchange. Secure Data Management 2004 : 41-54 Todd J. Green , Ashish Gupta , Gerome Miklau, Makoto Onizuka , Dan Suciu : Processing XML streams with deterministic automata and stream indexes. ACM Trans. Database Syst. 29 (4): 752-788 (2004) Gerome Miklau, Dan Suciu : Enabling Secure Data Exchange. IEEE Data Eng. Bull. 27 (1): 34-41 (2004) Gerome Miklau, Dan Suciu : Containment and equivalence for a fragment of XPath. J. ACM 51 (1): 2-45 (2004) Todd J. Green , Gerome Miklau, Makoto Onizuka , Dan Suciu : Processing XML Streams with Deterministic Automata. ICDT 2003 : 173-189 Gerome Miklau, Dan Suciu : Controlling Access to Published Data Using Cryptography. VLDB 2003 : 898-909 Igor Tatarinov , Zachary G. Ives , Jayant Madhavan , Alon Y. Halevy , Dan Suciu , Nilesh N. Dalvi , Xin Dong , Yana Kadiyska , Gerome Miklau, Peter Mork : The Piazza peer data management project. SIGMOD Record 32 (3): 47-52 (2003) Gerome Miklau, Dan Suciu : Containment and Equivalence for an XPath Fragment. PODS 2002 : 65-76 Gerome Miklau, Dan Suciu : Cryptographically Enforced Conditional Access for XML. WebDB 2002 : 101-106 1 [ 3 ] [ 12 ] 2 [ 3 ] 3 [ 5 ] [ 8 ] 4 [ 8 ] 5 [ 3 ] 6 [ 3 ] 7 [ 3 ] 8 [ 3 ] 9 [ 3 ] 10 [ 5 ] [ 8 ] 11 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] 12 [ 3 ] ![]() ©2006 Association for Computing Machinery |