On the public citation graph
Computational Problems in Abstract Algebra
0 signed · 680 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mana.19540120308openalex-snapshot
Endliche Gruppen mit treuen absolut‐irreduziblen Darstellungen
inferredcites →https://doi.org/10.1002/qua.560010676openalex-snapshot
A computer program for calculation of irreducible representations of finite groups
inferredcites →https://doi.org/10.1007/978-3-0348-6930-0openalex-snapshot
Die Bewegungsgruppen der Kristallographie
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_26openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_12openalex-snapshot
Semi-Automated Mathematics
inferredcites →https://doi.org/10.1007/978-3-662-29427-7_2openalex-snapshot
Translationsgruppen in n Dimensionen
inferredcites →https://doi.org/10.1007/bf01112454openalex-snapshot
Determination of a class of primitive permutation groups
inferredcites →https://doi.org/10.1007/bf01187387openalex-snapshot
Normalteiler und maximale Untergruppen endlicher Gruppen
inferredcites →https://doi.org/10.1007/bf01696919openalex-snapshot
Theory and applications of finite groups
inferredcites →https://doi.org/10.1007/bf02028248openalex-snapshot
Die Fixpunkte einiger Hilbertscher Modulgruppen
inferredcites →https://doi.org/10.1007/bf02116862openalex-snapshot
Extensions of designs and groups: projective, symplectic and certain affine groups
inferredcites →https://doi.org/10.1007/bf02161849openalex-snapshot
Über ein Programm zur Berechnung der Automorphismengruppe einer endlichen Gruppe
inferredcites →https://doi.org/10.1007/bf02412849openalex-snapshot
An orthogonal group of order 213·35·52·7
inferredcites →https://doi.org/10.1007/bf02417955openalex-snapshot
The classes and representations of the groups of 27 lines and 28 bitangents
inferredcites →https://doi.org/10.1007/bf02684358openalex-snapshot
Some arithmetical results on semi-simple Lie algebras
inferredcites →https://doi.org/10.1016/0021-8693(64)90006-7openalex-snapshot
Normal p-complements for finite groups
inferredcites →https://doi.org/10.1016/0021-8693(65)90018-9openalex-snapshot
Finite semifields and projective planes
inferredcites →https://doi.org/10.1016/0021-8693(66)90010-xopenalex-snapshot
A new finite simple group with abelian Sylow 2-subgroups and its characterization
inferredcites →https://doi.org/10.1016/0021-8693(67)90011-7openalex-snapshot
Intersection matrices for finite permutation groups
inferredcites →https://doi.org/10.1016/0021-8693(67)90076-2openalex-snapshot
On the number of Sylow subgroups in a finite group
inferredcites →https://doi.org/10.1016/0021-8693(69)90058-1openalex-snapshot
Bases for equational theories of semigroups
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50013-8openalex-snapshot
Combinatorial construction by computer of the set of all subgroups of a finite group by composition of partial sets of its subgroups
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50014-xopenalex-snapshot
A programme for the drawing of lattices
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50021-7openalex-snapshot
An algorithm related to the restricted Burnside group of prime exponent
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50034-5openalex-snapshot
An enumeration of knots and links, and some of their algebraic properties
inferredcites →https://doi.org/10.1016/c2013-0-12379-3openalex-snapshot
Applications of Finite Groups
inferredcites →https://doi.org/10.1016/j.ffa.2012.07.001openalex-snapshot
Determination of division algebras with 243 elements
inferredcites →https://doi.org/10.1016/s0021-9800(66)80026-1openalex-snapshot
A calculus for a certain class of word problems in groups
inferredcites →https://doi.org/10.1016/s0021-9800(70)80032-1openalex-snapshot
Notes on central groupoids
inferredcites →https://doi.org/10.1017/s0305004100003923openalex-snapshot
Generators for certain normal subgroups of (2,3,7)
inferredcites →https://doi.org/10.1017/s0305004100027109openalex-snapshot
Finite rotation groups and crystal classes in four dimensions
inferredcites →https://doi.org/10.1017/s0305004100036872openalex-snapshot
Coset enumeration on digital computers
inferredcites →https://doi.org/10.1017/s0370164600001218openalex-snapshot
1. The Enumeration, Description, and Construction of Knots, with fewer than Ten Crossings
inferredcites →https://doi.org/10.1017/s1446788700027622openalex-snapshot
On the conjugacy classes in the unitary, symplectic and orthogonal groups
inferredcites →https://doi.org/10.1073/pnas.46.6.868openalex-snapshot
A NEW TYPE OF SIMPLE GROUPS OF FINITE ORDER
inferredcites →https://doi.org/10.1080/00029890.1965.11970695openalex-snapshot
Combinatorial Analysis and Computers
inferredcites →https://doi.org/10.1080/00029890.1967.11999968openalex-snapshot
Products of Points--Some Simple Algebras and their Identities
inferredcites →https://doi.org/10.1090/pspum/006/0133360openalex-snapshot
The constructive reduction of finite group representations
inferredcites →https://doi.org/10.1090/qam/190299openalex-snapshot
On the Hermite-Fujiwara theorem in stability theory
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08256-6openalex-snapshot
On certain systems which are almost groups
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08842-xopenalex-snapshot
A note on finite abelian groups
inferredcites →https://doi.org/10.1090/s0002-9939-1950-0038336-7openalex-snapshot
A Basis for Free Lie Rings and Higher Commutators in Free Groups
inferredcites →https://doi.org/10.1090/s0002-9939-1952-0050579-7openalex-snapshot
A Combinatorial Problem on Abelian Groups
inferredcites →https://doi.org/10.1090/s0002-9939-1954-0060482-6openalex-snapshot
Identities in Finite Algebras
inferredcites →https://doi.org/10.1090/s0002-9939-1955-0069814-7openalex-snapshot
SWAC Computes 126 Distinct Semigroups of Order 4
inferredcites →https://doi.org/10.1090/s0002-9939-1963-0142631-xopenalex-snapshot
A Note on Finite Groups with an Abelian Sylow Group
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0165007-9openalex-snapshot
Groups of Exponent 8 Satisfy the 14th Engel Congruence
inferredcites →https://doi.org/10.1090/s0002-9947-1905-1500706-2openalex-snapshot
Definitions of a Group and a Field by Independent Postulates
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0108524-2openalex-snapshot
On a Homomorphism Property of Certain Jordan Algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0171275-5openalex-snapshot
On a Certain Numerical Invariant of Link Types
inferredcites →https://doi.org/10.1090/s0025-5718-1958-0101641-5openalex-snapshot
A search for analogues of the Mathieu groups
inferredcites →https://doi.org/10.1090/s0025-5718-1963-0159764-2openalex-snapshot
Generation of Permutations by Adjacent Transposition
inferredcites →https://doi.org/10.1090/s0025-5718-1967-0220669-3openalex-snapshot
A Counterexample to Euler's Sum of Powers Conjecture
inferredcites →https://doi.org/10.1090/trans2/002/08openalex-snapshot
Representations of the group of rotations of 3-dimensional space and their applications
inferredcites →https://doi.org/10.1093/qmath/5.1.241openalex-snapshot
SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS
inferredcites →https://doi.org/10.1098/rsta.1956.0003openalex-snapshot
Effective procedures in field theory
inferredcites →https://doi.org/10.1098/rsta.1963.0001openalex-snapshot
A note on the calculation of the matrix elements of the rotation group
inferredcites →https://doi.org/10.1098/rsta.1963.0002openalex-snapshot
On the symmetries of spherical harmonics
inferredcites →https://doi.org/10.1103/physrev.132.1343openalex-snapshot
Theory of Symmetry Projections in Applied Quantum Mechanics
inferredcites →https://doi.org/10.1107/s0365110x63000037openalex-snapshot
Bravais lattices in four-dimensional space
inferredcites →https://doi.org/10.1107/s0365110x67001227openalex-snapshot
Crystal classes of four-dimensional space R4
inferredcites →https://doi.org/10.1112/blms/1.1.89openalex-snapshot
On Janko's Simple Group of Order 50,232,960
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.169openalex-snapshot
The Characters of a Collineation Group in Seven Dimensions
inferredcites →https://doi.org/10.1112/plms/s2-15.1.144openalex-snapshot
Some Applications of the Two-Three Birational Space Transformation
inferredcites →https://doi.org/10.1112/plms/s2-36.1.29openalex-snapshot
A Contribution to the Theory of Groups of Prime-Power Order
inferredcites →https://doi.org/10.1112/plms/s2-43.5.321openalex-snapshot
On the Sylow Systems of a Soluble Group
inferredcites →https://doi.org/10.1112/plms/s3-10.1.395openalex-snapshot
Jordan Algebras with Three Generators
inferredcites →https://doi.org/10.1137/0113034openalex-snapshot
Irreducible Realizations and the Degree of a Rational Matrix
inferredcites →https://doi.org/10.1137/0301010openalex-snapshot
Mathematical Description of Linear Dynamical Systems
inferredcites →https://doi.org/10.1137/1007035openalex-snapshot
Latin Squares which Contain No Repeated Digrams
inferredcites →https://doi.org/10.1145/320986.320988openalex-snapshot
Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity Transformations
inferredcites →https://doi.org/10.1145/321043.321047openalex-snapshot
Techniques for Enumerating Veblen-Wedderburn Systems
inferredcites →https://doi.org/10.1145/365758.365783openalex-snapshot
Computer experiments in finite algebra
inferredcites →https://doi.org/10.1215/s0012-7094-64-03126-6openalex-snapshot
Complete sequences of polynomial values
inferredcites →https://doi.org/10.1515/crll.1940.182.130openalex-snapshot
The classification of prime-power groups.
inferredcites →https://doi.org/10.1515/crll.1950.188.201openalex-snapshot
Die Anwendung des schiefen Produktes in der Gruppentheorie.
inferredcites →https://doi.org/10.2140/pjm.1955.5.541openalex-snapshot
Complete mappings of finite groups
inferredcites →https://doi.org/10.2140/pjm.1961.11.1309openalex-snapshot
Sequences in groups with distinct partial products
inferredcites →https://doi.org/10.2140/pjm.1961.11.387openalex-snapshot
On the nilpotency class of a group of exponent four
inferredcites →https://doi.org/10.2140/pjm.1966.16.47openalex-snapshot
Some identities valid in special Jordan algebras but not valid in all Jordan algebras
inferredcites →https://doi.org/10.2140/pjm.1966.17.529openalex-snapshot
Homomorphisms and subdirect decompositions of semi-groups
inferredcites →https://doi.org/10.2307/1968682openalex-snapshot
On the Ordering of Real Algebraic Numbers by Constructive Methods
inferredcites →https://doi.org/10.2307/1968703openalex-snapshot
A System Arising from a Weakened Set of Group Postulates
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"
inferredcites →https://doi.org/10.2307/1969065openalex-snapshot
On Permutation Groups of Prime Degree and Related Classes of Groups
inferredcites →https://doi.org/10.2307/1969079openalex-snapshot
On Groups Whose Orders Contain a Prime Number to the First Power
inferredcites →https://doi.org/10.2307/1970369openalex-snapshot
Homology of Group Systems With Applications to Knot Theory
inferredcites →https://doi.org/10.2307/1994296openalex-snapshot
Groups Which Have a Faithful Representation of Degree Less Than p - 1
inferredcites →https://doi.org/10.2307/2003966openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.2307/2033839openalex-snapshot
The Collineation Groups of Free Planes. II: A Presentation for the Group G 2
inferredcites →https://doi.org/10.2307/2311038openalex-snapshot
Representation Theory of Finite Groups and Associative Algebras.
inferredcites →https://doi.org/10.2307/2315778openalex-snapshot
Conformal Mapping on Riemann Surfaces.
inferredcites →https://doi.org/10.2307/2372226openalex-snapshot
On the Structure of Multiply Transitive Permutation Groups
inferredcites →https://doi.org/10.2307/2372886openalex-snapshot
A Family of Simple Groups Associated with the Simple Lie Algebra of Type (F 4 )
inferredcites →https://doi.org/10.3792/pja/1195521875openalex-snapshot
Semigroups connected with equivalence and congruence relations
inferredcites →https://doi.org/10.3792/pja/1195524121openalex-snapshot
Note on finite semigroups which satisfy certain group-like condition
inferredcites →https://doi.org/10.4153/cjm-1954-026-9openalex-snapshot
On Homomorphic Images of Special Jordan Algebras
inferredcites →https://doi.org/10.4153/cjm-1964-052-3openalex-snapshot
An Algorithmic Solution for a Word Problem in Group Theory
inferredcites →https://doi.org/10.4153/cjm-1965-085-xopenalex-snapshot
Finite Groups in Which Sylow 2-Subgroups are Abelian and Centralizers of Involutions are Solvable
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.3151openalex-snapshot
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
inferred← citeshttps://doi.org/10.1006/jabr.1997.7198openalex-snapshot
Symmetry Groups of Boolean Functions and Constructions of Permutation Groups
inferred← citeshttps://doi.org/10.1006/jabr.1998.7808openalex-snapshot
The Characterization of Ree Groups 2F4(q) by Their Element Orders
inferred← citeshttps://doi.org/10.1006/jabr.1999.8174openalex-snapshot
Permutability Class of a Semigroup
inferred← citeshttps://doi.org/10.1006/jcss.2001.1764openalex-snapshot
On the Complexity of Some Problems on Groups Input as Multiplication Tables
inferred← citeshttps://doi.org/10.1006/jsco.1999.0333openalex-snapshot
Invariants, Patterns and Weights for Ordering Terms
inferred← citeshttps://doi.org/10.1006/jsco.2000.0406openalex-snapshot
Computing Transformation Semigroups
inferred← citeshttps://doi.org/10.1006/jsco.2000.0469openalex-snapshot
A General Framework to Build Contextual Cover Set Induction Provers
inferred← citeshttps://doi.org/10.1006/jsco.2000.1010openalex-snapshot
A New Existence Proof for Ly, the Sporadic Simple Group of R. Lyons
inferred← citeshttps://doi.org/10.1006/jsco.2001.0449openalex-snapshot
Algorithms for Finite Near-rings and theirN-groups
inferred← citeshttps://doi.org/10.1007/10720084_5openalex-snapshot
Axioms vs. Rewrite Rules: From Completeness to Cut Elimination
inferred← citeshttps://doi.org/10.1007/11513988_47openalex-snapshot
Data Structure Specifications via Local Equality Axioms
inferred← citeshttps://doi.org/10.1007/11563952_73openalex-snapshot
An Algorithmic Approach to High-Level Personalisation of Web Information Systems
inferred← citeshttps://doi.org/10.1007/11590156_4openalex-snapshot
Inference Systems for Logical Algorithms
inferred← citeshttps://doi.org/10.1007/11591191_17openalex-snapshot
Recursive Path Orderings Can Also Be Incremental
inferred← citeshttps://doi.org/10.1007/11596219_17openalex-snapshot
Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/11601548_16openalex-snapshot
Confluence of Graph Transformation Revisited
inferred← citeshttps://doi.org/10.1007/11814771_34openalex-snapshot
Automating Proofs in Category Theory
inferred← citeshttps://doi.org/10.1007/3-540-09519-5_101openalex-snapshot
Matching under commutativity
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_36openalex-snapshot
Some design principles and theory for OBJ-0, a language to express and execute algebraic specifications of programs
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_8openalex-snapshot
A case study of abstract implementations and their correctness
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_40openalex-snapshot
Time sequences as a tool for describing program behaviour
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_13openalex-snapshot
An experiment with the Boyer-Moore theorem prover: A proof of the correctness of a simple parser of expressions
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_16openalex-snapshot
Adding dynamic paramodulation to rewrite algorithms
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_18openalex-snapshot
The AFFIRM theorem prover: Proof forests and management of large proofs
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_3openalex-snapshot
Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_4openalex-snapshot
Automatic program transformation viewed as theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_10openalex-snapshot
Rewrite rule theory and abstract data type analysis
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_12openalex-snapshot
A theorem-proving approach to the Knuth-Bendix completion algorithm
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_26openalex-snapshot
Algorithms for the computation of free lattices
inferred← citeshttps://doi.org/10.1007/3-540-11607-9_27openalex-snapshot
Linear algebraic approach for computing polynomial resultant
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_16openalex-snapshot
Confluent and coherent equational term rewriting systems application to proofs in abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_16openalex-snapshot
Handling function definitions through innermost superposition and rewriting
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_18openalex-snapshot
Combining unification algorithms for confined regular equational theories
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_267openalex-snapshot
Algorithms for the character theory of the symmetric group
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_291openalex-snapshot
Completeness in data type specifications
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_296openalex-snapshot
Implementation of a general completion procedure parameterized by built-in theories and strategies
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_302openalex-snapshot
Obtaining complete sets of reductions and equations without using special unification algorithms
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_2openalex-snapshot
Convergent term rewriting systems can be used for program transformation
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_95openalex-snapshot
E-unification algorithms for a class of confluent term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_79openalex-snapshot
Proving termination of associative commutative rewriting systems by rewriting
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_83openalex-snapshot
Proof by induction using test sets
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_1openalex-snapshot
Term-rewriting implementation of equational logic programming
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_16openalex-snapshot
Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_5openalex-snapshot
Detecting looping simplifications
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_47openalex-snapshot
Testing membership in commutative transformation semigroups
inferred← citeshttps://doi.org/10.1007/3-540-18317-5_12openalex-snapshot
Functional programming with sets
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_14openalex-snapshot
A logical analysis on theory of conditional rewriting
inferred← citeshttps://doi.org/10.1007/3-540-19242-5_16openalex-snapshot
A logic for conditional term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_21openalex-snapshot
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_9openalex-snapshot
On the Confluence of Linear Shallow Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_24openalex-snapshot
Undecidability Results for Monoids with Linear-Time Decidable Word Problems
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_10openalex-snapshot
Compiling and Verifying Security Protocols
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_12openalex-snapshot
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_79openalex-snapshot
Knuth-Bendix Constraint Solving Is NP-Complete
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_38openalex-snapshot
Automatizing geometric proofs and constructions
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_61openalex-snapshot
A completion procedure for hierarchical conditional rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_105openalex-snapshot
An overview of LP, the Larch Prover
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_110openalex-snapshot
Generalized Gröbner bases: Theory and applications. A condensation
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_117openalex-snapshot
Optimization by non-deterministic, lazy rewriting
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_119openalex-snapshot
Restrictions of congruences generated by finite canonical string-rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_136openalex-snapshot
Fast Knuth-Bendix completion: Summary
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_97openalex-snapshot
Proof normalization for resolution and paramodulation
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_98openalex-snapshot
Complete sets of reductions modulo associativity, commutativity and identity
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_43openalex-snapshot
Cayley, version 4: The user language
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_113openalex-snapshot
Combinatorial aspects of simplification of algebraic expressions
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_151openalex-snapshot
A critical pair criterion for completion modulo a congruence
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_29openalex-snapshot
Localized verification of circuit descriptions
inferred← citeshttps://doi.org/10.1007/3-540-52531-9_119openalex-snapshot
The design of cayley — a language for modern algebra
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_41openalex-snapshot
More efficient bottom-up tree pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_51openalex-snapshot
Testing for inductiue (co)-reducibility
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_69openalex-snapshot
Graph-based implementation of a functional logic language
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_101openalex-snapshot
Complete sets of reductions with constraints
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_102openalex-snapshot
Rewrite systems for varieties of semigroups
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_105openalex-snapshot
On restrictions of ordered paramodulation with simplification
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_1openalex-snapshot
The genesis of attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_108openalex-snapshot
Incremental techniques for efficient normalization of nonlinear rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_113openalex-snapshot
On proving properties of completion strategies
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_99openalex-snapshot
Program transformation and rewriting
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_140openalex-snapshot
Canonical sets of horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_141openalex-snapshot
A specialized completion procedure for monadic string-rewriting systems presenting groups
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_102openalex-snapshot
Design strategies for rewrite rules
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_78openalex-snapshot
A maximal-literal unit strategy for horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_80openalex-snapshot
A proof system for conditional algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_87openalex-snapshot
Meta-rule synthesis from crossed rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_89openalex-snapshot
Completion of first-order clauses with equality by strict superposition
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_75openalex-snapshot
Automatic proof methods for algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_11openalex-snapshot
Clausal rewriting: Applications and implementation
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_8openalex-snapshot
Complete equational unification based on an extension of the Knuth-Bendix completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_22openalex-snapshot
Basic superposition is complete
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_159openalex-snapshot
A parallel completion procedure for term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_186openalex-snapshot
Theorem proving with ordering constrained clauses
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_83openalex-snapshot
Generating small convergent systems can be extremely hard
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_22openalex-snapshot
Proving group isomorphism theorems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_28openalex-snapshot
Implementing contextual rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_29openalex-snapshot
Confluence of terminating membership conditional TRS
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_31openalex-snapshot
Completion for constrained term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_21openalex-snapshot
Methodologies for knowledge-based software engineering
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_9openalex-snapshot
Gröbner bases: Strategies and applications
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_140openalex-snapshot
About changing the ordering during Knuth-Bendix completion
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_20openalex-snapshot
Set-theoretic graph rewriting
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_10openalex-snapshot
On the connection between narrowing and proof by consistency
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_49openalex-snapshot
A completion-based method for mixed universal and rigid E-unification
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_8openalex-snapshot
Induction using term orderings
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_100openalex-snapshot
On the complexity of computing the greatest common divisor of several univariate polynomials
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_75openalex-snapshot
STORM: A many-to-one associative-commutative matcher
inferred← citeshttps://doi.org/10.1007/3-540-60156-2_12openalex-snapshot
The ideal structure of Gröbner base computations
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_10openalex-snapshot
On termination and confluence of conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_8openalex-snapshot
Handling equality in logic programming via basic folding
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_39openalex-snapshot
Confluence without termination via parallel critical pairs
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_7openalex-snapshot
Incremental theory reasoning methods for semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_8openalex-snapshot
Term rewriting systems: An h-categorical semantic
inferred← citeshttps://doi.org/10.1007/3-540-61732-9_57openalex-snapshot
PATCH Graphs: An efficient data structure for completion of finitely presented groups
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_6openalex-snapshot
Order-sorted termination: The unsorted way
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_56openalex-snapshot
Higher-order proof by consistency
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_59openalex-snapshot
Shostak's congruence closure as completion
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_62openalex-snapshot
New undecidability results for finitely presented monoids
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_70openalex-snapshot
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_37openalex-snapshot
Unification of terms with term-indexed variables
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_37openalex-snapshot
Relative undecidability in term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_28openalex-snapshot
Paramodulation, superposition, and simplification
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_44openalex-snapshot
Comparing computational representations of Herbrand models
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_14openalex-snapshot
A New Equational Unification Method: A Generalisation of Martelli-Montanari’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-0-85729-808-9_3openalex-snapshot
A Survey of Inference Mechanisms
inferred← citeshttps://doi.org/10.1007/978-1-4020-9532-0_19openalex-snapshot
Design and Performance Evaluation of Knuth-Bendix Multi-Completion System Using Boolean Constrained Reduction Orders
inferred← citeshttps://doi.org/10.1007/978-1-4419-0670-0_9openalex-snapshot
Topological Analysis of DNA-Protein Complexes
inferred← citeshttps://doi.org/10.1007/978-1-4471-3544-9_13openalex-snapshot
Verification of Synchronous Concurrent Algorithms Using OBJ3: A Case Study of the Pixel-Planes Architecture
inferred← citeshttps://doi.org/10.1007/978-1-4612-0503-6_8openalex-snapshot
Knot Theory and Quantum Groups
inferred← citeshttps://doi.org/10.1007/978-1-4612-0731-3_9openalex-snapshot
Examples and Applications of Infinite Permutation Groups
inferred← citeshttps://doi.org/10.1007/978-1-4612-0783-2_20openalex-snapshot
Postlude. A Universal Knot Invariant
inferred← citeshttps://doi.org/10.1007/978-1-4612-1388-8_10openalex-snapshot
A Survey on the Computational Power of Some Classes of Finite Monoid Presentations
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4612-3658-0_11openalex-snapshot
Automated Theorem Proving for Analysis and Synthesis of Computations
inferred← citeshttps://doi.org/10.1007/978-1-4613-1195-9_8openalex-snapshot
Constraint logic and its applications in production: an implementation using the Galileo4 language and system
inferred← citeshttps://doi.org/10.1007/978-1-4613-2007-4_7openalex-snapshot
Hardware Verification in the Interactive VHDL Workstation
inferred← citeshttps://doi.org/10.1007/978-1-4613-9647-5_1openalex-snapshot
A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra
inferred← citeshttps://doi.org/10.1007/978-1-4615-2203-4_12openalex-snapshot
A Pragmatic Approach to Verification, Validation and Compilation
inferred← citeshttps://doi.org/10.1007/978-1-4615-3802-8_20openalex-snapshot
Tangles, Links and Twisted Quantum Groups
inferred← citeshttps://doi.org/10.1007/978-1-4684-0397-8_8openalex-snapshot
Knot Theory and Quantum Groups
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_37openalex-snapshot
Studying the Behaviour of Petri Nets through a Formalization as Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/978-1-4899-0319-8_9openalex-snapshot
An Introduction to Knot Theory and Functional Integrals
inferred← citeshttps://doi.org/10.1007/978-3-0348-8800-4_13openalex-snapshot
Finding a Finite Group Presentation Using Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_9openalex-snapshot
Cut Admissibility by Saturation
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_37openalex-snapshot
Symmetry Breaking Inequalities from the Schreier-Sims Table
inferred← citeshttps://doi.org/10.1007/978-3-322-91230-5_6openalex-snapshot
Phänomene der Knuth-Bendix Vervollständigung
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_3openalex-snapshot
Efficient Checking of Term Ordering Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_34openalex-snapshot
The Algebra of Equality Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_3openalex-snapshot
Rewrite and Decision Procedure Laboratory: Combining Rewriting, Satisfiability Checking, and Lemma Speculation
inferred← citeshttps://doi.org/10.1007/978-3-540-37634-7_10openalex-snapshot
Cohomology and group extensions in Magma
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_25openalex-snapshot
Algorithmic Improvements in Regular Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_24openalex-snapshot
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_26openalex-snapshot
Multi-completion with Termination Tools (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_9openalex-snapshot
Cut Elimination in Deduction Modulo by Abstract Completion
inferred← citeshttps://doi.org/10.1007/978-3-540-73086-6_7openalex-snapshot
Automatic Synthesis of Decision Procedures: A Case Study of Ground and Linear Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_24openalex-snapshot
A Short Survey of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_38openalex-snapshot
Modular Access Control Via Strategic Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_30openalex-snapshot
Building Extended Canonizers by Graph-Based Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_26openalex-snapshot
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-76993-4_22openalex-snapshot
Term Rewriting for Web Information Systems – Termination and Church-Rosser Property
inferred← citeshttps://doi.org/10.1007/978-3-642-00593-0_3openalex-snapshot
Confluence in Domain-Independent Product Line Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-00722-4_4openalex-snapshot
A Framework for Exploring Optimization Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_17openalex-snapshot
Interpolation and Symbol Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-03564-7_7openalex-snapshot
Canonical Reduction Systems in Symbolic Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_11openalex-snapshot
Automating Theories in Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-10452-7_3openalex-snapshot
Satisfiability Modulo Theories: An Appetizer
inferred← citeshttps://doi.org/10.1007/978-3-642-13824-9_10openalex-snapshot
Verification of the Completeness of Unification Algorithms à la Robinson
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_3openalex-snapshot
Theory-Specific Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_13openalex-snapshot
CGE: A Sequential Learning Algorithm for Mealy Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15637-3_9openalex-snapshot
From Goeritz Matrices to Quasi-alternating Links
inferred← citeshttps://doi.org/10.1007/978-3-642-15865-0_11openalex-snapshot
Conceptual Modelling of Application Stories
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_11openalex-snapshot
Characterising Space Complexity Classes via Knuth-Bendix Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_313-2openalex-snapshot
Quantum Approximation of the Jones Polynomial
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_33openalex-snapshot
Ordinals and Knuth-Bendix Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_21openalex-snapshot
Nominal Completion for Rewrite Systems with Binders
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_3openalex-snapshot
Canonical Ground Horn Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-39368-6_23openalex-snapshot
Other Generalizations of Continued Fractions
inferred← citeshttps://doi.org/10.1007/978-3-642-40193-0_18openalex-snapshot
Site-Specific Recombination Modeled as a Band Surgery: Applications to Xer Recombination
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_16openalex-snapshot
Understanding and Expressing Software Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-46752-3_12openalex-snapshot
Deductive Generalization and Meta-Reasoning or How to Formalize Genesis
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_28openalex-snapshot
Polynomials — The Specification, Analysis and Development of an Abstract Data Type
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_11openalex-snapshot
Proofs by Induction in “Fairly” Specified Equational Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_12openalex-snapshot
Inductive Inference in Finite Algebraic Structures
showing the first 200 of 574 · page through all 574
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.