{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:18:10Z","timestamp":1672427890358},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01190506","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:00:56Z","timestamp":1108728056000},"page":"245-265","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic expression trees"],"prefix":"10.1007","volume":"13","author":[{"given":"R. F.","family":"Cohen","sequence":"first","affiliation":[]},{"given":"R.","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"F. N. Afrati, D. Q. Goldin, and P. C. Kanellakis. Efficient Parallelism for Structured Data: Directed Reachability in S-P Dags, Technical Report CS-88-07, Department of Computer Science, Brown University, 1988."},{"key":"CR2","unstructured":"B. Alpern, R. Hoover, B. Rosen, P. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits,Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 32?42."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"G. Ausiello, G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths,Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 12?21.","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0214041","volume":"14","author":"S. W. Bent","year":"1985","unstructured":"S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees,SIAM J. Comput.,14 (1985), 545?568.","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/BF00259471","volume":"27","author":"A. M. Berman","year":"1990","unstructured":"A. M. Berman, M. C. Paull, and B. G. Ryder. Proving relative lower bounds for incremental algorithms,Acta Inform.,27 (1990), 665?683.","journal-title":"Acta Inform."},{"key":"CR6","first-page":"83","volume-title":"Complexity of sequential and parallel numerical algorithms","author":"R. P. Brent","year":"1973","unstructured":"R. P. Brent. The parallel evaluation of arithmetic expressions in logarithmic time, inComplexity of sequential and parallel numerical algorithms, Academic Press, New York, 1973, pp. 83?102."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent, The parallel evaluation of general arithmetic expressions,J. Assoc. Comput. Mach.,21 (1974), 201?206.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. D. Carrol and B. G. Ryder. Incremental data flow analysis via dominator and attribute updates,Proc. 15th ACM Symp. on Principles of Programming Languages, 1988, pp. 274?284.","DOI":"10.1145\/73560.73584"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"14","author":"N. Deo","year":"1984","unstructured":"N. Deo and C. Pang. Shortest-path algorithms: taxonomy and annotations,Networks,14 (1984), 275?323.","journal-title":"Networks"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia. Incremental planarity testing,Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 436?441.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D. Eppstein","year":"1992","unstructured":"D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph,J. Algorithms,13 (1992), 33?54.","journal-title":"J. Algorithms"},{"key":"CR12","first-page":"371","volume":"49","author":"S. Even","year":"1985","unstructured":"S. Even and H. Gazit. Updating distances in dynamic graphs,Methods Oper. Res.,49 (1985), 371?387.","journal-title":"Methods Oper. Res."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"G. Gallo, M. Grigoriadis, and R. E. Tarjan. A fast parametric network flow algorithm,SIAM J. Comput.,18 (1989), 30?55.","journal-title":"SIAM J. Comput."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, E. Tardos, and R. E. Tarjan. Network Flow Algorithms, Technical Report STAN-CS-89-1252, Department of Computer Science, Stanford University, 1989.","DOI":"10.21236\/ADA214689"},{"key":"CR15","unstructured":"M. T. Goodrich. Applying parallel processing techniques to classification problems in constructive solid geometry,Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 118?128."},{"key":"CR16","volume-title":"Technical Report CSE-89-21","author":"D. Gusfield","year":"1989","unstructured":"D. Gusfield and C. Martel. A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications, Technical Report CSE-89-21, Department of Computer Science and Engineering, University of California, Davis, 1989."},{"key":"CR17","first-page":"352","volume-title":"Lecture Notes in Computer Science, Vol. 382","author":"G. F. Italiano","year":"1989","unstructured":"G. F. Italiano, A. Marchetti-Spaccamela, and U. Nanni. Dynamic data structures for series-parallel graphs,Algorithms and Data Structures (Proc. WADS '89), Lecture Notes in Computer Science, Vol. 382, Springer-Verlag, Berlin, 1989, pp. 352?372."},{"key":"CR18","first-page":"869","volume-title":"Handbook of Theoretical Computer Science, Vol. A","author":"R. M. Karp","year":"1990","unstructured":"R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared memory machines, inHandbook of Theoretical Computer Science, Vol. A, Elsevier\/MIT Press, Amsterdam\/ Cambridge, MA, 1990, pp. 869?942."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E. L. Lawler","year":"1978","unstructured":"E. L. Lawler. Sequencing jobs to minimize total weighted completion time subject to precedence constraints,Ann. Discrete Math.,2 (1978), 75?90.","journal-title":"Ann. Discrete Math."},{"key":"CR20","unstructured":"C. C. Lin and R. C. Chang. On the dynamic shortest path problem,Proc. International Workshop on Discrete Algorithms and Complexity, 1989, pp. 203?212."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"W. Pugh and T. Teitelbaum. Incremental computation via function caching,Proc. 16th ACM Symp. on Principles of Programming Languages, 1989, pp. 315?328.","DOI":"10.1145\/75277.75305"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"H. Rohnert. A dynamization of the all-pairs least cost problem,Proc. STACS '85, 1985, pp. 279?286.","DOI":"10.1007\/BFb0024016"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"24","author":"D. D. Sleator","year":"1983","unstructured":"D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees,J. Comput. Systems Sci.,24 (1983), 362?381.","journal-title":"J. Comput. Systems Sci."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0204032","volume":"4","author":"P. M. Spira","year":"1975","unstructured":"P. M. Spira and A. Pan. On finding and updating spanning trees and shortest paths,SIAM J. Comput.,4 (1975), 373?380.","journal-title":"SIAM J. Comput."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"L. Stockmeyer. Optimal orientation of cells in slicing floorplan design,Inform. and Control,57 (1983), 91?101.","journal-title":"Inform. and Control"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"K. Takamizawa, T. Nishizeki, and N. Saito. Linear time computability of combinatorial problems on series-parallel graphs,J. Assoc. Comput. Mach.,29 (1982), 623?641.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BF01840401","volume":"5","author":"R. Tamassia","year":"1990","unstructured":"R. Tamassia and F. P. Preparata. Dynamic maintenance of planar digraphs, with applications,Algorithmica,5 (1990), 509?527.","journal-title":"Algorithmica"},{"key":"CR28","volume-title":"CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan.Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, CBMS, Washington, DC, 1983."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The recognition of series-parallel digraphs,SIAM J. Comput.,11 (1982), 298?313.","journal-title":"SIAM J. Comput."},{"key":"CR30","volume-title":"Aspects of Network and System Theory","author":"L. Weinberg","year":"1971","unstructured":"L. Weinberg. Linear graphs: Theorems, algorithms, and applications, inAspects of Network and System Theory, R. E. Kalman and N. DeClaris, eds., Holt, Rinehart, and Winston, New York, 1971."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190506.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190506\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:56:32Z","timestamp":1586120192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01190506"],"URL":"https:\/\/doi.org\/10.1007\/bf01190506","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}