Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Die Antwortzeit im Portal kann derzeit länger als üblich sein. Wir bitten um Entschuldigung.
Export
  • 1
    UID:
    b3kat_BV035987918
    Format: 1 Online-Ressource (VIII, 468 S.)
    ISBN: 3540138838 , 0387138838
    Series Statement: Lecture notes in computer science 181
    Language: English
    Keywords: Informatik ; Software ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almafu_9959186098802883
    Format: 1 online resource (X, 470 p.)
    Edition: 1st ed. 1984.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39087-1
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Bibliographic Level Mode of Issuance: Monograph , Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-13883-8
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_BV000265600
    Format: VIII, 468 S.
    ISBN: 3-540-13883-8 , 0-387-13883-8
    Series Statement: Lecture notes in computer science 181
    Language: English
    Keywords: Informatik ; Software ; Konferenzschrift ; Konferenzschrift ; Kongress - Bangalore 〈1984〉 - Software Engineering ; Kongress - Bangalore 〈1984〉 - Theoretische Informatik ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Kongress - Bangalore 〈1984〉 - Software Engineering ; Kongress - Bangalore 〈1984〉 - Theoretische Informatik
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_595131395
    Format: Online-Ressource (VIII, 468 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540390879
    Series Statement: Lecture notes in computer science 181
    Content: Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions.
    Note: Literaturangaben
    Additional Edition: ISBN 3540138838
    Additional Edition: ISBN 0387138838
    Additional Edition: ISBN 9783540138839
    Additional Edition: Erscheint auch als Druck-Ausgabe Foundations of software technology and theoretical computer science Berlin : Springer-Verl., 1984 ISBN 3540138838
    Additional Edition: ISBN 0387138838
    Language: English
    Keywords: Software Engineering ; Theoretische Informatik ; Informatik ; Software ; Informatik ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almatuudk_9921321627802884
    Format: 1 online resource (X, 470 p.)
    Edition: 1st ed. 1984.
    ISBN: 3-540-39087-1
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Bibliographic Level Mode of Issuance: Monograph , Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions. , English
    Additional Edition: ISBN 3-540-13883-8
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9947920854202882
    Format: X, 470 p. , online resource.
    ISBN: 9783540390879
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540138839
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9948621278102882
    Format: X, 470 p. , online resource.
    Edition: 1st ed. 1984.
    ISBN: 9783540390879
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662178225
    Additional Edition: Printed edition: ISBN 9783540138839
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    gbv_1649202288
    Format: Online-Ressource
    ISBN: 9783540390879
    Series Statement: Lecture Notes in Computer Science 181
    Additional Edition: ISBN 9783540138839
    Additional Edition: Buchausg. u.d.T. ISBN 978-3-540-13883-9
    Language: English
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edoccha_9959186098802883
    Format: 1 online resource (X, 470 p.)
    Edition: 1st ed. 1984.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39087-1
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Bibliographic Level Mode of Issuance: Monograph , Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-13883-8
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    edocfu_9959186098802883
    Format: 1 online resource (X, 470 p.)
    Edition: 1st ed. 1984.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39087-1
    Series Statement: Lecture Notes in Computer Science, 181
    Note: Bibliographic Level Mode of Issuance: Monograph , Logic for knowledge representation -- Logical specification and implementation -- Process specification of logic programs -- Functional programming systems revisited -- Models and transformations for nondeterministic extensions of functional programming -- Degrees of non-determinism and concurrency: A Petri net view -- Proof rules for communication abstractions -- A distributed algorithm for detecting communication deadlocks -- On the existence and construction of robust communication protocols for unreliable channels -- Heuristic search approach to optimal routing in a distributed architecture -- Replacement in monotone Boolean networks: An algebraic perspective -- A new characterization of BPP -- Treating terminals as function values of time -- Logics of knowledge, games and dynamic logic -- Persistent first class procedures are enough -- Abstraction concepts for modeling screen oriented dialogue interfaces -- VLSI systems for design rule checks -- Bounds on the length of convex partitions of polygons -- On mapping cube graphs onto VLSI arrays -- A linear-time algorithm for determining the intersection type of two star polygons -- Eliminating cascading rollback in structured databases -- Recognition and top-down generation of ?-acyclic database schemes -- Universal and representative instances using unmarked nulls -- On some computational problems related to data base coding -- Generic oracles -- Approximation algorithm for maximum independent set in planar traingle-free graphs -- Grid file algorithms: An analysis in the biased case -- On the mean weight balance factor of binary trees -- An efficient algorithm for random sampling without replacement -- Proof rules for communication abstractions. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-13883-8
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages