Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Randomized incremental construction of Delaunay and Voronoi diagrams (1992)
    Springer
    Algorithmica 7 (1992), S. 381-413 
    Details
    ISSN: 1432-0541
    Keywords: Delaunay triangulation ; Voronoi diagram ; randomized algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we give a new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations. The new algorithm is more “on-line” than earlier similar methods, takes expected timeO(nℝgn) and spaceO(n), and is eminently practical to implement. The analysis of the algorithm is also interesting in its own right and can serve as a model for many similar questions in both two and three dimensions. Finally we demonstrate how this approach for constructing Voronoi diagrams obviates the need for building a separate point-location structure for nearest-neighbor queries.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01758770
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Efficient representation of perm groups (1991)
    Springer
    Combinatorica 11 (1991), S. 33-43 
    Details
    ISSN: 1439-6912
    Keywords: 20-04 ; 68 Q 25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate lowlevel data structures. Upper and lower bounds on the running time are also obtained. (Following a suggestion of Vaughan Pratt, we adopt the convention that perm=permutation, perhaps thereby saving millions of syllables in future research.)
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01375471
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Semantics of context-free languages: Correction (1971)
    Springer
    Theory of computing systems 5 (1971), S. 95-96 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01702865
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Semantics of context-free languages (1968)
    Springer
    Theory of computing systems 2 (1968), S. 127-145 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract “Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of this process when some of the attributes are “synthesized”, i.e., defined solely in terms of attributes of thedescendants of the corresponding nonterminal symbol, while other attributes are “inherited”, i.e., defined in terms of attributes of theancestors of the nonterminal symbol. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal specification of semantics which have appeared in the literature.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01692511
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Construction of a random sequence (1965)
    Springer
    BIT 5 (1965), S. 246-250 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A completely equidistributed sequence of real numbers is constructed explicitly.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01937504
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Optimal measurement points for program frequency counts (1973)
    Springer
    BIT 13 (1973), S. 313-322 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A procedure recently devised by A. Nahapetian, for reducing the number of measurements needed to determine all the execution frequencies in a computer program, is shown to be optimal, by interpreting the procedure in a new way.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01951942
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    A one-way, stackless quicksort algorithm (1986)
    Springer
    BIT 26 (1986), S. 127-130 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note describes a sorting technique that is similar to the well-known “quicksort” method, but it is undirectional and avoids recursion. The new approach, which assumes that the keys to be sorted are positive numbers, leads to a much shorter program.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01939369
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Aztec Diamonds, Checkerboard Graphs, and Spanning Trees (1997)
    Springer
    Journal of algebraic combinatorics 6 (1997), S. 253-257 
    Details
    ISSN: 1572-9192
    Keywords: Aztec diamond ; spanning tree ; graph spectra ; enumeration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008605912200
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Partitioned Tensor Products and Their Spectra (1997)
    Springer
    Journal of algebraic combinatorics 6 (1997), S. 259-267 
    Details
    ISSN: 1572-9192
    Keywords: partitioned tensor product ; graph spectra ; generalized products of graphs ; Cayley graph ; compatible partition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A pleasant family of graphs defined by Godsil and McKay is shown to have easily computed eigenvalues in many cases.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1008662029947
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Verification of link-level protocols (1981)
    Springer
    BIT 21 (1981), S. 31-36 
    Details
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Stein Krogdahl [1] has given an interesting demonstration of the partial correctness of a “protocol skeleton”, by which the validity of the essential aspects of a large variety of data transmission schemes can be demonstrated. The purpose of this note is to present a simpler way to obtain the same results, by first establishing the validity of a less efficient skeleton and then “optimizing” the algorithms. The present approach, which was introduced for a particular protocol by N. V. Stenning [2], also solves a wider class of problems that do not require first-in-first-out transmissions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01934068
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...