Sommaire

On a hierarchy of Boolean functions hard to compute in constant depth.

Bernasconi, Anna

Full (PDF)
Access to full text
p. 79-90

The Electronic Library of Mathematics
A note on representations of the finite Heisenberg group and sums of greatest common divisors.

Grassberger, Johannes ; Hörmann, Günther

Full (PDF)
Access to full text
p. 91-100

The Electronic Library of Mathematics
A permutations representation that knows what “Eulerian” means.

Mantaci, Roberto ; Rakotondrajao, Fanja

Full (PDF)
Access to full text
p. 101-108

The Electronic Library of Mathematics
P4-colorings and P4-bipartite graphs.

Hoang, C.T. ; Le, V.B.

Access to full text
Full (PDF)
p. 109-122

The Electronic Library of Mathematics
Cubic Cayley graphs with small diameter.

Curtin, Eugen

Full (PDF)
Access to full text
p. 123-132 p.

The Electronic Library of Mathematics
Paths of specified length in random k-partite graphs.

Subramanian, C.R.

Full (PDF)
Access to full text
p. 133-138 p.

The Electronic Library of Mathematics
Analysis of transmissions scheduling with packet fragmentation.

Menakerman, Nir ; Rom, Raphael

Full (PDF)
Access to full text
p. 139-156 p.

The Electronic Library of Mathematics
Minimum eccentricity multicast trees.

Krumme, David ; Fragopoulou, Paraskevi

Full (PDF)
Access to full text
p. 157-172 p.

The Electronic Library of Mathematics
Linear time recognition of P4-indifference graphs.

Habib, Michael ; Paul, Christophe ; Viennot, Laurent

Full (PDF)
Access to full text
p. 173-178 p.

The Electronic Library of Mathematics
Finite automata with generalized acceptance criteria.

Peichl, Timo ; Vollmer, Heribert

Full (PDF)
Access to full text
p. 179-192 p.

The Electronic Library of Mathematics
The first-order theory of ordering constraints over feature trees.

Müller, Martin ; Niehren, Joachim ; Treinen, Ralf

Full (PS)
Access to full text
p. 193-234 p.

The Electronic Library of Mathematics
Benders decomposition for local access network design with two technologies.

Randazzo, C.D. ; Luna, H.P.L. ; Mahey, P.

Full (PDF)
Access to full text
p. 235-246 p.

The Electronic Library of Mathematics
A degree-decreasing lemma for (MODq-MODp) circuits.

Grolmusz, Vince

Access to full text
Full (PDF)
p. 247-254 p.

The Electronic Library of Mathematics
Oriented multicast routing algorithm applied to network-level agent search.

Magoni, Damien ; Pansiot, Jean-Jacques

Full (PDF)
Access to full text
p. 255-272 p.

The Electronic Library of Mathematics
Defect effect of Bi-infinite words in the two-element case.

Man̆uch, Ján

Full (PDF)
Access to full text
p. 273-290 p.

The Electronic Library of Mathematics
Simple equational specifications of rational arithmetic.

Moss, Lawrence S.

Full (PDF)
Access to full text
p. 291-300

The Electronic Library of Mathematics
An approximate Lp difference algorithm for massive data streams.

Fong, Jessica H. ; Strauss, Martin

Access to full text
Full (PDF)
p. 301-322

The Electronic Library of Mathematics
An efficient algorithm for the maximum distance problem.

Grün, Gabrielle Assunta

Full (PDF)
Access to full text
p. 323-350

The Electronic Library of Mathematics
The topological entropy of iterated piecewise affine maps is uncomputable.

Koiran, Pascal

Full (PDF)
Access to full text
p. 351-356

The Electronic Library of Mathematics
Overlap-free symmetric D0L words.

Frid, Anna

Full (PDF)
Access to full text
p. 357-362

The Electronic Library of Mathematics
Asymptotic normality of recursive algorithms via martingale difference arrays.

Schachinger, Werner

Full (PDF)
Access to full text
p. 363-398

The Electronic Library of Mathematics