Dennis Shasha :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Dennis Shasha :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Dennis Shasha cite Dennis Shasha Ordered by citing publication [Change the order to 'ordered by cited' ]
João Pereira , Françoise Fabret , François Llirbat , Dennis Shasha Efficient Matching for Web-Based Publish/Subscribe Systems. [Citation Graph (0, 8)][DBLP ] CoopIS, 2000, pp:162-173 [Conf ] Cites:
Steve Rozen , Dennis Shasha Rationale and Design of BULK. [Citation Graph (3, 21)][DBLP ] DBPL, 1991, pp:71-85 [Conf ] Cites:
Steve Rozen , Dennis Shasha A Framework for Automating Physical Database Design. [Citation Graph (5, 18)][DBLP ] VLDB, 1991, pp:401-411 [Conf ]
Steve Rozen , Dennis Shasha Using a Relational System On Wall Street: The Good, The Bad, The Ugly, And The Ideal. [Citation Graph (5, 0)][DBLP ] Commun. ACM, 1989, v:32, n:8, pp:988-994 [Journal ]
Theodore Johnson , Dennis Shasha A Framework for the Performance Analysis of Concurrent B-tree Algorithms. [Citation Graph (7, 14)][DBLP ] PODS, 1990, pp:273-287 [Conf ] Cites:
Vladimir Lanin , Dennis Shasha A Symmetric Concurrent B-Tree Algorithm. [Citation Graph (10, 0)][DBLP ] FJCC, 1986, pp:380-389 [Conf ]
Theodore Johnson , Dennis Shasha Utilization of B-trees with Inserts, Deletes and Modifies. [Citation Graph (9, 4)][DBLP ] PODS, 1989, pp:235-246 [Conf ]
Dennis Shasha What Good are Concurrent Search Structure Algorithms for databases Anyway? [Citation Graph (11, 0)][DBLP ] IEEE Database Eng. Bull., 1985, v:8, n:2, pp:84-90 [Journal ]
Vladimir Lanin , Dennis Shasha Concurrent Set Manipulation without Locking. [Citation Graph (0, 20)][DBLP ] PODS, 1988, pp:211-220 [Conf ] Cites:
John Turek , Dennis Shasha , Sundeep Prakash Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking. [Citation Graph (0, 8)][DBLP ] PODS, 1992, pp:212-222 [Conf ] Cites:
Theodore Johnson , Dennis Shasha A Framework for the Performance Analysis of Concurrent B-tree Algorithms. [Citation Graph (7, 14)][DBLP ] PODS, 1990, pp:273-287 [Conf ]
Dennis Shasha , Nathan Goodman Concurrent Search Structure Algorithms. [Citation Graph (32, 35)][DBLP ] ACM Trans. Database Syst., 1988, v:13, n:1, pp:53-90 [Journal ]
Bin Li , Dennis Shasha Free Parallel Data Mining. [Citation Graph (0, 2)][DBLP ] SIGMOD Conference, 1998, pp:541-543 [Conf ] Cites:
Dennis Shasha Lessons from Wall Street: Case Studies in Configuration, Tuning, and Distribution (Tutorial). [Citation Graph (2, 1)][DBLP ] SIGMOD Conference, 1997, pp:498-501 [Conf ] Cites:
Dennis Shasha , Eric Simon , Patrick Valduriez Simple Rational Guidance for Chopping Up Transactions. [Citation Graph (5, 11)][DBLP ] SIGMOD Conference, 1992, pp:298-307 [Conf ] Cites:
Jason Tsong-Li Wang , Gung-Wei Chirn , Thomas G. Marr , Bruce A. Shapiro , Dennis Shasha , Kaizhong Zhang Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results. [Citation Graph (13, 23)][DBLP ] SIGMOD Conference, 1994, pp:115-125 [Conf ] Cites:
Jason Tsong-Li Wang , Dennis Shasha Query Processing for Distance Metrics. [Citation Graph (6, 20)][DBLP ] VLDB, 1990, pp:602-613 [Conf ]
Kaizhong Zhang , Dennis Shasha , Jason Tsong-Li Wang Approximate Tree Matching in the Presence of Variable Length Don't Cares. [Citation Graph (2, 0)][DBLP ] J. Algorithms, 1994, v:16, n:1, pp:33-66 [Journal ]
Kaizhong Zhang , Dennis Shasha Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. [Citation Graph (6, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1245-1262 [Journal ]
Jason Tsong-Li Wang , Kaizhong Zhang , Karpjoo Jeong , Dennis Shasha A System for Approximate Tree Matching. [Citation Graph (4, 29)][DBLP ] IEEE Trans. Knowl. Data Eng., 1994, v:6, n:4, pp:559-571 [Journal ]
Dennis Shasha , Jason Tsong-Li Wang New Techniques for Best-Match Retrieval. [Citation Graph (7, 0)][DBLP ] ACM Trans. Inf. Syst., 1990, v:8, n:2, pp:140-158 [Journal ]
Jason Tsong-Li Wang , Dennis Shasha , George Jyh-Shian Chang , Liam Relihan , Kaizhong Zhang , Girish Patel Structural Matching and Discovery in Document Databases. [Citation Graph (1, 10)][DBLP ] SIGMOD Conference, 1997, pp:560-563 [Conf ] Cites:
Jason Tsong-Li Wang , Kaizhong Zhang , Dennis Shasha Pattern Matching and Pattern Discovery in Scientific, Program, and Document Databases. [Citation Graph (1, 2)][DBLP ] SIGMOD Conference, 1995, pp:487- [Conf ]
Dennis Shasha , Kaizhong Zhang Fast Algorithms for the Unit Cost Editing Distance Between Trees. [Citation Graph (3, 0)][DBLP ] J. Algorithms, 1990, v:11, n:4, pp:581-621 [Journal ]
Kaizhong Zhang , Dennis Shasha Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. [Citation Graph (6, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1245-1262 [Journal ]
Jason Tsong-Li Wang , Kaizhong Zhang , Karpjoo Jeong , Dennis Shasha A System for Approximate Tree Matching. [Citation Graph (4, 29)][DBLP ] IEEE Trans. Knowl. Data Eng., 1994, v:6, n:4, pp:559-571 [Journal ]
Jason Tsong-Li Wang , Kaizhong Zhang , Dennis Shasha Pattern Matching and Pattern Discovery in Scientific, Program, and Document Databases. [Citation Graph (1, 2)][DBLP ] SIGMOD Conference, 1995, pp:487- [Conf ] Cites:
Steve Rozen , Dennis Shasha A Framework for Automating Physical Database Design. [Citation Graph (5, 18)][DBLP ] VLDB, 1991, pp:401-411 [Conf ] Cites:
Theodore Johnson , Dennis Shasha Some Approaches to Index Design for Cude Forests. [Citation Graph (0, 12)][DBLP ] IEEE Data Eng. Bull., 1999, v:22, n:4, pp:22-30 [Journal ] Cites:
Dennis Shasha Tuning Time Series Queries in Finance: Case Studies and Recommendations. [Citation Graph (0, 3)][DBLP ] IEEE Data Eng. Bull., 1999, v:22, n:2, pp:40-46 [Journal ] Cites:
Dennis Shasha Lessons from Wall Street: Case Studies in Configuration, Tuning, and Distribution (Tutorial). [Citation Graph (2, 1)][DBLP ] SIGMOD Conference, 1997, pp:498-501 [Conf ]
Jason Tsong-Li Wang , Kaizhong Zhang , Karpjoo Jeong , Dennis Shasha A System for Approximate Tree Matching. [Citation Graph (4, 29)][DBLP ] IEEE Trans. Knowl. Data Eng., 1994, v:6, n:4, pp:559-571 [Journal ] Cites:
Kaizhong Zhang , Dennis Shasha , Jason Tsong-Li Wang Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's. [Citation Graph (1, 0)][DBLP ] CPM, 1992, pp:151-161 [Conf ]
Jason Tsong-Li Wang , Dennis Shasha Query Processing for Distance Metrics. [Citation Graph (6, 20)][DBLP ] VLDB, 1990, pp:602-613 [Conf ]
Kaizhong Zhang , Richard Statman , Dennis Shasha On the Editing Distance Between Unordered Labeled Trees. [Citation Graph (1, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:3, pp:133-139 [Journal ]
Kaizhong Zhang , Dennis Shasha Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. [Citation Graph (6, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:6, pp:1245-1262 [Journal ]
Dennis Shasha , Jason Tsong-Li Wang New Techniques for Best-Match Retrieval. [Citation Graph (7, 0)][DBLP ] ACM Trans. Inf. Syst., 1990, v:8, n:2, pp:140-158 [Journal ]
Theodore Johnson , Dennis Shasha The Performance of Current B-Tree Algorithms. [Citation Graph (4, 30)][DBLP ] ACM Trans. Database Syst., 1993, v:18, n:1, pp:51-101 [Journal ] Cites:
Vladimir Lanin , Dennis Shasha A Symmetric Concurrent B-Tree Algorithm. [Citation Graph (10, 0)][DBLP ] FJCC, 1986, pp:380-389 [Conf ]
Nathan Goodman , Dennis Shasha Semantically-based Concurrency Control for Search Structures. [Citation Graph (10, 23)][DBLP ] PODS, 1985, pp:8-19 [Conf ]
Theodore Johnson , Dennis Shasha Utilization of B-trees with Inserts, Deletes and Modifies. [Citation Graph (9, 4)][DBLP ] PODS, 1989, pp:235-246 [Conf ]
Theodore Johnson , Dennis Shasha A Framework for the Performance Analysis of Concurrent B-tree Algorithms. [Citation Graph (7, 14)][DBLP ] PODS, 1990, pp:273-287 [Conf ]
Dennis Shasha What Good are Concurrent Search Structure Algorithms for databases Anyway? [Citation Graph (11, 0)][DBLP ] IEEE Database Eng. Bull., 1985, v:8, n:2, pp:84-90 [Journal ]
Theodore Johnson , Dennis Shasha B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. [Citation Graph (5, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:47, n:1, pp:45-76 [Journal ]
Dennis Shasha , Nathan Goodman Concurrent Search Structure Algorithms. [Citation Graph (32, 35)][DBLP ] ACM Trans. Database Syst., 1988, v:13, n:1, pp:53-90 [Journal ]
Dennis Shasha , Nathan Goodman Concurrent Search Structure Algorithms. [Citation Graph (32, 35)][DBLP ] ACM Trans. Database Syst., 1988, v:13, n:1, pp:53-90 [Journal ] Cites:
Vladimir Lanin , Dennis Shasha A Symmetric Concurrent B-Tree Algorithm. [Citation Graph (10, 0)][DBLP ] FJCC, 1986, pp:380-389 [Conf ]
Nathan Goodman , Dennis Shasha Semantically-based Concurrency Control for Search Structures. [Citation Graph (10, 23)][DBLP ] PODS, 1985, pp:8-19 [Conf ]
Dennis Shasha What Good are Concurrent Search Structure Algorithms for databases Anyway? [Citation Graph (11, 0)][DBLP ] IEEE Database Eng. Bull., 1985, v:8, n:2, pp:84-90 [Journal ]
Dennis Shasha , François Llirbat , Eric Simon , Patrick Valduriez Transaction Chopping: Algorithms and Performance Studies [Citation Graph (5, 23)][DBLP ] ACM Trans. Database Syst., 1995, v:20, n:3, pp:325-363 [Journal ] Cites: