{"@attributes":{"name":"Vijay Raghavan 0002","pid":"r\/VVRaghavan2","n":"33"},"person":{"@attributes":{"key":"homepages\/r\/VVRaghavan2","mdate":"2015-10-02"},"author":"Vijay Raghavan 0002","note":"Vanderbilt University, Department of Computer Science"},"homonyms":{"@attributes":{"n":"6"},"h":[{"@attributes":{"f":"r\/Raghavan:Vijay"},"person":{"@attributes":{"publtype":"disambiguation","key":"homepages\/262\/3261","mdate":"2020-04-14"},"author":"Vijay Raghavan"}},{"@attributes":{"f":"r\/Raghavan_0001:Vijay"},"person":{"@attributes":{"key":"homepages\/r\/VVRaghavan1","mdate":"2021-04-09"},"author":["Vijay Raghavan 0001","Vijay V. Raghavan 0001"],"url":["http:\/\/web.cacs.louisiana.edu\/~raghavan\/","https:\/\/scholar.google.com\/citations?user=GFW9JacAAAAJ","https:\/\/www.linkedin.com\/in\/vijay-raghavan-39916215","https:\/\/orcid.org\/0000-0001-7224-7828"],"note":["University of Louisiana at Lafayette, Center for Advanced Computer Studies (CACS)","University of Regina, Department of Computer Science"]}},{"@attributes":{"f":"r\/Raghavan_0003:Vijay"},"person":{"@attributes":{"key":"homepages\/r\/VVRaghavan3","mdate":"2023-12-21"},"author":["Vijay Raghavan 0003","Vijay V. Raghavan 0003"],"url":["http:\/\/www.nku.edu\/~raghavan\/","https:\/\/informatics.nku.edu\/departments\/business-informatics\/people\/raghavan.html","https:\/\/orcid.org\/0000-0003-1038-0038"],"note":"Northern Kentucky University, Department of Business Informatics, KY, USA"}},{"@attributes":{"f":"r\/Raghavan_0004:Vijay"},"person":{"@attributes":{"key":"homepages\/r\/VVRaghavan4","mdate":"2016-01-04"},"author":"Vijay Raghavan 0004","note":"Lisle Technology, Bangalore, India"}},{"@attributes":{"f":"r\/Raghavan_0005:Vijay"},"person":{"@attributes":{"key":"homepages\/r\/VVRaghavan5","mdate":"2016-01-04"},"author":"Vijay Raghavan 0005","note":"Mathworks Inc., Natick"}},{"@attributes":{"f":"r\/Raghavan_0006:Vijay"},"person":{"@attributes":{"key":"homepages\/r\/VRaghavan6","mdate":"2015-10-27"},"author":"Vijay Raghavan 0006","url":"https:\/\/www.linkedin.com\/pub\/vijay-raghavan\/0\/a\/543","note":"Red Brick Systems Inc., Los Gatos, USA"}}]},"r":[{"article":{"@attributes":{"key":"journals\/jcss\/HellersteinR05","mdate":"2021-02-16"},"author":["Lisa Hellerstein","Vijay Raghavan 0002"],"title":"Exact learning of DNF formulas using DNF hypotheses.","pages":"435-470","year":"2005","volume":"70","journal":"J. Comput. Syst. Sci.","number":"4","ee":"https:\/\/doi.org\/10.1016\/j.jcss.2004.10.001","url":"db\/journals\/jcss\/jcss70.html#HellersteinR05"}},{"article":{"@attributes":{"key":"journals\/jal\/RaghavanS03","mdate":"2017-05-28"},"author":["Vijay Raghavan 0002","Jeremy P. Spinrad"],"title":"Robust algorithms for restricted domains.","pages":"160-172","year":"2003","volume":"48","journal":"J. Algorithms","number":"1","ee":"https:\/\/doi.org\/10.1016\/S0196-6774(03)00048-8","url":"db\/journals\/jal\/jal48.html#RaghavanS03"}},{"article":{"@attributes":{"key":"journals\/order\/FelsnerRS03","mdate":"2018-11-14"},"author":["Stefan Felsner","Vijay Raghavan 0002","Jeremy P. Spinrad"],"title":"Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number.","pages":"351-364","year":"2003","volume":"20","journal":"Order","number":"4","ee":["https:\/\/doi.org\/10.1023\/B:ORDE.0000034609.99940.fb","https:\/\/www.wikidata.org\/entity\/Q56430242"],"url":"db\/journals\/order\/order20.html#FelsnerRS03"}},{"article":{"@attributes":{"key":"journals\/pami\/MaurerQR03","mdate":"2017-05-17"},"author":["Calvin R. Maurer Jr.","Rensheng Qi","Vijay Raghavan 0002"],"title":"A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions.","pages":"265-270","year":"2003","volume":"25","journal":"IEEE Trans. Pattern Anal. Mach. Intell.","number":"2","ee":["https:\/\/doi.org\/10.1109\/TPAMI.2003.1177156","http:\/\/doi.ieeecomputersociety.org\/10.1109\/TPAMI.2003.1177156"],"url":"db\/journals\/pami\/pami25.html#MaurerQR03"}},{"article":{"@attributes":{"key":"journals\/tcs\/ArenasBCHRS03","mdate":"2021-02-17"},"author":["Marcelo Arenas","Leopoldo E. Bertossi","Jan Chomicki","Xin He","Vijay Raghavan 0002","Jeremy P. Spinrad"],"title":"Scalar aggregation in inconsistent databases.","pages":"405-434","year":"2003","journal":"Theor. Comput. Sci.","number":"3","volume":"296","ee":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00737-5","url":"db\/journals\/tcs\/tcs296.html#ArenasBCHRS03"}},{"article":{"@attributes":{"key":"journals\/tcs\/MehtaR02","mdate":"2021-02-17"},"author":["Dinesh P. Mehta","Vijay Raghavan 0002"],"title":"Decision tree approximations of Boolean functions.","pages":"609-623","year":"2002","volume":"270","journal":"Theor. Comput. Sci.","number":"1-2","url":"db\/journals\/tcs\/tcs270.html#MehtaR02","ee":["https:\/\/doi.org\/10.1016\/S0304-3975(01)00011-1","https:\/\/www.wikidata.org\/entity\/Q56340226"]}},{"inproceedings":{"@attributes":{"key":"conf\/stoc\/HellersteinR02","mdate":"2018-11-06"},"author":["Lisa Hellerstein","Vijay Raghavan 0002"],"title":"Exact learning of DNF formulas using DNF hypotheses.","pages":"465-473","year":"2002","crossref":"conf\/stoc\/2002","booktitle":"STOC","ee":"https:\/\/doi.org\/10.1145\/509907.509976","url":"db\/conf\/stoc\/stoc2002.html#HellersteinR02"}},{"article":{"@attributes":{"key":"journals\/tcs\/GuijarroLR01","mdate":"2021-02-17"},"author":["David Guijarro","V\u00edctor Lav\u00edn","Vijay Raghavan 0002"],"title":"Monotone term decision lists.","pages":"549-575","year":"2001","volume":"259","journal":"Theor. Comput. Sci.","number":"1-2","url":"db\/journals\/tcs\/tcs259.html#GuijarroLR01","ee":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00043-8"}},{"inproceedings":{"@attributes":{"key":"conf\/ipmi\/MaurerRQ01","mdate":"2017-05-19"},"author":["Calvin R. Maurer Jr.","Vijay Raghavan 0002","Rensheng Qi"],"title":"A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions.","pages":"358-364","year":"2001","crossref":"conf\/ipmi\/2001","booktitle":"IPMI","ee":"https:\/\/doi.org\/10.1007\/3-540-45729-1_35","url":"db\/conf\/ipmi\/ipmi2001.html#MaurerRQ01"}},{"inproceedings":{"@attributes":{"key":"conf\/soda\/RaghavanS01","mdate":"2015-09-27"},"author":["Vijay Raghavan 0002","Jeremy P. Spinrad"],"title":"Robust algorithms for restricted domains.","pages":"460-467","year":"2001","crossref":"conf\/soda\/2001","booktitle":"SODA","ee":"http:\/\/dl.acm.org\/citation.cfm?id=365411.365507","url":"db\/conf\/soda\/soda2001.html#RaghavanS01"}},{"article":{"@attributes":{"key":"journals\/endm\/RaghavanS00","mdate":"2020-02-20"},"author":["Vijay Raghavan 0002","Jeremy P. Spinrad"],"title":"Solving Problems on Special Classes of Graphs.","pages":"266-269","year":"2000","volume":"5","journal":"Electron. Notes Discret. Math.","ee":"https:\/\/doi.org\/10.1016\/S1571-0653(05)80182-9","url":"db\/journals\/endm\/endm5.html#RaghavanS00"}},{"article":{"@attributes":{"key":"journals\/jcss\/Raghavan00","mdate":"2021-02-16"},"author":"Vijay Raghavan 0002","title":"Editor's Foreword.","pages":"233","year":"2000","volume":"60","journal":"J. Comput. Syst. Sci.","number":"2","url":"db\/journals\/jcss\/jcss60.html#Raghavan00","ee":"https:\/\/doi.org\/10.1006\/jcss.1999.1668"}},{"inproceedings":{"@attributes":{"key":"conf\/colt\/MehtaR00","mdate":"2015-10-27"},"author":["Dinesh P. Mehta","Vijay Raghavan 0002"],"title":"Decision Tree Approximations of Boolean Functions.","pages":"16-24","year":"2000","crossref":"conf\/colt\/2000","booktitle":"COLT","url":"db\/conf\/colt\/colt2000.html#MehtaR00"}},{"article":{"@attributes":{"key":"journals\/ipl\/GuijarroLR99","mdate":"2017-06-06"},"author":["David Guijarro","V\u00edctor Lav\u00edn","Vijay Raghavan 0002"],"title":"Exact Learning when Irrelevant Variables Abound.","pages":"233-239","year":"1999","volume":"70","journal":"Inf. Process. Lett.","number":"5","url":"db\/journals\/ipl\/ipl70.html#GuijarroLR99","ee":"https:\/\/doi.org\/10.1016\/S0020-0190(99)00063-0"}},{"inproceedings":{"@attributes":{"key":"conf\/eurocolt\/GuijarroLR99","mdate":"2017-05-23"},"author":["David Guijarro","V\u00edctor Lav\u00edn","Vijay Raghavan 0002"],"title":"Exact Learning when Irrelevant Variables Abound.","pages":"91-100","ee":"https:\/\/doi.org\/10.1007\/3-540-49097-3_8","year":"1999","crossref":"conf\/eurocolt\/1999","booktitle":"EuroCOLT","url":"db\/conf\/eurocolt\/eurocolt1999.html#GuijarroLR99"}},{"inproceedings":{"@attributes":{"key":"conf\/fsttcs\/LozanoR98","mdate":"2017-09-16"},"author":["Antoni Lozano","Vijay Raghavan 0002"],"title":"On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms.","pages":"295-306","year":"1998","crossref":"conf\/fsttcs\/1998","booktitle":"FSTTCS","url":"db\/conf\/fsttcs\/fsttcs98.html#LozanoR98","ee":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_28"}},{"article":{"@attributes":{"key":"journals\/mst\/RaghavanW97","mdate":"2017-05-28"},"author":["Vijay Raghavan 0002","Dawn Wilkins"],"title":"A Characterization and Nearly Linear-Time Equivalence Test for \u00b5-Branching Programs.","pages":"249-283","year":"1997","volume":"30","journal":"Theory Comput. Syst.","number":"3","url":"db\/journals\/mst\/mst30.html#RaghavanW97","ee":"https:\/\/doi.org\/10.1007\/s002240000053"}},{"inproceedings":{"@attributes":{"key":"conf\/eurocolt\/GuijarroLR97","mdate":"2017-05-22"},"author":["David Guijarro","V\u00edctor Lav\u00edn","Vijay Raghavan 0002"],"title":"Learning Monotone Term Decision Lists.","pages":"16-26","year":"1997","crossref":"conf\/eurocolt\/1997","booktitle":"EuroCOLT","url":"db\/conf\/eurocolt\/eurocolt1997.html#GuijarroLR97","ee":"https:\/\/doi.org\/10.1007\/3-540-62685-9_3"}},{"article":{"@attributes":{"key":"journals\/jacm\/HellersteinPRW96","mdate":"2018-11-06"},"author":["Lisa Hellerstein","Krishnan Pillaipakkamnatt","Vijay Raghavan 0002","Dawn Wilkins"],"title":"How Many Queries Are Needed to Learn?","pages":"840-862","year":"1996","volume":"43","journal":"J. ACM","number":"5","url":"db\/journals\/jacm\/jacm43.html#HellersteinPRW96","ee":"https:\/\/doi.org\/10.1145\/234752.234755"}},{"article":{"@attributes":{"key":"journals\/ml\/PillaipakkamnattR96","mdate":"2020-03-02"},"author":["Krishnan Pillaipakkamnatt","Vijay Raghavan 0002"],"title":"On the Limits of Proper Learnability of Subclasses of DNF Formulas.","pages":"237-263","year":"1996","volume":"25","journal":"Mach. Learn.","number":"2-3","url":"db\/journals\/ml\/ml25.html#PillaipakkamnattR96","ee":"https:\/\/doi.org\/10.1023\/A:1026455409889"}},{"article":{"@attributes":{"key":"journals\/tc\/Raghavan96","mdate":"2017-05-20"},"author":"Vijay Raghavan 0002","title":"Weighted Diagnosis with Asymmetric Invalidation.","pages":"1435-1438","year":"1996","volume":"45","journal":"IEEE Trans. Computers","number":"12","url":"db\/journals\/tc\/tc45.html#Raghavan96","ee":["https:\/\/doi.org\/10.1109\/12.545973","http:\/\/doi.ieeecomputersociety.org\/10.1109\/12.545973"]}},{"article":{"@attributes":{"key":"journals\/iandc\/PillaipakkamnattR95","mdate":"2021-02-12"},"author":["Krishnan Pillaipakkamnatt","Vijay Raghavan 0002"],"title":"Read-Twice DNF Formulas are Properly Learnable.","pages":"236-267","year":"1995","volume":"122","journal":"Inf. Comput.","number":"2","url":"db\/journals\/iandc\/iandc122.html#PillaipakkamnattR95","ee":"https:\/\/doi.org\/10.1006\/inco.1995.1149"}},{"inproceedings":{"@attributes":{"key":"conf\/stoc\/HellersteinPRW95","mdate":"2018-11-06"},"author":["Lisa Hellerstein","Krishnan Pillaipakkamnatt","Vijay Raghavan 0002","Dawn Wilkins"],"title":"How many queries are needed to learn?","pages":"190-199","year":"1995","crossref":"conf\/stoc\/STOC27","booktitle":"STOC","ee":"https:\/\/doi.org\/10.1145\/225058.225114","url":"db\/conf\/stoc\/stoc1995.html#HellersteinPRW95"}},{"article":{"@attributes":{"key":"journals\/jcss\/Raghavan94","mdate":"2021-02-16"},"author":"Vijay Raghavan 0002","title":"Bounded Degree Graph Inference from Walks.","pages":"108-132","year":"1994","volume":"49","journal":"J. Comput. Syst. Sci.","number":"1","url":"db\/journals\/jcss\/jcss49.html#Raghavan94","ee":"https:\/\/doi.org\/10.1016\/S0022-0000(05)80089-3"}},{"inproceedings":{"@attributes":{"key":"conf\/colt\/PillaipakkamnattR94","mdate":"2018-11-06"},"author":["Krishnan Pillaipakkamnatt","Vijay Raghavan 0002"],"title":"On the Limits of Proper Learnability of Subclasses of DNF Formulas.","pages":"118-129","year":"1994","crossref":"conf\/colt\/1994","booktitle":"COLT","ee":"https:\/\/doi.org\/10.1145\/180139.181063","url":"db\/conf\/colt\/colt1994.html#PillaipakkamnattR94"}},{"article":{"@attributes":{"key":"journals\/ipl\/PillaipakkamnattR93","mdate":"2017-05-26"},"author":["Krishnan Pillaipakkamnatt","Vijay Raghavan 0002"],"title":"A Linear Time Equivalene Test for Read-Twice DNF Formulas.","pages":"289-295","year":"1993","volume":"48","journal":"Inf. Process. Lett.","number":"6","url":"db\/journals\/ipl\/ipl48.html#PillaipakkamnattR93","ee":"https:\/\/doi.org\/10.1016\/0020-0190(93)90171-5"}},{"article":{"@attributes":{"key":"journals\/tc\/Raghavan93","mdate":"2017-05-20"},"author":"Vijay Raghavan 0002","title":"On Asymmetric Invalidation with Partial Tests.","pages":"764-768","year":"1993","volume":"42","journal":"IEEE Trans. Computers","number":"6","url":"db\/journals\/tc\/tc42.html#Raghavan93","ee":["https:\/\/doi.org\/10.1109\/12.277298","http:\/\/doi.ieeecomputersociety.org\/10.1109\/12.277298"]}},{"inproceedings":{"@attributes":{"key":"conf\/colt\/RaghavanW93","mdate":"2018-11-06"},"author":["Vijay Raghavan 0002","Dawn Wilkins"],"title":"Learning \u00b5-branching Programs with Queries.","pages":"27-36","year":"1993","crossref":"conf\/colt\/1993","booktitle":"COLT","ee":"https:\/\/doi.org\/10.1145\/168304.168308","url":"db\/conf\/colt\/colt1993.html#RaghavanW93"}},{"inproceedings":{"@attributes":{"key":"conf\/eurocolt\/Pillaipakkamnatt93","mdate":"2021-08-10"},"author":["Krishnan Pillaipakkamnatt","Vijay Raghavan 0002"],"title":"Read-twice DNF formulas are properly learnable.","pages":"121-132","year":"1993","booktitle":"EuroCOLT","crossref":"conf\/eurocolt\/1993","url":"db\/conf\/eurocolt\/eurocolt1993.html#Pillaipakkamnatt93"}},{"article":{"@attributes":{"key":"journals\/tc\/RaghavanT91","mdate":"2017-05-20"},"author":["Vijay Raghavan 0002","Anand R. Tripathi"],"title":"Improved Diagnosability Algorithms.","pages":"143-153","year":"1991","volume":"40","journal":"IEEE Trans. Computers","number":"2","url":"db\/journals\/tc\/tc40.html#RaghavanT91","ee":["https:\/\/doi.org\/10.1109\/12.73585","http:\/\/doi.ieeecomputersociety.org\/10.1109\/12.73585"]}},{"article":{"@attributes":{"key":"journals\/tc\/RaghavanT91a","mdate":"2017-05-20"},"author":["Vijay Raghavan 0002","Anand R. Tripathi"],"title":"Sequential Diagnosability is Co-NP Complete.","pages":"584-595","year":"1991","volume":"40","journal":"IEEE Trans. Computers","number":"5","url":"db\/journals\/tc\/tc40.html#RaghavanT91a","ee":["https:\/\/doi.org\/10.1109\/12.88482","http:\/\/doi.ieeecomputersociety.org\/10.1109\/12.88482"]}},{"inproceedings":{"@attributes":{"key":"conf\/colt\/Raghavan91","mdate":"2015-10-27"},"author":"Vijay Raghavan 0002","title":"Bounded Degree Graph Inference from Walks.","pages":"354-366","year":"1991","crossref":"conf\/colt\/1991","booktitle":"COLT","ee":"http:\/\/dl.acm.org\/citation.cfm?id=114869","url":"db\/conf\/colt\/colt1991.html#Raghavan91"}},{"inproceedings":{"@attributes":{"key":"conf\/colt\/RaghavanS90","mdate":"2015-10-27"},"author":["Vijay Raghavan 0002","Stephen R. Schach"],"title":"Learning Switch Configurations.","pages":"38-51","year":"1990","crossref":"conf\/colt\/1990","booktitle":"COLT","ee":"http:\/\/dl.acm.org\/citation.cfm?id=92578","url":"db\/conf\/colt\/colt1990.html#RaghavanS90"}}],"coauthors":{"@attributes":{"n":"17","nc":"4"},"co":[{"@attributes":{"c":"0"},"na":"Marcelo Arenas"},{"@attributes":{"c":"0","n":"2"},"na":["Leo Bertossi","Leopoldo E. Bertossi"]},{"@attributes":{"c":"0"},"na":"Jan Chomicki"},{"@attributes":{"c":"0"},"na":"Stefan Felsner"},{"@attributes":{"c":"3"},"na":"David Guijarro"},{"@attributes":{"c":"0"},"na":"Xin He"},{"@attributes":{"c":"1"},"na":"Lisa Hellerstein"},{"@attributes":{"c":"-1"},"na":"Antoni Lozano"},{"@attributes":{"c":"2"},"na":"Calvin R. Maurer Jr."},{"@attributes":{"c":"-1","n":"2"},"na":["Dinesh Mehta","Dinesh P. Mehta"]},{"@attributes":{"c":"1"},"na":"Krishnan Pillaipakkamnatt"},{"@attributes":{"c":"3","n":"2"},"na":["V\u00edctor Lav\u00edn Puente","V\u00edctor Lav\u00edn"]},{"@attributes":{"c":"2"},"na":"Rensheng Qi"},{"@attributes":{"c":"-1"},"na":"Stephen R. Schach"},{"@attributes":{"c":"0"},"na":"Jeremy P. Spinrad"},{"@attributes":{"c":"-1"},"na":"Anand R. Tripathi"},{"@attributes":{"c":"1"},"na":"Dawn Wilkins"}]}}