io-port.net

io-port 05216744 Muehlbacher, J.R.

Full hash table search using primitive roots of the prime residue group z/p. (English)

J. UCS 10, No. 9, 1239-1249, electronic only (2004).

Classification: E.2 G.4

1

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02032812 Fomin, Fedor V.; Kratsch, Dieter; Müller, Haiko

Algorithms for graphs with small octopus. (English)

Discrete Appl. Math. 134, No.1-3, 105-128 (2004).

Classification: F.2.2 G.2.2 G.4

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02039229 Müller, Jens; Korvink, Jan G.

A general purpose adaptivity driver for FE software. (English)

Softw., Pract. Exper. 33, No. 12, 1097-1116 (2003).

Classification: D.2.10 G.1.8 G.4

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 02038344 Subramanian, C.R.

Finding induced acyclic subgraphs in random digraphs. (English)

Electron. J. Comb. 10, Research paper R46, 6 p. (2003); printed version J. Comb. 10, No. 4 (2003).

Classification: G.4

4

PDF XML AMS-TeX TEXT BIBTeX EMIS

io-port 02034453 Balibrea, Francisco; Guirao, Juan L.G.; Pelayo, Fernando L.

An environment for computing topological entropy for skew-product transformations. (English)

Simos, T. E. (ed.), Computational methods in sciences and engineering 2003 (ICCMSE 2003). Proceedings of the international conference, Kastoria, Greece, September 12-16, 2003. River Edge, NJ: World Scientific. 38-46 (2003).

Classification: I.1 G.2.1 G.4 G.1.0

5

PDF XML AMS-TeX TEXT BIBTeX

io-port 02024507 Ibaraki, Toshihide (ed.); Katoh, Naoki (ed.); Ono, Hirotaka (ed.)

Algorithms and computation. 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15‒17, 2003. Proceedings. (English)

Lecture Notes in Computer Science. 2906. Berlin: Springer. xvii, 748 p. EUR 80.00/net; \$ 107.00; \sterling 61.50; sFr 133.00 (2003).

Classification: A.m G.4

6

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02016486 Dehne, Frank (ed.); Sack, Jörg-Rüdiger (ed.); Smid, Michiel (ed.)

Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 ‒ August 1, 2003. Proceedings. (English)

Lecture Notes in Computer Science. 2748. Berlin: Springer. xii, 522 p. EUR 62.00/net; \$ 81.00; \sterling 47.50; sFr 103.00 (2003).

Classification: A.m E.5 G.4

7

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02013597 Abrial, Jean-Raymond; Cansell, Dominique; Méry, Dominique

Formal derivation of spanning trees algorithms. (English)

Bert, Didier (ed.) et al., ZB 2003: Formal specification and development in Z and B. Third international conference of B and Z users, Turku, Finland, June 4-6, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2651, 457-476 (2003).

Classification: G.4 G.2.2

8

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011863 Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme

Differential approximation for some routing problems. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 277-288 (2003).

Classification: G.1.6 G.4 F.1.3 J.1

9

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011858 Yamakami, Tomoyuki

Nearly bounded error probabilistic sets. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 213-226 (2003).

Classification: G.4 F.1.3 F.4.1

10

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011856 Böckenhauer, Hans-Joachim; Bongartz, Dirk; Hromkovič, Juraj; Klasing, Ralf; Proietti, Guido; Seibert, Sebastian; Unger, Walter

On $k$-edge-connectivity problems with sharpened triangle inequality. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 189-200 (2003).

Classification: G.2.2 G.4 F.2.2 G.1.6

11

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011854 Baltz, Andreas; Srivastav, Anand

Fast approximation of minimum multicast congestion ‒ implementation versus theory. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 165-177 (2003).

Classification: G.4 G.2.2 G.1.6

12

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011851 Szwarcfiter, Jayme L.

Generating all forest extensions of a partially ordered set. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 132-139 (2003).

Classification: G.2.1 G.4

13

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011849 Gramm, Jens; Guo, Jiong; Hüffner, Falk; Niedermeier, Rolf

Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 108-119 (2003).

Classification: G.4 G.2.2 F.1.3

14

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011847 Duckworth, William; Mans, Bernard

Randomised algorithms for finding small weakly-connected dominating sets of regular graphs. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 83-95 (2003).

Classification: G.4 G.2.2 I.2.8

15

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011846 Chan, Wun-Tat; Lam, Tak-Wah; Ting, Hing-Fung; Wong, Prudence W.H.

On-line stream merging, max span, and min coverage. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 70-82 (2003).

Classification: G.4

16

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011845 Boyar, Joan; Favrholdt, Lene M.

The relative worst order ratio for on-line algorithms. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 58-69 (2003).

Classification: G.4

17

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02011837 Leiserson, Charles E.

Cache-oblivious algorithms. (English)

Petreschi, Rosella (ed.) et al., Algorithms and complexity. 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2653, 5 (2003).

Classification: G.4

18

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02010352 Arora, Sanjeev (ed.); Jansen, Klaus (ed.); Rolim, José D.P. (ed.); Sahai, Amit (ed.)

Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 6th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2003 and 7th international workshop on randomization and approximation techniques in computer science, RANDOM 2003, Princeton, NJ, USA, August 24‒26, 2003. Proceedings. (English)

Lecture Notes in Computer Science. 2764. Berlin: Springer. ix, 409 p. EUR 54.00/net; \$ 71.00; \sterling 41.50; sFr 92.50 (2003).

Classification: A.m G.4 G.1.6

19

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 02010210 Cong, Jason (ed.); Shinnerl, Joseph R. (ed.)

Multilevel optimization in VLSICAD. (English)

Combinatorial Optimization. 14. Dordrecht: Kluwer Academic Publishers. xix, 238 p. EUR 103.00; \$ 113.00; \sterling 71.00 (2003).

Classification: G.4 G.1.6

20

PDF XML AMS-TeX TEXT BIBTeX