default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 175
Volume 175, Number 1, 30 March 1997
- Hiroakira Ono:
Foreword: Non-standard Logics and Logical Aspects of Computer Science. 1 - Yuri Leonidovich Ershov:
The Bounded-Complete Hull of an Alpha-Space. 3-13 - Nikolay V. Shilov
:
Program Schemata vs. Automata for Decidability of Program Logics. 15-27 - Satoshi Kobayashi:
Monad as Modality. 29-74 - Masahiko Sato:
Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules. 75-92 - Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Infinitary Lambda Calculus. 93-125 - Aart Middeldorp, Hans Zantema:
Simple Termination of Rewrite Systems. 127-158 - Vincent van Oostrom:
Developing Developments. 159-181 - Alexei Lisitsa, Vladimir Yu. Sazonov:
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers. 183-222
Volume 175, Number 2, 10 April 1997
- Vincent Bouchitté, Michel Habib, Michel Morvan:
Preface: Orders, Algorithms and Applications. 223 - Vincent Bouchitté, Jean-Xavier Rampon:
On-Line Algorithms for Orders. 225-238 - Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications. 239-255 - Oya Ekin, Peter L. Hammer, Uri N. Peled:
Horn Functions and Submodular Boolean Functions. 257-270 - Kevin Ewacha, Ivan Rival, Nejib Zaguia:
Approximating the Number of Linear Extensions. 271-282 - Stefan Felsner:
On-Line Chain Partitions of Orders. 283-292 - Colin de la Higuera, Lhouari Nourine:
Drawing and Encoding Two-Dimensional Posets. 293-308 - Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad:
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. 309-335 - Jutta Mitas, Klaus Reuter:
CoverPpreserving Embeddings of Bipartite Orders Into Boolean Lattices. 337-347 - Itsik Pe'er, Ron Shamir:
Satisfiability Problems on Intervals and Unit Intervals. 349-372 - Maurizio Talamo, Paola Vocca:
A Data Structure for Lattice Representation. 373-392 - Laurent Viennot:
Parallel N-Free Order Recognition. 393-406
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-12-09 00:12 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:
