- Email: [email protected]
Author index volume 268 (2001)
Theoretical Computer Science 268 (2001) 395
Author index volume 268 (2001) (The issue number is given in front of the page numbers) AmbuK hl, C., B. GaK rtner and B. von Stengel, A new lower bound for the list update problem in the partial cost model Apsm tis, K., R. Freivalds, R. Simanovskis and J. Smotrovs, Closedness properties in ex-identi"cation Arikawa, S., see E. Hirowatari Azar, Y. and O. Regev, On-line bin-stretching Bartal, Y., M. Charikar and P. Indyk, On page migration and other relaxed task systems Bischof, S. and E.W. Mayr, On-line scheduling of parallel jobs with runtime restrictions Case, J., S. Jain, S. Kaufmann, A. Sharma and F. Stephan, Predictive learning models for concept drift Charikar, M., see Y. Bartal Feuerstein, E. and L. Stougie, On-line single-server dial-a-ride problems Fischlin, M., Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions Fleischer, R., On the Bahncard problem Freivalds, R., see K. Apsm tis GaK rtner, B., see C. AmbuK hl G"azek, W., Online algorithms for page replication in rings Hirowatari, E. and S. Arikawa, A comparison of identi"cation criteria for inductive inference of recursive real-valued functions Indyk, P., see Y. Bartal Jain, S., see J. Case Kaufmann, S., see J. Case Kimbrel, T., Online paging and "le caching with expiration times Krishna Rao, M.R.K. and A. Sattar, Polynomial-time learnability of logic programs with local variables from entailment Leonardi, S. and A. Marchetti-Spaccamela, Preface Marchetti-Spaccamela, A., see S. Leonardi Mayr, E.W., see S. Bischof Meyer, L., Aspects of complexity of probabilistic learning under monotonicity constraints Noga, J. and S.S. Seiden, An optimal online algorithm for scheduling two machines with release times Regev, O., see Y. Azar Riedel, M., Online request server matching Sattar, A., see M.R.K. Krishna Rao Seiden, S.S., see J. Noga Sharma, A., see J. Case Simanovskis, R., see K. Apsm tis Smotrovs, J., see K. Apsm tis Stephan, F. and Y. Ventsov, Learning algebraic structures from text Stephan, F., see J. Case Stougie, L., see E. Feuerstein Ventsov, Y., see F. Stephan von Stengel, B., see C. AmbuK hl Wiehagen, R. and T. Zeugmann, Foreword Zeugmann, T., see R. Wiehagen
(1)
3} 16
(2) (2) (1) (1) (1)
367}393 351}366 17} 41 43} 66 67} 90
(2) 323}349 (1) 43} 66 (1) 91}105 (2) (1) (2) (1) (1)
199}219 161}174 367}393 3} 16 107}117
(2) (1) (2) (2) (1)
351}366 43} 66 323}349 323}349 119}131
(2) 179}198 (1) 1 (1) 1 (1) 67} 90 (2) 275}322 (1) (1) (1) (2) (1) (2) (2) (2) (2) (2) (1) (2) (1) (2) (2)
133}143 17} 41 145}160 179}198 133}143 323}349 367}393 367}393 221}273 323}349 91}105 221}273 3} 16 175}177 175}177
Author index volume 268 (2001) (The issue number is given in front of the page numbers) AmbuK hl, C., B. GaK rtner and B. von Stengel, A new lower bound for the list update problem in the partial cost model Apsm tis, K., R. Freivalds, R. Simanovskis and J. Smotrovs, Closedness properties in ex-identi"cation Arikawa, S., see E. Hirowatari Azar, Y. and O. Regev, On-line bin-stretching Bartal, Y., M. Charikar and P. Indyk, On page migration and other relaxed task systems Bischof, S. and E.W. Mayr, On-line scheduling of parallel jobs with runtime restrictions Case, J., S. Jain, S. Kaufmann, A. Sharma and F. Stephan, Predictive learning models for concept drift Charikar, M., see Y. Bartal Feuerstein, E. and L. Stougie, On-line single-server dial-a-ride problems Fischlin, M., Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions Fleischer, R., On the Bahncard problem Freivalds, R., see K. Apsm tis GaK rtner, B., see C. AmbuK hl G"azek, W., Online algorithms for page replication in rings Hirowatari, E. and S. Arikawa, A comparison of identi"cation criteria for inductive inference of recursive real-valued functions Indyk, P., see Y. Bartal Jain, S., see J. Case Kaufmann, S., see J. Case Kimbrel, T., Online paging and "le caching with expiration times Krishna Rao, M.R.K. and A. Sattar, Polynomial-time learnability of logic programs with local variables from entailment Leonardi, S. and A. Marchetti-Spaccamela, Preface Marchetti-Spaccamela, A., see S. Leonardi Mayr, E.W., see S. Bischof Meyer, L., Aspects of complexity of probabilistic learning under monotonicity constraints Noga, J. and S.S. Seiden, An optimal online algorithm for scheduling two machines with release times Regev, O., see Y. Azar Riedel, M., Online request server matching Sattar, A., see M.R.K. Krishna Rao Seiden, S.S., see J. Noga Sharma, A., see J. Case Simanovskis, R., see K. Apsm tis Smotrovs, J., see K. Apsm tis Stephan, F. and Y. Ventsov, Learning algebraic structures from text Stephan, F., see J. Case Stougie, L., see E. Feuerstein Ventsov, Y., see F. Stephan von Stengel, B., see C. AmbuK hl Wiehagen, R. and T. Zeugmann, Foreword Zeugmann, T., see R. Wiehagen
(1)
3} 16
(2) (2) (1) (1) (1)
367}393 351}366 17} 41 43} 66 67} 90
(2) 323}349 (1) 43} 66 (1) 91}105 (2) (1) (2) (1) (1)
199}219 161}174 367}393 3} 16 107}117
(2) (1) (2) (2) (1)
351}366 43} 66 323}349 323}349 119}131
(2) 179}198 (1) 1 (1) 1 (1) 67} 90 (2) 275}322 (1) (1) (1) (2) (1) (2) (2) (2) (2) (2) (1) (2) (1) (2) (2)
133}143 17} 41 145}160 179}198 133}143 323}349 367}393 367}393 221}273 323}349 91}105 221}273 3} 16 175}177 175}177