University of Waterloo. Faculty of Mathematics.
University of Waterloo (Waterloo, Ont.). Faculty of mathematics
Faculté de mathématiques de l'Université de Waterloo faculté universitaire
VIAF ID: 159392271 ( Corporate )
Permalink: http://viaf.org/viaf/159392271
Preferred Forms
- 110 2 _ ‡a Faculté de mathématiques de l'Université de Waterloo ‡c faculté universitaire
-
- 110 2 _ ‡a University of Waterloo ‡b Faculty of Mathematics
- 110 2 _ ‡a University of Waterloo ‡b Faculty of Mathematics
-
-
- 110 2 _ ‡a University of Waterloo. ‡b Faculty of Mathematics
-
-
4xx's: Alternate Name Forms (2)
5xx's: Related Names (2)
Works
Title | Sources |
---|---|
AEM | |
Aequ. math. (Print. ed.) | |
Aequationes Mathematicae. | |
An algorithm for the solution of the parametric quadratic programming problem | |
Another look at "provable security" | |
Concurrent Prolog in a multi-process environment | |
CS | |
An elementary introduction to hyperelliptic curves | |
An introduction to Maple : sample interactive session | |
It is unlikely that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time | |
König-Egerváry graphs, 2-bicritical graphs and fractional matchings | |
A logical reconstruction of Prolog II | |
Math : high school brochure. | |
Math student bulletin | |
Modern algebra with applications : lecture notes for Math 319 and 329 | |
On a conjecture of Lovász concerning bricks. | |
On the distribution for standardized residuals from linear distributions | |
On the equality sets for homomorphisms on free monoids with two generators | |
On the structure of nonstabilizer Clifford codes | |
On weighted matroid intersection algorithm | |
Ontario secondary school mathematics bulletin. | |
Operations that preserve total dual integrality | |
Optimization analysis of programs in languages with pointer variables. | |
Ordered colourings | |
Ordered orthogonal group divisible designs | |
Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations | |
Orthogonal resolutions of lines in AG(n,q) | |
Packing odd-circuits in Eulerian graphs | |
Photon/532/Set : a text formatter | |
Polynomial functions on finite Galois rings | |
A possible world semantics for non-horn databases | |
Program verification tableaus. | |
A proposal for an imperative complement of prolog. | |
Pumping lemmas for term languages. | |
The quadrangulation conjecture for orientable surfaces | |
Quantum networks for concentrating entanglement | |
Quotients of association schemes | |
The radius of metric regularity | |
Randomized Õ (M(N)) algorithms for problems in matching theory | |
Recursive constructions and some properties of twofold designs with block size four | |
Regularization using a parameterized trust region subproblem | |
Research reports, January-December 2000 | |
Restricted two-factor polytopes | |
Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields : interplay of field arthmetic and explicit formulae | |
Self-concordant barriers for convex approximations of structured convex sets | |
Semidefinite programming relaxations for the graph partitioning problem | |
Singularities of toric varieties associated with finite distributive lattices | |
The size of the fundamental solutions of consecutive Pell equations | |
Smooth ideals in hyperelliptic function fields | |
Solution of large-scale sparse least squares problems using auxiliary storage | |
Solution of sparse underdetermined systems of linear equations | |
Solving backtracking problems with structure diagrams | |
Some results concerning frames, room squares, and subsquares | |
Sorting, measures of disorder, and worst-case performance | |
SPARSPAK : Waterloo sparse matrix package : user's guide for SPARSPAK-B | |
Speeding up the arithmetic on Koblitz curves of genus two | |
Spline overlay surfaces | |
Square-root algorithms for the discrete logarithm problem (a survey) | |
The Steiner problem in phylogeny is NP-complete | |
Stirling numbers for complex arguments : asymptotics and identities | |
The Stockhausen problem and its generalizations | |
Strategies for teaching undergraduate programming | |
Strong convexity and optimization | |
Strongly Qth power-free strings | |
Student models : the genetic graph approach | |
A summary of Lucid programmers, 1981 version | |
Superresolution in the Markov moment problem | |
Support sizes of sixfold triple systems | |
A survey of convergence results for maximum entropy methods | |
Symmetric functions and Macdonald's conjecture for top connexion | |
The symmetric group as a polynomial space | |
A system-point approach to inventory models | |
Systolic automata for VLSI on balanced trees | |
Test sets for simple DOL languages | |
Tests sets for context free languages and algebraic systems of equations over a free monoid | |
Threshold channel graphs | |
Towards computer assisted application integration | |
Truncated objective functions in bivalent integer programming with an application to selecting gymnastic teams | |
Trust regions and relaxations for the quadratic assignment problem | |
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra | |
UNISPEX, A unified model for protocol specification and verification | |
Using block designs to analyze a root-finding algorithm of Berlekamp | |
Vector-valued implicit Lagrangian for symmetric cone complementarity problems | |
Walk generating functions, Christoffel-Darboux identities and the adjacency matrix of a graph | |
The Waterloo mathematics review. | |
Weighted graph based ordering techniques for preconditioned conjugate gradient methods | |
Zeros of reliability polynomials and f-vectors of matroids |