Algorithms and computation. 8th international symposium, ISAAC '97, Singapore, December 17--19, 1997. Proceedings

From MaRDI portal

Revision as of 15:09, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1374898

Jump to:navigation, search

zbMath0879.00060MaRDI QIDQ1374898

No author found.

Publication date: 22 December 1997

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Algorithms Conference Proceedings Computation Singapore ISAAC '97

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Related Items (1)

How fast can we play Tetris greedily with rectangular pieces?

This page was built for publication: Algorithms and computation. 8th international symposium, ISAAC '97, Singapore, December 17--19, 1997. Proceedings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1374898&oldid=13519830"