Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    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)
    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