AAAAAA
Results:
1-17
|
Results: 17
Authors:
KUPFERMAN O
VARDI MY
Citation: O. Kupferman et My. Vardi, VERIFICATION OF FAIR TRANSITION-SYSTEMS, Chicago journal of theoretical computer science, (2), 1998, pp. 1-37
Authors:
THIERAUF T
Citation: T. Thierauf, THE ISOMORPHISM-PROBLEM FOR READ-ONCE BRANCHING PROGRAMS AND ARITHMETIC CIRCUITS, Chicago journal of theoretical computer science, (1), 1998, pp. 1-23
Authors:
MAHAJAN M
VINAY V
Citation: M. Mahajan et V. Vinay, DETERMINANT - COMBINATORICS, ALGORITHMS, AND COMPLEXITY, Chicago journal of theoretical computer science, (5), 1997, pp. 1-26
Authors:
DOLEV S
HERMAN T
Citation: S. Dolev et T. Herman, SUPERSTABILIZING PROTOCOLS FOR DYNAMIC DISTRIBUTED SYSTEMS, Chicago journal of theoretical computer science, (4), 1997, pp. 1-40
Authors:
VARGHESE G
ARORA A
GOUDA M
Citation: G. Varghese et al., SELF-STABILIZATION BY TREE CORRECTION, Chicago journal of theoretical computer science, (3), 1997, pp. 1-32
Authors:
KANN V
KHANNA S
LAGERGREN J
PANCONESI A
Citation: V. Kann et al., ON THE HARDNESS OF APPROXIMATING MAX K-CUT AND ITS DUAL, Chicago journal of theoretical computer science, (2), 1997, pp. 1-18
Authors:
FEIGE U
KILIAN J
Citation: U. Feige et J. Kilian, ON LIMITED VERSUS POLYNOMIAL NONDETERMINISM, Chicago journal of theoretical computer science, (1), 1997, pp. 1-20
Authors:
MIDDENDORF M
Citation: M. Middendorf, MANHATTAN CHANNEL ROUTING IS NP-COMPLETE UNDER TRULY RESTRICTED SETTINGS, Chicago journal of theoretical computer science, (6), 1996, pp. 1-19
Authors:
HOOVER HJ
RUDNICKI P
Citation: Hj. Hoover et P. Rudnicki, UNIFORM SELF-STABILIZING ORIENTATION OF UNICYCLIC NETWORKS UNDER READWRITE ATOMICITY/, Chicago journal of theoretical computer science, (5), 1996, pp. 1-37
Authors:
BUNTROCK G
NIEMANN G
Citation: G. Buntrock et G. Niemann, WEAKLY GROWING CONTEXT-SENSITIVE GRAMMARS, Chicago journal of theoretical computer science, (4), 1996, pp. 1-53
Authors:
GERSTEL O
CIDON I
ZAKS S
Citation: O. Gerstel et al., OPTIMAL VIRTUAL PATH LAYOUT IN ATM NETWORKS WITH SHARED ROUTING TABLESWITCHES, Chicago journal of theoretical computer science, (3), 1996, pp. 1-36
Authors:
OGIHARA M
Citation: M. Ogihara, SPARSE HARD SETS FOR P YIELD SPACE-EFFICIENT ALGORITHMS, Chicago journal of theoretical computer science, (2), 1996, pp. 1-13
Authors:
VARDI MY
Citation: My. Vardi, RANK PREDICATES VS PROGRESS MEASURES IN CONCURRENT-PROGRAM VERIFICATION, Chicago journal of theoretical computer science, (1), 1996, pp. 1-8
Authors:
CONDON A
FEIGENBAUM J
LUND C
SHOR PW
Citation: A. Condon et al., PROBABILISTICALLY CHECKABLE DEBATE SYSTEMS AND NONAPPROXIMABILITY OF PSPACE-HARD FUNCTIONS, Chicago journal of theoretical computer science, 1(4), 1995, pp. 1-35
Authors:
KLARLUND N
KOZEN D
Citation: N. Klarlund et D. Kozen, RABIN MEASURES, Chicago journal of theoretical computer science, 1(3), 1995, pp. 1-24
Authors:
GROLMUSZ V
Citation: V. Grolmusz, ON THE WEAK MOD-M REPRESENTATION OF BOOLEAN FUNCTIONS, Chicago journal of theoretical computer science, 1(2), 1995, pp. 1-8
Authors:
NISAN N
TASHMA A
Citation: N. Nisan et A. Tashma, SYMMETRICAL LOGSPACE IS CLOSED UNDER COMPLEMENT, Chicago journal of theoretical computer science, 1(1), 1995, pp. 1-11
Risultati:
1-17
|