Author of the publication

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks

, , , and . CoRR, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Memory-based and disk-based algorithms for very high degree permutation groups., and . ISSAC, page 66-73. ACM, (2003)A comparative analysis of parallel disk-based Methods for enumerating implicit graphs., , and . PASCO, page 78-87. ACM, (2007)Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks, , , and . CoRR, (2011)GAP/MPI: Facilitating parallelism.. Groups and Computation, volume 28 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 69-83. DIMACS/AMS, (1995)DMTCP: Bringing Checkpoint-Restart to Python., and . SciPy, page 2-7. scipy.org, (2013)Applications of Cayley Graphs., , and . AAECC, volume 508 of Lecture Notes in Computer Science, page 367-378. Springer, (1990)Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy., , and . J. Comput. Sci. Technol., 23 (1): 77-102 (2008)SLA and profit-aware SaaS provisioning through proactive renegotiation., , , and . NCA, page 351-358. IEEE Computer Society, (2016)An efficient programming model for memory-intensive recursive algorithms using parallel disks., , , and . ISSAC, page 327-334. ACM, (2012)TOP-C: A Task-Oriented Parallel C Interface.. HPDC, page 141-150. IEEE Computer Society, (1996)