, An experimental analysis of self-adjusting computation, ACM Trans. Prog. Lang. Sys, vol.323, issue.1, pp.1-53, 2009.
, Adaptive functional programming, ACM Trans. Prog. Lang. Sys, vol.28, issue.6, pp.990-1034, 2006.
, Dynamizing static algorithms with applications to dynamic trees and history independence, ACM-SIAM Symposium on Discrete Algorithms, pp.531-540, 2004.
, An experimental analysis of change propagation in dynamic trees, Workshop on Algorithm Engineering and Experimentation, 2005.
, Scheduling parallel programs by work stealing with private deques, PPoPP '13, 2013.
, Parallelism in dynamic well-spaced point sets, Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, 2011.
, Dynamic wellspaced point sets, Journal of Computational Geometry: Theory and Applications, 2013.
, Kinetic mesh-refinement in 2D, SCG '11: Proceedings of the 27th Annual Symposium on Computational Geometry, 2011.
, Adaptive Bayesian inference, Neural Information Processing Systems (NIPS), 2007.
, Maintaining information in fully dynamic trees with top trees, The Computing Research Repository (CoRR)[cs.DS/0310065], 2003.
DOI : 10.1145/1103963.1103966
URL : http://arxiv.org/pdf/cs/0310065v1.pdf
, Decomposable searching problems I: Static-to-dynamic transformation, Journal of Algorithms, vol.1, issue.4, pp.301-358, 1980.
, iThreads: A threading library for parallel incremental computation, Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '15, pp.645-659, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01245884
, Incoop, Proceedings of the 2nd ACM Symposium on Cloud Computing, SOCC '11, 2011.
DOI : 10.1145/2038916.2038923
, Two for the price of one: A model for parallel and incremental computation, ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, 2011.
, Functional programming for dynamic and large data with self-adjusting computation, International Conference on Functional Programming (ICFP '14), pp.227-240, 2014.
DOI : 10.1145/2628136.2628150
URL : https://hal.archives-ouvertes.fr/hal-01100337
, Dynamic algorithms in computational geometry, Proceedings of the IEEE, pp.1412-1434, 1992.
DOI : 10.1109/5.163409
URL : http://cis.poly.edu/chiang/cg-survey.ps
, Handbook on Data Structures and Applications, chapter 36: Dynamic Graphs, 2005.
, More general parallel tree contraction: Register allocation and broadcasting in a tree, Theoretical Computer Science, vol.203, issue.1, pp.3-29, 1998.
DOI : 10.1016/S0304-3975(97)00285-5
, Parallel algorithmic techniques for combinational computation. Annual review of computer science, pp.233-283, 1988.
DOI : 10.1146/annurev.cs.03.060188.001313
, A Data Structure for Dynamically Maintaining Rooted Trees, Journal of Algorithms, vol.24, issue.1, pp.37-65, 1997.
DOI : 10.1006/jagm.1996.0835
, The implementation of the Cilk-5 multithreaded language, PLDI, pp.212-223, 1998.
, A proposal for parallel self-adjusting computation, Proceedings of the 2007 workshop on Declarative aspects of multicore architectures , DAMP '07, 2007.
DOI : 10.1145/1248648.1248651
URL : http://www.cs.cmu.edu/~damp/finalPapers/hammer.pdf
, CEAL: a C-based language for self-adjusting computation, ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009.
, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, Journal of the ACM, vol.46, issue.4, pp.502-516, 1999.
, An introduction to parallel algorithms, 1992.
, Parallel algorithms for sharedmemory machines, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), pp.869-942, 1990.
, A cost semantics for selfadjusting computation, Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages, 2009.
DOI : 10.1145/1480881.1480907
, Parallel tree contraction, part I: Fundamentals, Advances in Computing Research, vol.5, pp.47-72, 1989.
, Parallel tree contraction, part 2: Further applications, SIAM Journal on Computing, vol.20, issue.6, pp.1128-1147, 1991.
, Randomized multidimensional search trees: Lazy balancing and dynamic shuffling (extended abstract), Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, pp.180-196, 1991.
DOI : 10.1109/sfcs.1991.185368
, The Design of Dynamic Data Structures, 1983.
, Optimal parallel algorithms for multiple updates of minimum spanning trees, Algorithmica, vol.58, issue.4, pp.357-381, 1993.
DOI : 10.1002/j.1538-7305.1957.tb01515.x
, A categorized bibliography on incremental computation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.502-510, 1993.
DOI : 10.1145/158511.158710
, Optimal parallel evaluation of treestructured computations by raking (extended abstract), pp.101-110, 1988.
, Dynamic parallel tree contraction (extended abstract), SPAA, pp.114-121, 1994.
, Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel, Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15, pp.431-448, 2015.
DOI : 10.1137/1.9781611973730.30
URL : http://www.eecs.berkeley.edu/%7Ejshun/soda2015-final.pdf
, A data structure for dynamic trees, Journal of Computer and System Sciences, vol.26, issue.3, pp.362-391, 1983.
, Self-adjusting binary search trees, Journal of the ACM, vol.32, issue.3, pp.652-686, 1985.
DOI : 10.1145/3828.3835
, Adaptive exact inference in graphical models, Journal of Machine Learning, vol.8, pp.180-186, 2011.
, Self-adjusting top trees, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
, Dynamic trees as search trees via euler tours, applied to the network simplex algorithm, Mathematical Programming, pp.167-177, 1997.
DOI : 10.1137/1.9781611970265
URL : ftp://ftp.cs.princeton.edu/reports/1995/503.ps.Z
, Dynamic trees in practice, J. Exp. Algorithmics, vol.14, pp.5-9, 2010.