A Software Engineering Perspective on Algorithmics (1998)  (Make Corrections)  (2 citations)
Karsten Weihe
ACM Computing Surveys

  Home/Search   Context   Related
 
View or download:
fmi.unikonstanz.de...preprint050.ps.Z
Cached:  PS.gz  PS  PDF  DjVu  Image  Update  Help

From:  informatik.unikons...manuscripts (more)
Homepages:  K.Weihe  HPSearch  (Update Links)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An algorithm component is an implementation of an algorithm which is not intended to be a stand-alone module, but to perform a specific task within a large software package or even within several distinct software packages. Hence, the design of algorithm components must also incorporate software engineering aspects. A key design goal is adaptability: this goal is important for maintenance throughout a project, prototypical development, and reuse in new, unforeseen contextes. However, efficiency ... (Update)

Context of citations to this paper:   More

...execution of a graph algorithm. This simple 17 example is one of the non algorithmic refinements to algorithm functionality discussed in [WeiWeb] The mixin could have the form: 2 template class Graph class Counting: public Graph int nodes visited, edges visited;...

Cited by:   More
The STL Model in the Geometric Domain - Köthe, Weihe   (Correct)
Implementing Large-Scale Object-Oriented Components - Smaragdakis (1999)   (Correct)

Similar documents (at the sentence level):
78.7%:   A Software Engineering Perspective on Algorithmics - Weihe (1999)   (Correct)
5.3%:   Efficient, Adaptable Implementations of Graph Algorithms - Kühl, Nissen, Weihe   (Correct)

Active bibliography (related documents):   More   All
0.5:   Using Design Patterns for Reusable, Efficient Implementations.. - Kühl, Weihe (1996)   (Correct)
0.4:   PlaNet - A Software Package of Algorithms and.. - Brandes, Neyer.. (1997)   (Correct)
0.3:   Improved Approximations for Minimum Cardinality.. - Müller-Hannemann, Weihe (1997)   (Correct)

Similar documents based on text:   More   All
0.6:   Jahresbericht 1994 bis 1996 Informatik - Universität Konstanz - Scholl, (eds.) (1994)   (Correct)
0.6:   Iterators and Handles for Nodes and Edges in Graphs - Kühl, Weihe (1996)   (Correct)
0.6:   Combining LEDA with Customizable Implementations of Graph.. - Nissen, Weihe (1996)   (Correct)

Related documents from co-citation:   More   All
2:   Programming Language (context) - Stroustrup, The - 1986    

BibTeX entry:   (Update)

K. Weihe, "A Software Engineering Perspective on Algorithmics", available at http://www.informatik.uni-konstanz.de/Preprints/ . http://citeseer.nj.nec.com/article/weihe98software.html   More

@article{ weihe01software,
    author = "Karsten Weihe",
    title = "A software engineering perspective on algorithmics",
    journal = "ACM Computing Surveys",
    volume = "33",
    number = "1",
    pages = "89--134",
    year = "2001",
    url = "citeseer.nj.nec.com/article/weihe98software.html" }
Citations (may not include all citations):
2929   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1994    
1039   Object--Oriented Software Construction (context) - Meyer - 1994    
219   Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
217   Combinatorial Algorithms for Integrated Circuit Layout (context) - Lengauer - 1990
88   Topological Graph Theory (context) - Gross, Tucker - 1987
84   Prentice Hall (context) - Ahuja, Magnanti et al. - 1993
75   Specifying reusable components using contracts - Holland - 1992
33   Algorithmic Graph Theory and Perfect Graphs (context) - Golumbic - 1991
33   Creating abstract superclasses by refactoring (context) - Opdyke, Johnson - 1993
27   Program result-checking: a theory of testing meets a test of.. (context) - Blum, Wasserman - 1994
26   Search in Artificial Intelligence (context) - Kanal, Kumar - 1988
16   Annals of Discrete Mathematics (context) - Nishizeki, Chiba et al. - 1988
9   Reuse of algorithms: still a challenge to object-oriented pr.. (context) - Weihe - 1997
8   Data access templates (context) - Kuhl, Weihe - 1997
8   ACM SIGPLAN Notices (context) - Liskov, hierarchies - 1998
7   Lecture Notes in Economics and Mathematical Systems (context) - Vidal, Annealing - 1993
6   Recasting algorithms to encourage reuse (context) - Weide, Ogden - 1994
6   Using templates to improve C++ designs (context) - Weihe
6   Addison--Wesley Publishing Company (context) - Musser, Saini et al. - 1995
6   The Liskov substitution principle (context) - Martin - 1996
5   Efficient algorithms for path problems with general cost cri.. (context) - Lengauer, Theune
5   LEDA: a library of efficient data structures and algorithms (context) - Mehlhorn, Naher - 1995
5   Symposium on the Foundations of Software Engineering (context) - Batory, Singhal et al. - 1993
5   Toward a programming environment for combinatorial optimizat.. (context) - Gallo, Scutella - 1993
5   Addison--Wesley Publishing Company (context) - Gamma, Helm et al. - 1995
4   Iterators evaluate table queries (context) - Gluche, Kuhl et al. - 1998
4   Combining LEDA with customizable implementations of graph al.. - Nissen, Weihe - 1996
4   Transactions on Programming Languages and Systems (context) - Murer, Omohundro et al.
3   Programming in Networks and Graphs: on the Combinatorial Bac.. (context) - Derigs - 1988
3   Coriolis Group Book (context) - Flamig, in - 1995
3   Finding shortest paths in very large networks (context) - Lawler, Luby et al. - 1983
3   Object Success: a Manager's Guide to Object Orientation (context) - Meyer - 1995
2   Available from the on-line proceedings of the First Workshop.. (context) - Kuhl, Nissen et al.
2   Practical Software Maintenance (context) - Pigorski - 1997
2   Cline and Greg (context) - Marshall - 1994
2   Iterators in the Standard Template Library (context) - Kreft, Langer - 1996
2   Building an iterator for the STL and the Standard Template L.. (context) - Kreft, Langer - 1997
2   Object Oriented Aplication Frameworks (context) - Lewis - 1995

Documents on the same site (http://www.informatik.uni-konstanz.de/~weihe/manuscripts.html):   More
Improved Approximations for Minimum Cardinality.. - Müller-Hannemann, Weihe (1997)   (Correct)
A Simple Proof for Seymour's Theorem on Planar Multicommodity Flows - Weihe   (Correct)
ADLIPS User Manual - Kühl, Ludwig, Möhring, Müller.. (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer   Add search form to your site   Submit documents   Feedback  

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute