Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Edwin Stearns
Person information
- award (1993): Turing Award
- award (1995): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j42]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. J. Mach. Learn. Res. 23: 251:1-251:43 (2022)- [j41]Daniel J. Rosenkrantz, Anil Vullikanti
, S. S. Ravi, Richard Edwin Stearns, Simon A. Levin, H. Vincent Poor, Madhav V. Marathe:
Fundamental limitations on efficiently forecasting certain epidemic measures in network models. Proc. Natl. Acad. Sci. USA 119(4): e2109228119 (2022) - 2019
- [j40]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - 2018
- [j39]Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe:
A characterization of nested canalyzing functions with maximum average sensitivity. Discret. Appl. Math. 251: 5-14 (2018) - 2017
- [j38]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring local transition functions of discrete dynamical systems from observations of system behavior. Theor. Comput. Sci. 679: 126-144 (2017) - 2011
- [j37]Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Theor. Comput. Sci. 412(30): 3932-3946 (2011) - 2008
- [j36]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
- [j35]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
- [j34]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
- [j33]Thomas C. O'Connell, Richard Edwin Stearns:
Mechanism design for software agents with complete information. Decis. Support Syst. 39(2): 197-217 (2005) - [j32]Richard Edwin Stearns, Harry B. Hunt III:
Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38(6): 731-761 (2005) - 2003
- [j31]Thomas C. O'Connell, Richard Edwin Stearns:
On finite strategy sets for finitely repeated zero-sum games. Games Econ. Behav. 43(1): 107-136 (2003) - [j30]Richard Edwin Stearns:
Deterministic versus nondeterministic time and lower bound problems. J. ACM 50(1): 91-95 (2003) - [j29]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
- [j28]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) - [j27]Richard Edwin Stearns, Harry B. Hunt III:
Exploiting structure in quantified formulas. J. Algorithms 43(2): 220-263 (2002) - 2001
- [j26]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. Electron. Notes Discret. Math. 9: 217-230 (2001) - 1998
- [j25]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) - [j24]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) - [j23]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
- [j22]Richard Edwin Stearns, Harry B. Hunt III:
An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25(2): 448-476 (1996) - 1994
- [j21]Richard Edwin Stearns:
Turing Award Lecture: It's Time to Reconsider Time. Commun. ACM 37(11): 95-99 (1994) - 1990
- [j20]Harry B. Hunt III, Richard Edwin Stearns:
The Complexity of Equivalence for Commutative Rings. J. Symb. Comput. 10(5): 411-436 (1990) - [j19]Richard Edwin Stearns, Harry B. Hunt III:
Power Indices and Easier Hard Problems. Math. Syst. Theory 23(4): 209-225 (1990) - [j18]Harry B. Hunt III, Richard Edwin Stearns:
The Complexity of Very Simple Boolean Formulas with Applications. SIAM J. Comput. 19(1): 44-70 (1990) - 1987
- [j17]Harry B. Hunt III, Richard Edwin Stearns:
Nonlinear Algebra and Optimization on Rings are "Hard". SIAM J. Comput. 16(5): 910-929 (1987) - 1985
- [j16]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
- [j15]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) - 1978
- [j14]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
- [j13]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) - 1974
- [j12]Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. J. Comput. Syst. Sci. 9(3): 279-307 (1974) - 1970
- [j11]Daniel J. Rosenkrantz, Richard Edwin Stearns:
Properties of Deterministic Top-Down Grammars. Inf. Control. 17(3): 226-256 (1970) - 1969
- [j10]Richard Edwin Stearns, Philip M. Lewis II:
Property Grammars and Table Machines. Inf. Control. 14(6): 524-549 (1969) - [j9]Juris Hartmanis, Richard Edwin Stearns:
Automata-based computational complexity. Inf. Sci. 1(2): 173-184 (1969) - 1968
- [j8]Philip M. Lewis II, Richard Edwin Stearns:
Syntax-Directed Transduction. J. ACM 15(3): 465-488 (1968) - 1967
- [j7]Richard Edwin Stearns:
A Regularity Test for Pushdown Machines. Inf. Control. 11(3): 323-340 (1967) - 1966
- [j6]F. C. Hennie, Richard Edwin Stearns:
Two-Tape Simulation of Multitape Turing Machines. J. ACM 13(4): 533-546 (1966) - 1964
- [j5]Juris Hartmanis, Richard Edwin Stearns:
Pair Algebra and Its Application to Automata Theory. Inf. Control. 7(4): 485-507 (1964) - 1963
- [j4]Richard Edwin Stearns, Juris Hartmanis:
Regularity Preserving Modifications of Regular Expressions. Inf. Control. 6(1): 55-69 (1963) - [j3]Juris Hartmanis, Richard Edwin Stearns:
A Study of Feedback and Errors in Sequential Machines. IEEE Trans. Electron. Comput. 12(3): 223-232 (1963) - 1962
- [j2]Juris Hartmanis, Richard Edwin Stearns:
Some Dangers in State Reduction of Sequential Machines. Inf. Control. 5(3): 252-260 (1962) - 1961
- [j1]Richard Edwin Stearns, Juris Hartmanis:
On the State Assignment Problem for Sequential Machines II. IRE Trans. Electron. Comput. 10(4): 593-603 (1961)
Conference and Workshop Papers
- 2024
- [c55]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. AAAI 2024: 14722-14730 - 2023
- [c54]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. AAAI 2023: 11663-11671 - [c53]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. AAMAS 2023: 600-608 - 2022
- [c52]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics. AAAI 2022: 9422-9430 - [c51]Daniel J. Rosenkrantz, Abhijin Adiga, Madhav V. Marathe, Zirou Qiu, S. S. Ravi, Richard Edwin Stearns, Anil Vullikanti:
Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries. ICML 2022: 18796-18808 - 2021
- [c50]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. AAAI 2021: 11334-11342 - 2020
- [c49]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems. AAAI 2020: 3138-3145 - [c48]Joshua D. Priest, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Evolution of Similar Configurations in Graph Dynamical Systems. COMPLEX NETWORKS (1) 2020: 544-555 - 2019
- [c47]Abhijin Adiga, Samarth Swarup, Anil Vullikanti, Christopher L. Barrett, Stephen G. Eubank, Chris J. Kuhlman, Madhav V. Marathe, Henning S. Mortveit, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Validating Agent-Based Models of Large Networked Systems. WSC 2019: 2807-2818 - 2018
- [c46]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Learning the Behavior of a Dynamical System Via a "20 Questions" Approach. AAAI 2018: 4630-4637 - [c45]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. AAMAS 2018: 1585-1594 - [c44]Abhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring Probabilistic Contagion Models Over Networks Using Active Queries. CIKM 2018: 377-386 - [c43]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Using Active Queries to Learn Local Stochastic Behaviors in Social Networks. COMPLEX NETWORKS (2) 2018: 246-257 - [c42]Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks. COMPLEX NETWORKS (1) 2018: 879-890 - 2015
- [c41]Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns:
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. AAMAS 2015: 1501-1509 - [c40]Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. CIAA 2015: 21-34 - 2013
- [c39]Philip M. Lewis, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. Fundamental Problems in Computing 2013: 13-43 - [c38]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
An analysis of several heuristics for the traveling salesman problem. Fundamental Problems in Computing 2013: 45-69 - [c37]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
System Level Concurrency Control for Distributed Database Systems. Fundamental Problems in Computing 2013: 71-98 - [c36]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis:
Consistency and serializability in concurrent database systems. Fundamental Problems in Computing 2013: 99-132 - [c35]Richard Edwin Stearns, Harry B. Hunt III:
Sums-of-Products and Subproblem Independence. Fundamental Problems in Computing 2013: 301-325 - 2012
- [c34]Juris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao:
The Turing Computational Model. ACM-TURING 2012: 8:1 - 2007
- [c33]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 - 2003
- [c32]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 - 2001
- [c31]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 - [c30]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 - [c29]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 - 1998
- [c28]Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Theory of Periodically Specified Problems: Complexity and Approximability. CCC 1998: 106- - 1996
- [c27]Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. Satisfiability Problem: Theory and Applications 1996: 225-259 - [c26]Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns:
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. Satisfiability Problem: Theory and Applications 1996: 603-641 - [c25]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 - [c24]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 - 1995
- [c23]George Becker, Neil V. Murray, Richard Edwin Stearns:
Refined Single-Threading for Parallel Functional Programming. LCR 1995: 321-324 - 1994
- [c22]Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
Generalized CNF Satisfiability Problems and Non-Efficient. SCT 1994: 356-366 - [c21]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 - [c20]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 - [c19]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 - 1992
- [c18]Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns:
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS 1992: 109-119 - 1988
- [c17]Harry B. Hunt III, Richard Edwin Stearns:
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC 1988: 250-258 - [c16]Richard Edwin Stearns:
Juris Hartmanis: the beginnings of computational complexity. SCT 1988: 128-134 - 1986
- [c15]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 - 1981
- [c14]Richard Edwin Stearns, Harry B. Hunt III:
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata. FOCS 1981: 74-81 - [c13]Richard Edwin Stearns, Daniel J. Rosenkrantz:
Distributed Database Concurrency Controls Using Before-Values. SIGMOD Conference 1981: 74-83 - 1977
- [c12]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
A System Level Concurrency Control for Distributed Database Systems. Berkeley Workshop 1977: 132-145 - 1976
- [c11]Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz:
Concurrency Control for Database Systems. FOCS 1976: 19-32 - 1974
- [c10]Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
Approximate Algorithms for the Traveling Salesperson Problem. SWAT 1974: 33-42 - 1973
- [c9]Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Attributed Translations. STOC 1973: 160-171 - 1969
- [c8]Richard Edwin Stearns, Daniel J. Rosenkrantz:
Table Machine Simulation. SWAT 1969: 118-128 - [c7]Daniel J. Rosenkrantz, Richard Edwin Stearns:
Properties of Deterministic Top Down Grammars. STOC 1969: 165-180 - 1968
- [c6]Richard Edwin Stearns, Philip M. Lewis II:
Property Grammars and Table Machines. SWAT 1968: 106-119 - 1966
- [c5]Philip M. Lewis II, Richard Edwin Stearns:
Syntax Directed Transduction. SWAT 1966: 21-35 - 1965
- [c4]Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II:
Hierarchies of memory limited computations. SWCT 1965: 179-190 - [c3]Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis:
Memory bounds for recognition of context-free and context-sensitive languages. SWCT 1965: 191-202 - 1964
- [c2]Juris Hartmanis, Richard Edwin Stearns:
Computational complexity of recursive sequences. SWCT 1964: 82-90 - [c1]Richard Edwin Stearns, Juris Hartmanis:
On the application of pair algebra to automata theory. SWCT 1964: 192-196
Parts in Books or Collections
- 2006
- [p1]Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Towards a Predictive Computational Complexity Theory. Computational Complexity and Statistical Physics 2006: 285-
Informal and Other Publications
- 2024
- [i7]Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Learning the Topology and Behavior of Discrete Dynamical Systems. CoRR abs/2402.11686 (2024) - 2023
- [i6]Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Assigning Agents to Increase Network-Based Neighborhood Diversity. CoRR abs/2301.02876 (2023) - [i5]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. CoRR abs/2301.02889 (2023) - [i4]Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti:
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems. CoRR abs/2301.04090 (2023) - 2019
- [i3]Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. CoRR abs/1906.03752 (2019) - 1998
- [i2]Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns:
The Complexity of Planar Counting Problems. CoRR cs.CC/9809017 (1998) - [i1]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)
Coauthor Index
Philip M. Lewis
aka: Philip M. Lewis II
aka: Philip M. Lewis II
[j42] [j41] [j40] [j39] [j38] [j37] [j36] [j35] [j34] [j29] [j28] [j25] [j15] [j14] [j13] [j12] [j11] [c55] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [c39] [c38] [c37] [c36] [c33] [c32] [c31] [c29] [c28] [c26] [c25] [c24] [c21] [c20] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [p1] [i7] [i6] [i5] [i4] [i3]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
