Journals in DBLP

Theor. Comput. Sci.
2000, volume: 243, number: 1-2

1. Józef Winkowski
   Processes of timed Petri nets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:1-34 [Journal]
   
2. Roberto De Prisco, Butler W. Lampson, Nancy A. Lynch
   Revisiting the PAXOS algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:35-91 [Journal]
   
3. Peter Padawitz
   Swinging types=functions+relations+transition systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:93-165 [Journal]
   
4. Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov
   Decidability and complexity of simultaneous rigid E-unification with one variable and related results. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:167-184 [Journal]
   
5. Noriko H. Arai
   Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:185-197 [Journal]
   
6. Jonathan P. Seldin
   A Gentzen-style sequent calculus of constructions with expansion rules. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:199-215 [Journal]
   
7. Shlomo Moran, Sagi Snir
   Simple and efficient network decomposition and synchronization. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:217-241 [Journal]
   
8. Rida A. Bazzi
   Planar quorums. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:243-268 [Journal]
   
9. K. B. Lakshmanan, Daniel J. Rosenkrantz, S. S. Ravi
   Alarm placement in systems with fault propagation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2000, v:243, n:1-2, pp:269-288 [Journal]
   
10. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
    Power consumption in packet radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:289-305 [Journal]
    
11. Yuh-Jzer Joung
    Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:307-338 [Journal]
    
12. David Meier, Beverly A. Sanders
    Composing leads-to properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:339-361 [Journal]
    
13. Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin
    Secure distributed storage and retrieval. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:363-389 [Journal]
    
14. Wan Fokkink
    Language preorder as a precongruence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:391-408 [Journal]
    
15. Tuomas Aura, Johan Lilius
    A causal semantics for time Petri nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:409-447 [Journal]
    
16. Qing Zhou
    Grzegorczyk's hierarchy of computable analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:449-466 [Journal]
    
17. Alexander Moshe Rabinovich
    Symbolic model checking for µ-calculus requires exponential time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:467-475 [Journal]
    
18. Fabio Massacci
    The proof complexity of analytic and clausal tableaux. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:477-487 [Journal]
    
19. Alfons Geser
    On normalizing, non-terminating one-rule string rewriting systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:489-498 [Journal]