845 | -- | 874 | Gabriel M. Kuper, Jianwen Su. A representation independent language for planar spatial databases with Euclidean distance |
875 | -- | 891 | Stefano Leonardi, Danny Raz. Approximating total flow time on parallel machines |
892 | -- | 907 | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia. Genus characterizes the complexity of certain graph problems: Some tight results |
908 | -- | 923 | Gregor Gramlich, Georg Schnitger. Minimizing nfa s and regular expressions |
924 | -- | 940 | José L. Balcázar, Jorge Castro, David Guijarro, Johannes Köbler, Wolfgang Lindner. A general dimension for query learning |
941 | -- | 961 | Parke Godfrey, Jarek Gryz. View disassembly: A rewrite that extracts portions of views |
962 | -- | 972 | Denis Xavier Charles. Counting lattice vectors |
973 | -- | 985 | Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi. Individual communication complexity |
986 | -- | 996 | Telikepalli Kavitha. Linear time algorithms for Abelian group isomorphism and related problems |
997 | -- | 1011 | Bin Ma, Lusheng Wang, Ming Li. Near optimal multiple alignment within a band in polynomial time |
1012 | -- | 1022 | Radim Belohlávek, Jiri Dvorak, Jan Outrata. Fast factorization by similarity in formal concept analysis of data with fuzzy attributes |