| 000 | 03521nam a22004695i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-47239-1 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102021.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1986 gw | s |||| 0|eng d | ||
| 020 |
_a9783540472391 _9978-3-540-47239-1 |
||
| 024 | 7 |
_a10.1007/3-540-17179-7 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aFoundations of Software Technology and Theoretical Computer Science _h[electronic resource] : _bSixth Conference, New Delhi, India December 18–20, 1986 Proceedings / _cedited by Kesav V. Nori. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
| 300 |
_aXIV, 518 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v241 |
|
| 505 | 0 | _aSoftware 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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aArithmetic and Logic Structures. |
| 700 | 1 |
_aNori, Kesav V. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540171799 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v241 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-17179-7 |
| 942 |
_2EBK6011 _cEBK |
||
| 999 |
_c35305 _d35305 |
||