BEARdocs

Browsing Department of Computer Science by Title

DSpace/Manakin Repository

Browsing Department of Computer Science by Title

Sort by: Order: Results:

  • Maurer, Peter M.
    This report gives one subgroup of each of the conjugacy classes of the subgroups of S7.
  • Maurer, Peter M.
    As is well known (or should be well known) the finite field GF(2^k) can be represented in the general linear group of kxk matrices over GF(2). There are many such representations. This report gives the 8 representations ...
  • Maurer, Peter
    It’s clear that traditional forms of academic publication are rapidly becoming obsolete. It’s also clear that peer review is a seriously flawed process that could be much improved upon by modern methods of communication. ...
  • Maurer, Peter M.
    The objective of the algorithm described in this report is to optimally guess a hidden binary string based on queries to an oracle where the length of the string is known beforehand. A C++ version of the algorithm is given ...
  • Maurer, Peter M.
    The shadow algorithm is an event-driven unit-delay simulation technique that has been designed to take advantage of the instruction caches present in many of the latest workstations. The algorithm is based on the threaded-code ...
  • Maurer, Peter M.
    This is the software described in the technical report “The Shadow Algorithm: …” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory.
  • Ewert, Winston.
    A search process is an attempt to locate a solution to a problem, such as an optimization problem, where the space is usually too large to exhaustively sample. In order to investigate this idea this work looks a three ...
  • Maurer, Peter M.
    This technical report lists all subgroups of S3 in cycle form.
  • Maurer, Peter M.
    This technical report lists all subgroups of S4, the symmetric group of degree 4. Subgroups are listed in cycle form using the integers 0, 1, 2, and 3.
  • Maurer, Peter M.
    This technical report lists all subgroups of S5 in cycle form, using the integers 0-4.
  • Maurer, Peter M.
    This technical report lists all subgroups of S6 in cycle form using the integers 0-5.
  • Maurer, Peter M.
    This report gives all conjugacy classes of the super symmetric groups HR3 and VR3
  • Maurer, Peter M.
    Super symmetry is a type of matrix-based symmetry that extends the concept of total symmetry. Super symmetric functions are “even more symmetric” than totally symmetric functions. Even if a function is not super ...
  • Maurer, Peter M.
    The Inversion Algorithm is an event-driven logic simulation technique that is competitive with Levelized Compiled Code Simulation. Previous versions of the Inversion Algorithm have been limited to purely binary simulation. ...
  • Maurer, Peter M.
    TOKDEC is a tool that helps create compiler debugging code by converting numeric tokens into character strings. It is meant to be used with the output of the “yacc” preprocessor.
  • Maurer, Peter M.
    The PC-set method and the parallel technique are two methods for generating compiled unit-delay simulations of acyclic circuits. The PC-set method analyzes the network, determines the set of potential change times for each ...
  • Roberts, Nathan V.
    A key problem in software development is producing systems that are maintainable even as the concerns at play evolve. Aspect-oriented programming (AOP) seeks to foster maintainability by isolating the specifications of ...
  • Maurer, Peter M.
    The Inversion Algorithm is an event driven algorithm whose performance meets or exceeds that of Levelized Compiled Code simulation, even when the activity rate is unrealistically high. Existing implementations of the ...
  • Maurer, Peter M.
    Research on symmetry detection focuses on identifying and detecting new types of symmetry. We present an algorithm that is capable of detecting any type of permutation based symmetry, including many types for which there ...
  • Maurer, Peter M.
    GF(2) matrices are matrices of ones and zeros under modulo 2 arithmetic. Like the GF(2) polynomials used in error detection and correction, they have many potential uses in Electronic Design Automation (EDA). Non-singular ...

Search BEARdocs


Advanced Search

Browse

My Account

Statistics