Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 118
Volume 118, Number 1 1993
- Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier:
Feasibility Problems for Recurring Tasks on one Processor. 3-20 - Philippe Darondeau, Pierpaolo Degano:
Refinement of Actions in Event Structures and Causal Trees. 21-48 - Viliam Geffert:
A Speed-Up Theorem Without Tape Compression. 49-79 - Igor Walukiewicz:
Gentzen-Type Axiomatization for PAL. 67-79 - Ingo Wegener:
BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small). 81-98
Volume 118, Number 2 1993
- Pierre Deransart:
Proof Methods of Declarative Properties of Definite Programs. 99-166 - Hubert Comon:
Complete Axiomatizations of Some Quotient Term Algebras. 167-191 - Iain A. Stewart
:
Methods for Proving Completeness via Logical Reductions. 193-229 - M. Draghicescu, S. Purushothaman:
A Uniform Treatment of Order of Evalaution and Aggregate Update. 231-262 - Jan Friso Groote:
Transition System Specifications with Negative Premises. 263-299 - Alex K. Simpson:
A Characterisation of the Least-Fixed-Point Operator by Dinaturality. 301-314
a service of 
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 2024-04-18 21:14 CEST 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:
