![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Navendu Jain Navendu Jain, Michael Dahlin , Renu Tewari : TAPER: Tiered Approach for Eliminating Redundancy in Replica Synchronization. FAST 2005 Navendu Jain, Michael Dahlin , Renu Tewari : Using Bloom Filters to Refine Web Search Results. WebDB 2005 : 25-30 Peter Niebert , Moez Mahfoudh , Eugene Asarin , Marius Bozga , Oded Maler , Navendu Jain: Verification of Timed Automata via Satisfiability Checking. FTRTFT 2002 : 225-244 1 [ 1 ] 2 [ 1 ] 3 [ 2 ] [ 3 ] 4 [ 1 ] 5 [ 1 ] 6 [ 1 ] 7 [ 2 ] [ 3 ] ![]() ©2006 Association for Computing Machinery |