Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2008 | ||
---|---|---|

63 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Theor. Comput. Sci. 395(1): 132-133 (2008) | |

2007 | ||

62 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Computational Aspects of Analyzing Social Network Dynamics. IJCAI 2007: 2268-2273 | |

61 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur: Predecessor existence problems for finite discrete dynamical systems. Theor. Comput. Sci. 386(1-2): 3-37 (2007) | |

2006 | ||

60 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Complexity of reachability problems for finite discrete dynamical systems. J. Comput. Syst. Sci. 72(8): 1317-1345 (2006) | |

2005 | ||

59 | Thomas C. O'Connell, Richard Edwin Stearns: Mechanism design for software agents with complete information. Decision Support Systems 39(2): 197-217 (2005) | |

58 | Richard Edwin Stearns, Harry B. Hunt III: Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38(6): 731-761 (2005) | |

2003 | ||

57 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. DMCS 2003: 69-80 | |

56 | Richard Edwin Stearns: Deterministic versus nondeterministic time and lower bound problems. J. ACM 50(1): 91-95 (2003) | |

55 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Reachability problems for sequential dynamical systems with threshold functions. Theor. Comput. Sci. 295: 41-64 (2003) | |

2002 | ||

54 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Inf. Comput. 173(1): 40-63 (2002) | |

53 | Richard Edwin Stearns, Harry B. Hunt III: Exploiting structure in quantified formulas. J. Algorithms 43(2): 220-263 (2002) | |

2001 | ||

52 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic: Gardens of Eden and Fixed Points in Sequential Dynamical Systems. DM-CCG 2001: 95-110 | |

51 | Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. ISSAC 2001: 183-191 | |

50 | Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. MFCS 2001: 159-172 | |

49 | Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. Electronic Notes in Discrete Mathematics 9: 217-230 (2001) | |

1998 | ||

48 | Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns: Theory of Periodically Specified Problems: Complexity and Approximability. IEEE Conference on Computational Complexity 1998: 106- | |

47 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems CoRR cs.CC/9809017: (1998) | |

46 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems CoRR cs.CC/9809064: (1998) | |

45 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26(2): 238-274 (1998) | |

44 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns: The Complexity of Planar Counting Problems. SIAM J. Comput. 27(4): 1142-1167 (1998) | |

43 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27(5): 1237-1261 (1998) | |

1996 | ||

42 | Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns: On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). ICALP 1996: 466-477 | |

41 | Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns: I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). PODC 1996: 122 | |

40 | Richard Edwin Stearns, Harry B. Hunt III: An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25(2): 448-476 (1996) | |

1994 | ||

39 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA 1994: 424-435 | |

38 | Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns: Approximation Schemes Using L-Reductions. FSTTCS 1994: 342-353 | |

37 | Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan: Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC 1994: 468-477 | |

36 | Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns: Generalized CNF Satisfiability Problems and Non-Efficient. Structure in Complexity Theory Conference 1994: 356-366 | |

35 | Richard Edwin Stearns: Turing Award Lecture: It's Time to Reconsider Time. Commun. ACM 37(11): 95-99 (1994) | |

1992 | ||

34 | Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns: Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119 | |

1990 | ||

33 | Harry B. Hunt III, Richard Edwin Stearns: The Complexity of Equivalence for Commutative Rings. J. Symb. Comput. 10(5): 411-436 (1990) | |

32 | Richard Edwin Stearns, Harry B. Hunt III: Power Indices and Easier Hard Problems. Mathematical Systems Theory 23(4): 209-225 (1990) | |

31 | Harry B. Hunt III, Richard Edwin Stearns: The Complexity of Very Simple Boolean Formulas with Applications. SIAM J. Comput. 19(1): 44-70 (1990) | |

1988 | ||

30 | Harry B. Hunt III, Richard Edwin Stearns: On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC 1988: 250-258 | |

1987 | ||

29 | Harry B. Hunt III, Richard Edwin Stearns: Nonlinear Algebra and Optimization on Rings are ``Hard''. SIAM J. Comput. 16(5): 910-929 (1987) | |

1986 | ||

28 | Harry B. Hunt III, Richard Edwin Stearns: Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). STACS 1986: 277-290 | |

1985 | ||

27 | Richard Edwin Stearns, Harry B. Hunt III: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. SIAM J. Comput. 14(3): 598-611 (1985) | |

1984 | ||

26 | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: Consistency and Serializability in Concurrent Database Systems. SIAM J. Comput. 13(3): 508-530 (1984) | |

1981 | ||

25 | Richard Edwin Stearns, Harry B. Hunt III: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata FOCS 1981: 74-81 | |

24 | Richard Edwin Stearns, Daniel J. Rosenkrantz: Distributed Database Concurrency Controls Using Before-Values. SIGMOD Conference 1981: 74-83 | |

1978 | ||

23 | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: System Level Concurrency Control for Distributed Database Systems. ACM Trans. Database Syst. 3(2): 178-198 (1978) | |

1977 | ||

22 | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: A System Level Concurrency Control for Distributed Database Systems. Berkeley Workshop 1977: 132-145 | |

21 | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput. 6(3): 563-581 (1977) | |

1976 | ||

20 | Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz: Concurrency Control for Database Systems FOCS 1976: 19-32 | |

1974 | ||

19 | Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II: Approximate Algorithms for the Traveling Salesperson Problem FOCS 1974: 33-42 | |

18 | Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns: Attributed Translations. J. Comput. Syst. Sci. 9(3): 279-307 (1974) | |

1973 | ||

17 | Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns: Attributed Translations STOC 1973: 160-171 | |

1970 | ||

16 | Daniel J. Rosenkrantz, Richard Edwin Stearns: Properties of Deterministic Top-Down Grammars Information and Control 17(3): 226-256 (1970) | |

1969 | ||

15 | Richard Edwin Stearns, Daniel J. Rosenkrantz: Table Machine Simulation FOCS 1969: 118-128 | |

14 | Daniel J. Rosenkrantz, Richard Edwin Stearns: Properties of Deterministic Top Down Grammars STOC 1969: 165-180 | |

13 | Richard Edwin Stearns, Philip M. Lewis II: Property Grammars and Table Machines Information and Control 14(6): 524-549 (1969) | |

1968 | ||

12 | Richard Edwin Stearns, Philip M. Lewis II: Property Grammars and Table Machines FOCS 1968: 106-119 | |

11 | Philip M. Lewis II, Richard Edwin Stearns: Syntax-Directed Transduction. J. ACM 15(3): 465-488 (1968) | |

1967 | ||

10 | Richard Edwin Stearns: A Regularity Test for Pushdown Machines Information and Control 11(3): 323-340 (1967) | |

1966 | ||

9 | Philip M. Lewis II, Richard Edwin Stearns: Syntax Directed Transduction FOCS 1966: 21-35 | |

8 | F. C. Hennie, Richard Edwin Stearns: Two-Tape Simulation of Multitape Turing Machines. J. ACM 13(4): 533-546 (1966) | |

1965 | ||

7 | Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II: Hierarchies of memory limited computations FOCS 1965: 179-190 | |

6 | Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis: Memory bounds for recognition of context-free and context-sensitive languages FOCS 1965: 191-202 | |

1964 | ||

5 | Richard Edwin Stearns, Juris Hartmanis: On the application of pair algebra to automata theory FOCS 1964: 192-196 | |

4 | Juris Hartmanis, Richard Edwin Stearns: Computational complexity of recursive sequences FOCS 1964: 82-90 | |

3 | Juris Hartmanis, Richard Edwin Stearns: Pair Algebra and Its Application to Automata Theory Information and Control 7(4): 485-507 (1964) | |

1963 | ||

2 | Richard Edwin Stearns, Juris Hartmanis: Regularity Preserving Modifications of Regular Expressions Information and Control 6(1): 55-69 (1963) | |

1962 | ||

1 | Juris Hartmanis, Richard Edwin Stearns: Some Dangers in State Reduction of Sequential Machines Information and Control 5(3): 252-260 (1962) |

1 | Christopher L. Barrett | [50] [52] [55] [57] [60] [61] [62] [63] |

2 | Juris Hartmanis | [1] [2] [3] [4] [5] [6] [7] |

3 | F. C. Hennie | [8] |

4 | Harry B. Hunt III | [25] [27] [28] [29] [30] [31] [32] [33] [34] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [53] [54] [55] [57] [58] [60] [61] [62] [63] |

5 | Philip M. Lewis (Philip M. Lewis II) | [6] [7] [9] [11] [12] [13] [17] [18] [19] [20] [21] [22] [23] [26] |

6 | Madhav V. Marathe | [36] [37] [38] [39] [43] [44] [45] [46] [47] [48] [49] [50] [51] [52] [54] [55] [57] [60] [61] [62] [63] |

7 | Thomas C. O'Connell | [59] |

8 | Venkatesh Radhakrishnan | [34] [37] [38] [39] [43] [44] [45] [46] [47] [54] |

9 | S. S. Ravi | [38] [39] [41] [45] [50] [52] [54] [55] [57] [60] [61] [62] [63] |

10 | Daniel J. Rosenkrantz | [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [26] [38] [39] [41] [42] [45] [48] [50] [52] [54] [55] [57] [60] [61] [62] [63] |

11 | Sandeep K. Shukla | [41] [42] |

12 | Mayur Thakur | [61] [62] [63] |

13 | Predrag T. Tosic | [52] |