Sciweavers

1805 search results - page 21 / 361
» Functional programming with structured graphs
Sort
View
ESA
1998
Springer
154views Algorithms» more  ESA 1998»
13 years 11 months ago
A Functional Approach to External Graph Algorithms
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
James Abello, Adam L. Buchsbaum, Jeffery Westbrook
KBSE
2007
IEEE
14 years 1 months ago
Tool support for the compile-time execution structure of object-oriented programs with ownership annotations
Ownership domain annotations enable obtaining at compiletime the system’s execution structure from the annotated program. The execution structure is sound, hierarchical (and thu...
Marwan Abi-Antoun, Jonathan Aldrich
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 9 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
SERP
2007
13 years 9 months ago
Developing an Online Function Reader
A function reader is a program that can read an input function and evaluate the function for a given input value at run time. Any Computer Algebra System and Graphing Calculator ar...
Mingshen Wu, Weihu Hong
PASTE
1998
ACM
13 years 12 months ago
Static Slicing of Threaded Programs
Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing met...
Jens Krinke