Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Journal=SIAM J. Algebraic Discrete Methods AND YEAR=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characters of elements of finite order in Lie groups
R.V. Moody
,
J. Patera
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 359-383
On operator and formal sum methods for graph enumeration problems
C.J. Liu
,
Yutze Chow
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 384-406
The middle-cut triangulations of the
n
-cube
John F. Sallee
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 407-419
On the algorithmic complexity of total domination
Renu Laskar
,
John Pfaff
,
S.M. Hedetniemi
,
S.T. Hedetniemi
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 420-425
Unlabelled partition systems: Optimization and complexity
P.M. Camerini
,
F. Maffioli
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 426-441
On reducing the space requirements of a straight-line algorithm
David A. Carlson
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 442-450
Combinatorial aspects of the Orrery model of syntax
Michael O. Albertson
,
David M. Berman
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 451-456
Multiplication of generalized polynomials, with applications to classical orthogonal polynomials
Stephen Barnett
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 457-462
Hamiltonian cycles in striped graphs: The two-stripe problem
R.S. Garfinkel
,
P.S. Sundararaghavan
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 463-466
Complementarity in oriented matroids
Michael J. Todd
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 467-485
Nontestable hypotheses in linear models
Shayle R. Searle
,
William H. Swallow
,
Charles E. McCulloch
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 486-496
The approximation of arbitrary clustering functions by clustering functions which satisfy overlapping criteria
Gerhard Herden
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 497-507
On the maximal number of strongly independent vertices in a random acyclic directed graph
Amnon B. Barak
,
Paul Erdös
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 508-514
Triangulations of oriented matroids and convex polytopes
Louis J. Billera
,
Beth Spellman Munson
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 515-525
Graph coloring using eigenvalue decomposition
Bengt Aspvall
,
John R. Gilbert
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 526-538
A fixed point approach to undiscounted Markov renewal programs
A. Federgrün
,
P.J. Schweitzer
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 539-550
On metapaths in metagraphs
Karel Culik
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 551-568
Threshold dimension of graphs
Margaret B. Cozzens
,
Rochelle Leibowitz
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 579-595
Instability in discrete algorithms and exact reversibility
Gérard Y. Vichniac
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 596-602
How large are transitive simple majority domains
James M. Abello
,
Charles R. Johnson
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 603-618
Explicit solutions to optimization problems on the intersections of the unit ball of the
l_1
and
l_{\infty}
norms with a hyperplane
Uriel G. Rothblum
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 619-632
Seiten
<
1
2