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"onig-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 distribution of irreducible trinomials over F₃ | |
On the number of blocks in a perfect covering of v points | |
On the structure of nonstabilizer Clifford codes | |
Ontario secondary school mathematics bulletin. | |
Orthogonal reduction of sparse matrices to upper triangular form using Householder transformations | |
Pairwise orthogonal latin squares with orthogonal small subsquares | |
Parallel hash-based join algorithms for a shared everything environment | |
Partition polynomials of improper set systems, and constrained matching polynomials of graphs | |
Partitions into indecomposable triple systems | |
Penalty function methods | |
The perfectly matchable subgraph polytope of an arbitrary graph | |
Polynomials with odd orthogonal multiplicity | |
Portfolio selection and transactions costs | |
Probabilistic choice models for product pricing using reservation prices | |
Programming law in logic | |
Provably secure distributed Schnorr signatures and a (t, n) threshold scheme for implicit certificates | |
Pseudo-Boolean functions and their graphs | |
The quadrangulation conjecture for orientable surfaces | |
Quantum amplitude amplification and estimation | |
Rational approximations to the exponential function for the numerical solution of the heat conduction problem | |
Recursive constructions for skew resolutions in affine geometries | |
Reduction in purely cubic function fields of unit rank one | |
Research reports, January-December 2000 | |
Restricted two-factor polytopes | |
A robust B-tree implementation | |
Root vertex valency distributions of rooted maps and rooted triangulations | |
Secure frameproof codes, key distribution patterns, group testing algorithms and related structures | |
Self-testing of universal and fault-tolerant sets of quantum gates | |
Semidefinite programming | |
Sensor network localization, Euclidean distance matrix completions and graph realization | |
A short proof of Boulala-Uhry's result on the stable set polytope | |
Singularities of toric varieties associated with finite distributive lattices | |
The size of the fundamental solutions of consecutive Pell equations | |
Slope packings and coverings, and generic algorithms for the discrete logarithm problem | |
Software implementation of elliptic curve crytography over binary fields | |
Solution of large-scale sparse least squares problems using auxiliary storage | |
Solution of sparse underdetermined systems of linear equations | |
Some facts about continued fractions that should be better known | |
Some fundamental properties of successive convex relaxation methods on LCP and related problems | |
Some general problems on the number of parts in partitions | |
Speeding up external mergesort | |
Spline overlay surfaces | |
Steiner trees, connected domination and strongly chordal graphs | |
Stirling numbers for complex arguments : asymptotics and identities | |
A strengthened SDP relaxation via a second lifting for the Max-Cut problem | |
Strong convexity and optimization | |
Summation of bivariate linear recurrence sequences | |
A survey of convergence results for maximum entropy methods | |
A symmetric function resolution of the number of permutations with respect to block-stable elements | |
Techniques for facilities layout : deciding which pairs of activities should be adjacent | |
Theory of estimation | |
Thoth, a portable real-time operating system | |
Threshold signed graphs | |
Threshold visual cryptography schemes with specified whiteness levels of reconstructed pixels | |
Toward a stable tridiagonalization algorithm for general matrices | |
Towards automated detection of feature interactions | |
Towards computer assisted application integration | |
Trace representation of binary Jacobi sequences | |
Trust regions and relaxations for the quadratic assignment problem | |
A uniform logical treatment of queries and updates | |
Vertices of given degree in a random graph | |
Visibility of a simple polygon from a point | |
Walk generating functions, Christoffel-Darboux identities and the adjacency matrix of a graph | |
Walkers on the cycle and the grid | |
The Waterloo mathematics review. | |
WATSOM/I : Waterloo's sonically guided robot | |
Word recognition in a reduced linear prediction space |