Solving Systems of Difference Constraints Incrementally
暂无分享,去创建一个
Leo Joskowicz | Raymond E. Miller | Junehwa Song | G. Ramalingam | Raymond E. Miller | G. Ramalingam | Junehwa Song | Leo Joskowicz
[1] Richard Gerber,et al. Compiling real-time programs into schedulable code , 1993, PLDI '93.
[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[3] Satish K. Tripathi,et al. Language support for the Maruti real-time system , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[4] Robert E. Tarjan,et al. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.
[5] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[6] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[7] Bowen Alpern,et al. Incremental evaluation of computational circuits , 1990, SODA '90.
[8] R. Tarjan. Amortized Computational Complexity , 1985 .
[9] Robert E. Shostak,et al. Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.
[10] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[11] Itay Meiri,et al. Combining Qualitative and Quantitative Constraints in Temporal Reasoning , 1991, Artif. Intell..
[12] Michael J. Maher,et al. Beyond Finite Domains , 1994, PPCP.
[13] Thomas W. Reps,et al. On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..
[14] Daniele Frigioni,et al. Incremental Algorithms for the Single-Source Shortest Path Problem , 1994, FSTTCS.
[15] Michelle Y. Kim,et al. Multimedia documents with elastic time , 1995, MULTIMEDIA '95.
[16] G. Ramalingam. Bounded Incremental Computation , 1996, Lecture Notes in Computer Science.
[17] Junehwa Song,et al. Interactive authoring of multimedia documents , 1996, Proceedings 1996 IEEE Symposium on Visual Languages.
[18] Insup Lee,et al. Language Constructs for Distributed Real-Time Programming , 1985, RTSS.
[19] Michael L. Fredman,et al. Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[20] Joseph Naor,et al. Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality , 1994, SIAM J. Comput..
[21] Daniele Frigioni,et al. Fully dynamic output bounded single source shortest path problem , 1996, SODA '96.
[22] Claude Le Pape. Des systèmes d'ordonnancement flexibles et opportunistes , 1988 .