The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Richard Edwin Stearns: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    System Level Concurrency Control for Distributed Database Systems. [Citation Graph (79, 15)][DBLP]
    ACM Trans. Database Syst., 1978, v:3, n:2, pp:178-198 [Journal]
  2. Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz
    Concurrency Control for Database Systems [Citation Graph (36, 0)][DBLP]
    FOCS, 1976, pp:19-32 [Conf]
  3. Richard Edwin Stearns, Daniel J. Rosenkrantz
    Distributed Database Concurrency Controls Using Before-Values. [Citation Graph (33, 10)][DBLP]
    SIGMOD Conference, 1981, pp:74-83 [Conf]
  4. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    An Analysis of Several Heuristics for the Traveling Salesman Problem. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:563-581 [Journal]
  5. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    A System Level Concurrency Control for Distributed Database Systems. [Citation Graph (2, 0)][DBLP]
    Berkeley Workshop, 1977, pp:132-145 [Conf]
  6. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    Consistency and Serializability in Concurrent Database Systems. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:508-530 [Journal]
  7. Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II
    Hierarchies of memory limited computations [Citation Graph (1, 0)][DBLP]
    FOCS, 1965, pp:179-190 [Conf]
  8. F. C. Hennie, Richard Edwin Stearns
    Two-Tape Simulation of Multitape Turing Machines. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1966, v:13, n:4, pp:533-546 [Journal]
  9. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Attributed Translations. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:279-307 [Journal]
  10. Harry B. Hunt III, Richard Edwin Stearns
    On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    AAECC, 1988, pp:250-258 [Conf]
  11. Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
    Generalized CNF Satisfiability Problems and Non-Efficient. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:356-366 [Conf]
  12. Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Theory of Periodically Specified Problems: Complexity and Approximability. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:106-0 [Conf]
  13. 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. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:95-110 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    DMCS, 2003, pp:69-80 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:424-435 [Conf]
  16. Juris Hartmanis, Richard Edwin Stearns
    Computational complexity of recursive sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1964, pp:82-90 [Conf]
  17. Philip M. Lewis II, Richard Edwin Stearns
    Syntax Directed Transduction [Citation Graph (0, 0)][DBLP]
    FOCS, 1966, pp:21-35 [Conf]
  18. Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis
    Memory bounds for recognition of context-free and context-sensitive languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1965, pp:191-202 [Conf]
  19. Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
    Approximate Algorithms for the Traveling Salesperson Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:33-42 [Conf]
  20. Richard Edwin Stearns, Juris Hartmanis
    On the application of pair algebra to automata theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1964, pp:192-196 [Conf]
  21. Richard Edwin Stearns, Harry B. Hunt III
    On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:74-81 [Conf]
  22. Richard Edwin Stearns, Philip M. Lewis II
    Property Grammars and Table Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:106-119 [Conf]
  23. Richard Edwin Stearns, Daniel J. Rosenkrantz
    Table Machine Simulation [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:118-128 [Conf]
  24. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Approximation Schemes Using L-Reductions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:342-353 [Conf]
  25. 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). [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:466-477 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2268-2273 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:183-191 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:159-172 [Conf]
  29. 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). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:122- [Conf]
  30. Harry B. Hunt III, Richard Edwin Stearns
    Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:277-290 [Conf]
  31. Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns
    Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:109-119 [Conf]
  32. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Attributed Translations [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:160-171 [Conf]
  33. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:468-477 [Conf]
  34. Daniel J. Rosenkrantz, Richard Edwin Stearns
    Properties of Deterministic Top Down Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:165-180 [Conf]
  35. Richard Edwin Stearns
    Turing Award Lecture: It's Time to Reconsider Time. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1994, v:37, n:11, pp:95-99 [Journal]
  36. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  37. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  38. Thomas C. O'Connell, Richard Edwin Stearns
    Mechanism design for software agents with complete information. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2005, v:39, n:2, pp:197-217 [Journal]
  39. Juris Hartmanis, Richard Edwin Stearns
    Some Dangers in State Reduction of Sequential Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1962, v:5, n:3, pp:252-260 [Journal]
  40. Juris Hartmanis, Richard Edwin Stearns
    Pair Algebra and Its Application to Automata Theory [Citation Graph (0, 0)][DBLP]
    Information and Control, 1964, v:7, n:4, pp:485-507 [Journal]
  41. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:40-63 [Journal]
  42. Daniel J. Rosenkrantz, Richard Edwin Stearns
    Properties of Deterministic Top-Down Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1970, v:17, n:3, pp:226-256 [Journal]
  43. Richard Edwin Stearns
    A Regularity Test for Pushdown Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1967, v:11, n:3, pp:323-340 [Journal]
  44. Richard Edwin Stearns, Juris Hartmanis
    Regularity Preserving Modifications of Regular Expressions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1963, v:6, n:1, pp:55-69 [Journal]
  45. Richard Edwin Stearns, Philip M. Lewis II
    Property Grammars and Table Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:14, n:6, pp:524-549 [Journal]
  46. Philip M. Lewis II, Richard Edwin Stearns
    Syntax-Directed Transduction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:3, pp:465-488 [Journal]
  47. Richard Edwin Stearns
    Deterministic versus nondeterministic time and lower bound problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:91-95 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:2, pp:238-274 [Journal]
  49. Richard Edwin Stearns, Harry B. Hunt III
    Exploiting structure in quantified formulas. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:220-263 [Journal]
  50. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1317-1345 [Journal]
  51. Harry B. Hunt III, Richard Edwin Stearns
    The Complexity of Equivalence for Commutative Rings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:5, pp:411-436 [Journal]
  52. Richard Edwin Stearns, Harry B. Hunt III
    Resource Bounds and Subproblem Independence. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:731-761 [Journal]
  53. Richard Edwin Stearns, Harry B. Hunt III
    Power Indices and Easier Hard Problems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:4, pp:209-225 [Journal]
  54. Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
    The Complexity of Planar Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1142-1167 [Journal]
  55. Harry B. Hunt III, Richard Edwin Stearns
    Nonlinear Algebra and Optimization on Rings are ``Hard''. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:910-929 [Journal]
  56. Harry B. Hunt III, Richard Edwin Stearns
    The Complexity of Very Simple Boolean Formulas with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:1, pp:44-70 [Journal]
  57. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
    Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1237-1261 [Journal]
  58. Richard Edwin Stearns, Harry B. Hunt III
    On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:598-611 [Journal]
  59. Richard Edwin Stearns, Harry B. Hunt III
    An Algebraic Model for Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:448-476 [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:41-64 [Journal]
  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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:386, n:1-2, pp:3-37 [Journal]

Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002