December 01, 1994 article COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME International Journal of Foundations of Computer Science DOI: 10.1142/s0129054194000165 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 36 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On Deciding Constant Runtime of Linear Loops 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 0 citations Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs 2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 7 citations 2 results References 0