Ordinal recursive complexity of Unordered Data Nets

Ordering by Divisibility in Abstract Algebras

Graham Higman · Proceedings of the London Mathematical Society · 1952 · 1.1K citations

Natural Sciences, Mathematics, Algebra +2

Well-structured transition systems everywhere!

Alain Finkel, Ph. Schnoebelen · Theoretical Computer Science · 2001 · 701 citations

Computing, Computer Science, Dynamical Systems +7

Verifying Programs with Unreliable Channels

Parosh Aziz Abdulla, Bengt Jönsson · Information and Computation · 1996 · 354 citations

Computing, Computer Engineering, Computer Science +17

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

Parosh Aziz Abdulla, Kārlis Čerāns, Bengt Jönsson et al. · Information and Computation · 2000 · 201 citations

Computing, Computer Science, Mathematics +10

Unreliable Channels Are Easier to Verify Than Perfect Channels

Gérard Cécé, Alain Finkel, S. Purushothaman Iyer · Information and Computation · 1996 · 132 citations

Engineering, Computer Engineering, Fault-tolerant Computing +5