( en | de | ru )

 

Disambiguation of "Nerode, Anil"

Author of the publication

copydeleteadd this publication to your clipboard
An Algebraic Proof of Kirchhoff's Network Theorem

, and . The American Mathematical Monthly, 68 (3): 244--247 (1961)
DOI: 10.2307/2311455

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ata Anil

Anil Bhatti

Anil Jain

Anil Jain

Anil Kottantharayil

 

Other publications of authors with the same name

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems., , and . Ann. Pure Appl. Log., 67 (1-3): 269-323 (1994)Computing Definite Logic Programs by Partial Instantiation., , and . Ann. Pure Appl. Log., 67 (1-3): 161-182 (1994)On the Complexity of Abduction., , and . LICS, page 513-522. IEEE Computer Society, (1996)Polynomially Grade Logic I: A Graded Version of System T, , and . LICS, page 375-385. IEEE Computer Society, (1989)Tableaux for Functional Dependencies and Independencies., , , and . TABLEAUX, volume 1227 of Lecture Notes in Computer Science, page 358-372. Springer, (1997)Performance evaluation of media losses in the Continuous Media Toolkit., , , , and . MSE, page 60-67. IEEE Computer Society, (1998)The Stable Models of a Predicate Logic Program., , and . JICSLP, page 446-460. MIT Press, (1992)Logic for Applications., and . Texts and Monographs in Computer Science Springer, (1993)Implementing Stable Semantics by Linear Programming., , , and . LPNMR, page 23-42. MIT Press, (1993)Rule Systems and Well-Orderings., , and . Structural Complexity and Recursion-theoretic methods in Logic-Programming, page 69-92. Mathematical Sciences Institute, Cornell University, (1992)