Result 1 to 20 of 39 total
Optimal measurements for the dihedral hidden subgroup problem. (English)
Chic. J. Theor. Comput. Sci. 2006, Article No. 2, 25 p., electronic only (2006).
1
Protocols for bounded-concurrent secure two-party computation in the plain model. (English)
Chic. J. Theor. Comput. Sci. 2006, Article No. 1, 50 p., electronic only (2006).
2
On Ajtai’s lower bound technique for $R$-way branching programs and the Hamming distance problem. (English)
Chic. J. Theor. Comput. Sci. 2005, Article No. 1, 16 p., electronic only (2005).
3
The query complexity of program checking by constant-depth circuits. (English)
Chic. J. Theor. Comput. Sci. 2002, Article No.2, 13 p., electronic only (2002).
4
Self-stabilizing local mutual exclusion and daemon refinement. (English)
Chic. J. Theor. Comput. Sci. 2002, Article No.1, 19 p., electronic only (2002).
5
Characterizing small depth and small space classes by operators of higher types. (English)
Chic. J. Theor. Comput. Sci. 2000, Article No.2, 22p., electronic only (2000).
6
Orthogonal accuracy clock synchronization. (English)
Chic. J. Theor. Comput. Sci. 2000, Article No.3, 79 p., electronic only (2000).
7
Supporting increment and decrement operations in balancing networks. (English)
Chic. J. Theor. Comput. Sci. 2000, Article No.4, 30 p., electronic only (2000).
8
Heuristics versus completeness in graph coloring. (English)
Chic. J. Theor. Comput. Sci. 2000, Article No.1, 16 p., electronic only (2000).
9
Self-stabilizing distributed constraint satisfaction. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.10, 38 p., electronic only (1999).
10
Satisfiability coding lemma. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.11, 19 p., electronic only (1999).
11
Time bounds for strong and hybrid consistency for arbitrary abstract data types. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.9, 64 p. (1999).
12
Lower bounds for linear satisfiability problems. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.8, 28 p. (1999).
13
The permanent requires large uniform threshold circuits. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.7, 19 p. (1999).
14
Hopfield neural networks and self-stabilization. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.6, 24 p. (1999).
15
Complexity of problems on graphs represented as OBDDs. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.5, 25 p. (1999).
16
The complexity of generating test instances. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.4 (1999).
17
Complements of multivalued functions. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.3, 20 p. (1999).
18
Randomized reductions and isomorphisms. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.2 (1999).
19
On finding the number of graph automorphisms. (English)
Chic. J. Theor. Comput. Sci. 1999, Article No.1 (1999).
20
Result 1 to 20 of 39 total
Start
Contact
Print
General Help
