Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference32 articles.
1. Reachability is harder for directed than for undirected finite graphs;Ajtai;J. Symbolic Logic,1990
2. Foundations of Databases;Abiteboul,1995
3. Maintenance of stratified databases viewed as a belief revision system;Apt,1987
4. Determining uniconnectivity in directed graphs;Buchsbaum;Inform. Process. Lett.,1993
5. Efficiency updating materialized views;Blakeley,1986
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Complexity of Parity Exists Queries;Logical Methods in Computer Science;2021-11-16
2. VIEW;Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing;2019-04-08
3. Maintenance of datalog materialisations revisited;Artificial Intelligence;2019-04
4. Dynamic Complexity under Definable Changes;ACM Transactions on Database Systems;2018-11-26
5. Reachability Is in DynFO;Journal of the ACM;2018-09-18