Author:
Aminof Benjamin,Kupferman Orna,Lampert Robby
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Albers, S.: On the influence of lookahead in competitive paging algorithms. Algorithmica 18, 283–305 (1997)
2. Aminof, B., Kupferman, O., Lampert, R.: Reasoning about online algorithms with weighted automata. ACM Transactions on Algorithms 6(2) (2010)
3. Aminof, B., Kupferman, O., Lampert, R.: Rigorous Approximated Determinization of Weighted Automata. In: Proc. 26th LICS, pp. 345–354 (2011)
4. Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. FMSD 10(2-3), 171–206 (1997)
5. Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11(2), 2–14 (1994)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Using the past for resolving the future;Frontiers in Computer Science;2023-01-13
2. Learning Weighted Automata over Principal Ideal Domains;Lecture Notes in Computer Science;2020
3. Satisfiability modulo theories for process systems engineering;Computers & Chemical Engineering;2018-05
4. Learning Weighted Automata;Algebraic Informatics;2015
5. Stochastization of Weighted Automata;Mathematical Foundations of Computer Science 2015;2015