B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, 313(1):17--29, Feb. 2004. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Representing Arithmetic Constraints with Automata: An Overview - Boigelot, Wolper (2002) Self-citation (Boigelot) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. In Proc. International Conference on Implementations and Applications of Automata, Lecture Notes in Computer Science, Pretoria, South Africa, July 2001. Springer-Verlag. To appear.
Representing Arithmetic Constraints with Finite Automata: An.. - Boigelot, Wolper (2002) (5 citations) Self-citation (Boigelot) (Correct)
....any number of occurrences of u, thanks to a simple construction, and the process is repeated for other u. The drawback of this approach is its systematic cost in O(2 ) which limits is applicability to problems with a very small vector dimension. An improved algorithm has been developed [BL01] in which subsets of sign headers that are not distinguished by the automaton (in the sense that their reading always lead to the same automaton states) are handled collectively rather than separately. This algorithm has been implemented in the LASH tool [LAS] and experimental results have ....
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. In Proc. International Conference on Implementations and Applications of Automata, Lecture Notes in Computer Science, Pretoria, South Africa, July 2001. Springer-Verlag. To appear.
Experiences with Enumeration of Integer.. - Verdoolaege.. (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, 313(1):17--29, Feb. 2004.
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, (313):17--29, 2004. 4.5
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. In Proc. 6th International Conference on Implementations and Applications of Automata (Revised Papers), volume 2494, Lecture Notes in Computer Science, pages 40-- 51, July 2001. 4.5
Experiences with Enumeration of Integer.. - Verdoolaege.. (2005) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, 313(1):17--29, Feb. 2004.
Analytical Computation of Ehrhart Polynomials and.. - Seghir.. (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. In Proc. 6th International Conference on Implementations and Applications of Automata (Revised Papers), volume 2494, Lecture Notes in Computer Science, pages 40--51, July 2001.
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science, (313):17--29, 2004. 4.5
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004) (Correct)
No context found.
B. Boigelot and L. Latour. Counting the solutions of Presburger equations without enumerating them. In Proc. 6th International Conference on Implementations and Applications of Automata (Revised Papers), volume 2494, Lecture Notes in Computer Science, pages 40-- 51, July 2001. 4.5
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC