Search the dblp DataBase
Sven-Olof Nyström: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Erik Johansson, Sven-Olof Nyström
Profile-guided optimization across process boundaries. [Citation Graph (0, 0)][DBLP]
Dynamo, 2000, pp:23-31 [Conf] - Sven-Olof Nyström
A soft-typing system for Erlang. [Citation Graph (0, 0)][DBLP]
Erlang Workshop, 2003, pp:56-71 [Conf] - Sven-Olof Nyström
Control Structures for Guarded Horn Clauses. [Citation Graph (0, 0)][DBLP]
ICLP/SLP, 1988, pp:1351-1370 [Conf] - Johan Runeson, Sven-Olof Nyström, Jan Sjödin
Optimizing Code Size through Procedural Abstraction. [Citation Graph (0, 0)][DBLP]
LCTES, 2000, pp:204-205 [Conf] - Johan Runeson, Sven-Olof Nyström
Retargetable Graph-Coloring Register Allocation for Irregular Architectures. [Citation Graph (0, 0)][DBLP]
SCOPES, 2003, pp:240-254 [Conf] - Sven-Olof Nyström
Variable-Free Execution of Concurrent Logic Languages. [Citation Graph (0, 0)][DBLP]
NACLP, 1989, pp:536-552 [Conf] - Sven-Olof Nyström, Bengt Jonsson
Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. [Citation Graph (0, 0)][DBLP]
ILPS, 1993, pp:335-352 [Conf] - Sven-Olof Nyström, Bengt Jonsson
A Fully Abstract Semantics for Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1998, v:146, n:2, pp:138-180 [Journal] - Sven-Olof Nyström
There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1996, v:60, n:6, pp:289-293 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002