default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 236
Volume 236, Numbers 1-2, 6 April 2000
- Max Dauchet:
Trees in Algebra and Programming (Editorial). 1 - Egidio Astesiano, Gianna Reggio:
Formalism and method. 3-34 - Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer:
Specification and proof in membership equational logic. 35-132 - Thomas Arts, Jürgen Giesl
:
Termination of term rewriting using dependency pairs. 133-178 - Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski:
Maximum packing for k-connected partial k-trees in polynomial time. 179-191 - Daniel Leivant, Jean-Yves Marion:
A characterization of alternating log time by ramified recurrence. 193-208 - Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp:
Logicality of conditional rewrite systems. 209-232
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
