![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Alan Nash Alan Nash, Jeffrey B. Remmel , Victor Vianu : PTIME Queries Revisited. ICDT 2005 : 274-288 Alin Deutsch , Bertram Ludäscher , Alan Nash: Rewriting Queries Using Views with Access Patterns Under Integrity Constraints. ICDT 2005 : 352-367 Alan Nash, Philip A. Bernstein , Sergey Melnik : Composition of Mappings Given by Embedded Dependencies. PODS 2005 Alan Nash, Bertram Ludäscher : Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns. EDBT 2004 : 422-440 Bertram Ludäscher , Alan Nash: Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation. ICDE 2004 : 840 Alan Nash, Bertram Ludäscher : Processing First-Order Queries under Limited Access Patterns. PODS 2004 : 307-318 Alan Nash, Russell Impagliazzo , Jeffrey B. Remmel : Universal Languages and the Power of Diagonalization. IEEE Conference on Computational Complexity 2003 : 337-346 1 [ 5 ] 2 [ 6 ] 3 [ 1 ] 4 [ 2 ] [ 3 ] [ 4 ] [ 6 ] 5 [ 5 ] 6 [ 1 ] [ 7 ] 7 [ 7 ] ![]() ©2005 Association for Computing Machinery |