Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    b3kat_BV035969291
    Umfang: 1 Online-Ressource (XII, 518 S.) , Ill.
    ISBN: 3540171797 , 0387171797
    Serie: Lecture notes in computer science 241
    Sprache: Englisch
    Schlagwort(e): Datenverarbeitung ; Programm ; Software Engineering ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    almafu_BV000535849
    Umfang: XII, 518 S. : , graph. Darst.
    ISBN: 3-540-17179-7 , 0-387-17179-7
    Serie: Lecture notes in computer science 241
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Datenverarbeitung ; Programm ; Software Engineering ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_59513081X
    Umfang: Online-Ressource (XII, 518 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540472391
    Serie: Lecture notes in computer science 241
    Inhalt: Software Development Graphs a unifying concept for software development? -- Concurrent runtime checking of annotated Ada programs -- Recovery of noncurrent variables in source-level debugging of optimized code -- Automatic retargetable code generation: A new technique -- An implementation of OBJ2: An object-oriented language for abstract program specification -- Explicit representation of terms defined by counter examples -- A framework for intelligent backtracking in logic programs -- A generalization of Backus' FP -- Shortest-path motion -- Via assignment in single row routing -- Average-case analysis of the Modified Harmonic algorithm -- Covering minima and lattice point free convex bodies -- Binary decompositions and acyclic schemes -- Thin homogeneous sets of factors -- Irreducible polynomials over finite fields -- Basis reduction and evidence for transcendence of certain numbers -- A characterization of asynchronous message-passing -- Modular synthesis of deadlock-free control structures -- Distributed resource sharing in computer networks -- On proving communication closedness of distributed layers -- A distributed algorithm for edge-disjoint path problem -- Scheduling of hard real-time systems -- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach -- Connectivity algorithms using rubber bands -- On simple and creative sets in NP -- Complexity of sufficient-completeness -- Sampling a population with a semi-random source -- An optimal parallel algorithm for dynamic expression evaluation and its applications -- Extension of the parallel nested dissection algorithm to path algebra problems -- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies -- An efficient parallel algorithm for term matching.
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 3540171797
    Weitere Ausg.: ISBN 0387171797
    Weitere Ausg.: ISBN 9783540171799
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Foundations of software technology and theoretical computer science Berlin [u.a.] : Springer, 1986 ISBN 3540171797
    Weitere Ausg.: ISBN 0387171797
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Entscheidung bei mehrfacher Zielsetzung ; Gruppenentscheidung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    UID:
    almafu_9959186093802883
    Umfang: 1 online resource (XIV, 518 p.)
    Ausgabe: 1st ed. 1986.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47239-8
    Serie: Lecture Notes in Computer Science, 241
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Software Development Graphs a unifying concept for software development? -- Concurrent runtime checking of annotated Ada programs -- Recovery of noncurrent variables in source-level debugging of optimized code -- Automatic retargetable code generation: A new technique -- An implementation of OBJ2: An object-oriented language for abstract program specification -- Explicit representation of terms defined by counter examples -- A framework for intelligent backtracking in logic programs -- A generalization of Backus' FP -- Shortest-path motion -- Via assignment in single row routing -- Average-case analysis of the Modified Harmonic algorithm -- Covering minima and lattice point free convex bodies -- Binary decompositions and acyclic schemes -- Thin homogeneous sets of factors -- Irreducible polynomials over finite fields -- Basis reduction and evidence for transcendence of certain numbers -- A characterization of asynchronous message-passing -- Modular synthesis of deadlock-free control structures -- Distributed resource sharing in computer networks -- On proving communication closedness of distributed layers -- A distributed algorithm for edge-disjoint path problem -- Scheduling of hard real-time systems -- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach -- Connectivity algorithms using rubber bands -- On simple and creative sets in NP -- Complexity of sufficient-completeness -- Sampling a population with a semi-random source -- An optimal parallel algorithm for dynamic expression evaluation and its applications -- Extension of the parallel nested dissection algorithm to path algebra problems -- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies -- An efficient parallel algorithm for term matching. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-17179-7
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almahu_9947920850302882
    Umfang: XIV, 518 p. , online resource.
    ISBN: 9783540472391
    Serie: Lecture Notes in Computer Science, 241
    Anmerkung: Software Development Graphs a unifying concept for software development? -- Concurrent runtime checking of annotated Ada programs -- Recovery of noncurrent variables in source-level debugging of optimized code -- Automatic retargetable code generation: A new technique -- An implementation of OBJ2: An object-oriented language for abstract program specification -- Explicit representation of terms defined by counter examples -- A framework for intelligent backtracking in logic programs -- A generalization of Backus' FP -- Shortest-path motion -- Via assignment in single row routing -- Average-case analysis of the Modified Harmonic algorithm -- Covering minima and lattice point free convex bodies -- Binary decompositions and acyclic schemes -- Thin homogeneous sets of factors -- Irreducible polynomials over finite fields -- Basis reduction and evidence for transcendence of certain numbers -- A characterization of asynchronous message-passing -- Modular synthesis of deadlock-free control structures -- Distributed resource sharing in computer networks -- On proving communication closedness of distributed layers -- A distributed algorithm for edge-disjoint path problem -- Scheduling of hard real-time systems -- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach -- Connectivity algorithms using rubber bands -- On simple and creative sets in NP -- Complexity of sufficient-completeness -- Sampling a population with a semi-random source -- An optimal parallel algorithm for dynamic expression evaluation and its applications -- Extension of the parallel nested dissection algorithm to path algebra problems -- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies -- An efficient parallel algorithm for term matching.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540171799
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    UID:
    almahu_9948621698902882
    Umfang: XIV, 518 p. , online resource.
    Ausgabe: 1st ed. 1986.
    ISBN: 9783540472391
    Serie: Lecture Notes in Computer Science, 241
    Anmerkung: Software Development Graphs a unifying concept for software development? -- Concurrent runtime checking of annotated Ada programs -- Recovery of noncurrent variables in source-level debugging of optimized code -- Automatic retargetable code generation: A new technique -- An implementation of OBJ2: An object-oriented language for abstract program specification -- Explicit representation of terms defined by counter examples -- A framework for intelligent backtracking in logic programs -- A generalization of Backus' FP -- Shortest-path motion -- Via assignment in single row routing -- Average-case analysis of the Modified Harmonic algorithm -- Covering minima and lattice point free convex bodies -- Binary decompositions and acyclic schemes -- Thin homogeneous sets of factors -- Irreducible polynomials over finite fields -- Basis reduction and evidence for transcendence of certain numbers -- A characterization of asynchronous message-passing -- Modular synthesis of deadlock-free control structures -- Distributed resource sharing in computer networks -- On proving communication closedness of distributed layers -- A distributed algorithm for edge-disjoint path problem -- Scheduling of hard real-time systems -- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach -- Connectivity algorithms using rubber bands -- On simple and creative sets in NP -- Complexity of sufficient-completeness -- Sampling a population with a semi-random source -- An optimal parallel algorithm for dynamic expression evaluation and its applications -- Extension of the parallel nested dissection algorithm to path algebra problems -- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies -- An efficient parallel algorithm for term matching.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662196922
    Weitere Ausg.: Printed edition: ISBN 9783540171799
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    UID:
    gbv_1649205791
    Umfang: Online-Ressource
    ISBN: 9783540472391
    Serie: Lecture Notes in Computer Science 241
    Weitere Ausg.: ISBN 9783540171799
    Weitere Ausg.: Buchausg. u.d.T. New Dehli, India, December 18 - 20, 1986 1986 ISBN 3540171797
    Weitere Ausg.: ISBN 0387171797
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    UID:
    almahu_BV000535849
    Umfang: XII, 518 S. : , graph. Darst.
    ISBN: 3-540-17179-7 , 0-387-17179-7
    Serie: Lecture notes in computer science 241
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Datenverarbeitung ; Programm ; Software Engineering ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783440178799?
Meinten Sie 9783401711799?
Meinten Sie 9783540071709?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz