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

Search the dblp DataBase

Title:
Author:
Daniel J. Rosenkrantz: [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. Daniel J. Rosenkrantz, Harry B. Hunt III
    Processing Conjunctive Predicates and Queries. [Citation Graph (42, 16)][DBLP]
    VLDB, 1980, pp:64-72 [Conf]
  3. 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]
  4. 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]
  5. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Testing Predicate Locks. [Citation Graph (9, 9)][DBLP]
    SIGMOD Conference, 1979, pp:127-133 [Conf]
  6. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi
    Deferred Updates and Data Placement in Distributed Databases. [Citation Graph (8, 13)][DBLP]
    ICDE, 1996, pp:469-476 [Conf]
  7. Daniel J. Rosenkrantz
    Dynamic Database Dumping. [Citation Graph (8, 10)][DBLP]
    SIGMOD Conference, 1978, pp:3-8 [Conf]
  8. 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]
  9. 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]
  10. Lin Yu, Daniel J. Rosenkrantz
    Minimizing Time-Space Cost For Database Version Control. [Citation Graph (2, 11)][DBLP]
    PODS, 1988, pp:294-301 [Conf]
  11. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
    On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:222-268 [Journal]
  12. 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]
  13. Lin Yu, Daniel J. Rosenkrantz
    Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. [Citation Graph (1, 9)][DBLP]
    PODS, 1990, pp:28-39 [Conf]
  14. Daniel J. Rosenkrantz
    Programmed Grammars and Classes of Formal Languages. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:107-131 [Journal]
  15. 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]
  16. Daniel J. Rosenkrantz, Harry B. Hunt III
    The Complexity of STructural Containment and Equivalence. [Citation Graph (0, 0)][DBLP]
    Theoretical Studies in Computer Science, 1992, pp:101-132 [Conf]
  17. Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz
    HORNSAT, Model Checking, Verification and games (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAV, 1996, pp:99-110 [Conf]
  18. Parvathi Chundi, Daniel J. Rosenkrantz
    On lossy time decompositions of time stamped documents. [Citation Graph (0, 0)][DBLP]
    CIKM, 2004, pp:437-445 [Conf]
  19. 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]
  20. Parvathi Chundi, Rui Zhang 0004, Daniel J. Rosenkrantz
    Efficient Algorithms for Constructing Time Decompositions of Time Stamped Documents. [Citation Graph (0, 0)][DBLP]
    DEXA, 2005, pp:514-523 [Conf]
  21. 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]
  22. 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]
  23. Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Jagdish Gangolly
    Structure-Based Resilience Metrics for Service-Oriented Networks. [Citation Graph (0, 0)][DBLP]
    EDCC, 2005, pp:345-362 [Conf]
  24. 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]
  25. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:152-160 [Conf]
  26. Daniel J. Rosenkrantz
    Programmed Grammars: A New Device for Generating Formal Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:14-20 [Conf]
  27. Daniel J. Rosenkrantz, Philip M. Lewis II
    Deterministic Left Corner Parsing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1970, pp:139-152 [Conf]
  28. 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]
  29. Richard Edwin Stearns, Daniel J. Rosenkrantz
    Table Machine Simulation [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:118-128 [Conf]
  30. 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]
  31. Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:238-247 [Conf]
  32. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Construction and Analysis of Fault-Secure Multiprocessor Schedules. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:120-127 [Conf]
  33. Ragini Shamsunder, Daniel J. Rosenkrantz, S. S. Ravi
    Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    FTCS, 1993, pp:280-289 [Conf]
  34. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:487-498 [Conf]
  35. 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]
  36. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
    Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1989, pp:111-115 [Conf]
  37. 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]
  38. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
    On Materializations of Array-Valued Temporaries. [Citation Graph (0, 0)][DBLP]
    LCPC, 2000, pp:127-141 [Conf]
  39. 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]
  40. Parvathi Chundi, Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
    Active Client Primary-Backup Protocols (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:264- [Conf]
  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). [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:122- [Conf]
  42. Harry B. Hunt III, Daniel J. Rosenkrantz
    Efficient Algorithms for Structural Similarity of Grammars. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:213-219 [Conf]
  43. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi
    Multi-site distributed database transactions utilizing deferred update. [Citation Graph (0, 0)][DBLP]
    SAC, 1997, pp:118-122 [Conf]
  44. Parvathi Chundi, Daniel J. Rosenkrantz
    Constructing Time Decompositions for Analyzing Time-Stamped Documents. [Citation Graph (0, 0)][DBLP]
    SDM, 2004, pp:- [Conf]
  45. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees Short or Small. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:546-555 [Conf]
  46. Harry B. Hunt III, Daniel J. Rosenkrantz
    Computational Parallels between the Regular and Context-Free Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:64-74 [Conf]
  47. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Attributed Translations [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:160-171 [Conf]
  48. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Many birds with one stone: multi-objective approximation algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:438-447 [Conf]
  49. Daniel J. Rosenkrantz, Richard Edwin Stearns
    Properties of Deterministic Top Down Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:165-180 [Conf]
  50. Lin Yu, Daniel J. Rosenkrantz
    A Linear-Time Scheme for Version Reconstruction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:141-152 [Conf]
  51. S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi
    Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:355-366 [Conf]
  52. Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
    Sufficient-Completeness, Ground-Reducibility and their Complexity. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:4, pp:311-350 [Journal]
  53. Lin Yu, Daniel J. Rosenkrantz
    Minimizing Time-Space Cost for Database Version Control. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:7, pp:627-663 [Journal]
  54. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:58-78 [Journal]
  55. Daniel J. Rosenkrantz, Lin Yu, S. S. Ravi
    Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:83-100 [Journal]
  56. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  57. Parvathi Chundi, Daniel J. Rosenkrantz
    Information Preserving Time Decompositions of Time Stamped Documents*. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 2006, v:13, n:1, pp:41-65 [Journal]
  58. 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]
  59. 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]
  60. Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
    Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    International Journal of Parallel Programming, 1999, v:27, n:4, pp:289-323 [Journal]
  61. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Algorithms for Path-Based Placement of Inspection Stations on Networks. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:2, pp:136-149 [Journal]
  62. Daniel J. Rosenkrantz, Harry B. Hunt III
    Matrix Multiplication for Finite Algebraic Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:4, pp:189-192 [Journal]
  63. Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
    Algebraic Structures with Hard Equivalence and Minimization Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:879-904 [Journal]
  64. Harry B. Hunt III, Daniel J. Rosenkrantz
    On Equivalence and Containment Problems for Formal Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:3, pp:387-396 [Journal]
  65. Daniel J. Rosenkrantz
    JACM 1986-1990. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:18- [Journal]
  66. Daniel J. Rosenkrantz
    Matrix Equations and Normal Forms for Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1967, v:14, n:3, pp:501-507 [Journal]
  67. 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]
  68. Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
    Bicriteria Network Design Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:142-171 [Journal]
  69. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Facility Dispersion Problems Under Capacity and Cost Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:1, pp:7-33 [Journal]
  70. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:395-419 [Journal]
  71. 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]
  72. Philip J. Bernhard, Harry B. Hunt III, Daniel J. Rosenkrantz
    Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:1, pp:39-49 [Journal]
  73. Philip J. Bernhard, Daniel J. Rosenkrantz
    An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:11, n:1, pp:72-85 [Journal]
  74. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:18, n:1, pp:56-70 [Journal]
  75. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi
    Path problems in networks with vector-valued edge weights. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:19-35 [Journal]
  76. Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi
    Obtaining online approximation algorithms for facility dispersion from offline algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:206-217 [Journal]
  77. Harry B. Hunt III, Daniel J. Rosenkrantz
    Computational Parallels Between the Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:99-114 [Journal]
  78. Harry B. Hunt III, Daniel J. Rosenkrantz
    Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:831-850 [Journal]
  79. Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz
    On the Computational Complexity of Algebra on Lattices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:129-148 [Journal]
  80. Daniel J. Rosenkrantz, Harry B. Hunt III
    Polynomial Algorithms for Deterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:405-412 [Journal]
  81. Daniel J. Rosenkrantz, Harry B. Hunt III
    The Complexity of Processing Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:627-649 [Journal]
  82. Lin Yu, Daniel J. Rosenkrantz
    Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:824-855 [Journal]
  83. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Spanning Trees - Short or Small. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:178-200 [Journal]
  84. Serge Abiteboul, Richard Hull, Victor Vianu, Sheila A. Greibach, Michael A. Harrison, Ellis Horowitz, Daniel J. Rosenkrantz, Jeffrey D. Ullman, Moshe Y. Vardi
    In memory of Seymour Ginsburg 1928 - 2004. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2005, v:34, n:1, pp:5-12 [Journal]
  85. Kenneth A. Ross, Jiawei Han, Nick Koudas, Rajeev Rastogi, Daniel J. Rosenkrantz, Peter Scheuermann, Dan Suciu
    Reminiscences on Influential Papers. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2001, v:30, n:3, pp:101-104 [Journal]
  86. Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz
    The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:865-869 [Journal]
  87. Dechang Gu, Daniel J. Rosenkrantz, S. S. Ravi
    Construction of Check Sets for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:6, pp:641-650 [Journal]
  88. Daniel J. Rosenkrantz
    Half-Hot State Assignments for Finite State Machines. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:5, pp:700-702 [Journal]
  89. Daniel J. Rosenkrantz, S. S. Ravi
    Improved Bounds for Algorithm-Based Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1993, v:42, n:5, pp:630-635 [Journal]
  90. 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]
  91. Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz
    On the Size of Binary Decision Diagrams Representing Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:45-69 [Journal]
  92. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:3-38 [Journal]
  93. Harry B. Hunt III, Daniel J. Rosenkrantz, Thomas G. Szymanski
    The Covering Problem for Linear Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:361-382 [Journal]
  94. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]
  95. 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]
  96. Daniel J. Rosenkrantz, Harry B. Hunt III
    Testing for Grammatical Coverings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:323-341 [Journal]
  97. Lin Yu, Daniel J. Rosenkrantz
    Ancestor Controlled Submodule Inclusion in Design Databases. [Citation Graph (0, 12)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1993, v:5, n:2, pp:352-362 [Journal]
  98. Lin Yu, Daniel J. Rosenkrantz
    A Linear-Time Scheme for Version Reconstruction. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:775-797 [Journal]
  99. Daniel J. Rosenkrantz, Harry B. Hunt III
    Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1987, v:9, n:4, pp:543-566 [Journal]
  100. Daniel J. Rosenkrantz, Lenore M. R. Mullin, Harry B. Hunt III
    On minimizing materializations of array-valued temporaries. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:6, pp:1145-1177 [Journal]
  101. Philip J. Bernhard, Daniel J. Rosenkrantz
    Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:4, pp:503-507 [Journal]
  102. Philip J. Bernhard, Daniel J. Rosenkrantz
    Partitioning Message Patterns for Bundled Omega Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:4, pp:353-363 [Journal]
  103. Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi
    Local base station assignment with time intervals in mobile computing environments. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:157, n:2, pp:267-285 [Journal]
  104. 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]

  105. Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation. [Citation Graph (, )][DBLP]


  106. Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. [Citation Graph (, )][DBLP]


  107. A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT [Citation Graph (, )][DBLP]


  108. Efficient algorithms for segmentation of item-set time series. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.607secs
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