Results: 1-25 | 26-50 | 51-75 | 76-100 | >>

Table of contents of journal: *Journal of computer and system sciences

Results: 1-25/560

Authors: Pudlak, P
Citation: P. Pudlak, Special issue: Complexity 2000 - Guest editor's foreword, J COMPUT SY, 63(2), 2001, pp. 147-147

Authors: Ambainis, A Buhrman, H Gasarch, W Kalyanasundaram, B Torenvliet, L
Citation: A. Ambainis et al., The communication complexity of enumeration, elimination, and selection, J COMPUT SY, 63(2), 2001, pp. 148-185

Authors: Barrington, DM Kadau, P Lange, KJ McKenzie, P
Citation: Dm. Barrington et al., On the complexity of some problems on groups input as multiplication tables, J COMPUT SY, 63(2), 2001, pp. 186-200

Authors: Berthiaume, A van Dam, W Laplante, S
Citation: A. Berthiaume et al., Quantum Kolmogorov complexity, J COMPUT SY, 63(2), 2001, pp. 201-221

Authors: Giel, O
Citation: O. Giel, Branching program size is almost linear in formula size, J COMPUT SY, 63(2), 2001, pp. 222-235

Authors: Kabanets, V
Citation: V. Kabanets, Easiness assumptions and hardness tests: Trading time for zero error, J COMPUT SY, 63(2), 2001, pp. 236-252

Authors: Mulmuley, K Shah, P
Citation: K. Mulmuley et P. Shah, A lower bound for the shortest path problem, J COMPUT SY, 63(2), 2001, pp. 253-267

Authors: Tourlakis, I
Citation: I. Tourlakis, Time-space tradeoffs for SAT on nonuniform machines, J COMPUT SY, 63(2), 2001, pp. 268-287

Authors: Yang, K
Citation: K. Yang, Integer circuit evaluation is PSPACE-complete, J COMPUT SY, 63(2), 2001, pp. 288-303

Authors: Graham, FC
Citation: Fc. Graham, Special issue on Internet algorithms - Foreword, J COMPUT SY, 63(1), 2001, pp. 1-1

Authors: Kleinberg, J Rabani, Y Tardos, E
Citation: J. Kleinberg et al., Fairness in routing and load balancing, J COMPUT SY, 63(1), 2001, pp. 2-20

Authors: Feigenbaum, J Papadimitriou, CH Shenker, S
Citation: J. Feigenbaum et al., Sharing the cost of multicast transmissions, J COMPUT SY, 63(1), 2001, pp. 21-41

Authors: Kumar, R Raghavan, P Rajagopalan, S Tomkins, A
Citation: R. Kumar et al., Recommendation systems: A probabilistic analysis, J COMPUT SY, 63(1), 2001, pp. 42-61

Authors: Goel, A Meyerson, A Plotkin, S
Citation: A. Goel et al., Combining fairness with throughput: Online routing with multiple objectives, J COMPUT SY, 63(1), 2001, pp. 62-79

Authors: Hanlon, PJ Chung, D Chatterjee, S Genius, D Lebeck, AR Parker, E
Citation: Pj. Hanlon et al., The combinatorics of cache misses during matrix multiplication, J COMPUT SY, 63(1), 2001, pp. 80-126

Authors: Adler, M Leighton, T
Citation: M. Adler et T. Leighton, Compression using efficient multicasting, J COMPUT SY, 63(1), 2001, pp. 127-145

Authors: Ishihara, Y Shimizu, S Seki, H Ito, M
Citation: Y. Ishihara et al., Refinements of complexity results on type consistency for object-oriented databases, J COMPUT SY, 62(4), 2001, pp. 537-564

Authors: Hromkovic, J Seibert, S Wilke, T
Citation: J. Hromkovic et al., Translating regular expressions into small epsilon-free nondeterministic finite automata, J COMPUT SY, 62(4), 2001, pp. 565-588

Authors: Aumann, Y Hastad, J Rabin, MO Sudan, M
Citation: Y. Aumann et al., Linear-consistency testing, J COMPUT SY, 62(4), 2001, pp. 589-607

Authors: Kim, C
Citation: C. Kim, Separation results for separated apex NLC and NCE graph languages, J COMPUT SY, 62(4), 2001, pp. 608-628

Authors: Lautemann, C McKenzie, P Schwentick, T Vollmer, H
Citation: C. Lautemann et al., The descriptive complexity approach to LOGCFL, J COMPUT SY, 62(4), 2001, pp. 629-652

Authors: Hutter, M
Citation: M. Hutter, New error bounds for Solomonoff prediction, J COMPUT SY, 62(4), 2001, pp. 653-667

Authors: Kesten, Y Pnueli, A Vardi, MY
Citation: Y. Kesten et al., Verification by augmented abstraction: The automata-theoretic view, J COMPUT SY, 62(4), 2001, pp. 668-690

Authors: Awerbuch, B Azar, Y Plotkin, S Waarts, O
Citation: B. Awerbuch et al., Competitive routing of virtual circuits with unknown duration, J COMPUT SY, 62(3), 2001, pp. 385-397

Authors: Reif, JH
Citation: Jh. Reif, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, J COMPUT SY, 62(3), 2001, pp. 398-412
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>