Year |
Citation |
Score |
2013 |
Chester S, Thomo A, Venkatesh S, Whitesides S. Indexing reverse top-k queries in two dimensions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7825: 201-208. DOI: 10.1007/978-3-642-37487-6_17 |
0.336 |
|
2012 |
Shoaran M, Thomo A, Weber J. Differential privacy in practice Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7482: 14-24. DOI: 10.1007/978-3-642-32873-2_2 |
0.304 |
|
2011 |
Chester S, Thomo A, Venkatesh S, Whitesides S. Indexing for vector projections Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6588: 367-376. DOI: 10.1007/978-3-642-20152-3_27 |
0.31 |
|
2010 |
Shoaran M, Thomo A. Certain answers and rewritings for local regular path queries on graph-structured data Acm International Conference Proceeding Series. 186-192. DOI: 10.1145/1866480.1866507 |
0.468 |
|
2009 |
Shoaran M, Thomo A. Fault-tolerant computation of distributed regular path queries Theoretical Computer Science. 410: 62-77. DOI: 10.1016/j.tcs.2008.09.061 |
0.383 |
|
2009 |
Grahne G, Thomo A. Bounded regular path queries in view-based data integration Information Processing Letters. 109: 739-744. DOI: 10.1016/J.Ipl.2009.03.011 |
0.751 |
|
2008 |
Thomo A, Venkatesh S. Rewriting of visibly pushdown languages for xml data integration International Conference On Information and Knowledge Management, Proceedings. 521-530. DOI: 10.1145/1458082.1458152 |
0.42 |
|
2008 |
Thomo A, Venkatesh S, Ye YY. Visibly pushdown transducers for approximate validation of streaming XML Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4932: 219-238. DOI: 10.1007/978-3-540-77684-0_16 |
0.417 |
|
2008 |
Grahne G, Thomo A, Wadge WW. Preferential regular path queries Fundamenta Informaticae. 89: 259-288. |
0.758 |
|
2007 |
Tamashiro M, Thomo A, Venkatesh S. Towards practically feasible answering of regular path queries in LAV data integration International Conference On Information and Knowledge Management, Proceedings. 381-390. DOI: 10.1145/1321440.1321495 |
0.453 |
|
2007 |
Grahne G, Thomo A. Boundedness of regular path queries in data integration systems Proceedings of the International Database Engineering and Applications Symposium, Ideas. 85-92. DOI: 10.1109/IDEAS.2007.4318092 |
0.758 |
|
2007 |
Barsky M, Stege U, Thomo A, Upton C. Shortest path approaches for the longest common subsequence of a set of strings Proceedings of the 7th Ieee International Conference On Bioinformatics and Bioengineering, Bibe. 327-333. DOI: 10.1109/BIBE.2007.4375584 |
0.307 |
|
2007 |
Miao Z, Stefanescu D, Thomo A. Grid-aware evaluation of regular path queries on spatial networks Proceedings - International Conference On Advanced Information Networking and Applications, Aina. 158-165. DOI: 10.1109/AINA.2007.75 |
0.345 |
|
2007 |
Shoaran M, Thomo A. Distributed multi-source regular path queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4743: 365-374. |
0.51 |
|
2006 |
Grahne G, Thomo A. Regular path queries under approximate semantics Annals of Mathematics and Artificial Intelligence. 46: 165-190. DOI: 10.1007/S10472-005-9016-8 |
0.768 |
|
2006 |
Grahne G, Thomo A, Wadge W. Preferentially annotated regular path queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4353: 314-328. DOI: 10.1007/11965893_22 |
0.753 |
|
2006 |
Stefanescu D, Thomo A. Enhanced regular path queries on semistructured databases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4254: 700-711. |
0.54 |
|
2006 |
Barsky M, Stege U, Thomo A, Upton C. A new algorithm for fast all-against-all substring matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4209: 360-366. |
0.335 |
|
2005 |
Stefanescu DC, Thomo A, Thomo L. Distributed evaluation of generalized path queries Proceedings of the Acm Symposium On Applied Computing. 1: 610-616. DOI: 10.1145/1066677.1066819 |
0.553 |
|
2004 |
Grahne G, Thomo A. Query answering and containment for regular path queries under distortions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2942: 98-115. |
0.769 |
|
2003 |
Grahne G, Thomo A. Algebraic rewritings for optimizing regular path queries Theoretical Computer Science. 296: 453-471. DOI: 10.1016/S0304-3975(02)00739-9 |
0.704 |
|
2003 |
Grahne G, Thomo A. Query Containment and Rewriting Using Views for Regular Path Queries under Constraints Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 22: 111-122. |
0.745 |
|
2003 |
Grahne G, Thomo A. New rewritings and optimizations for regular path queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2572: 242-258. |
0.708 |
|
2001 |
Grahne G, Thomo A. An optimization technique for answering regular path queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1997: 215-225. |
0.754 |
|
Show low-probability matches. |