Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Samik Sengupta
@article{DBLP:journals/jcss/FortnowPS08,
author = {Lance Fortnow and
Aduri Pavan and
Samik Sengupta},
title = {Proving {SAT} does not have small circuits with an application to
the two queries problem},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
pages = {358--363},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.017},
doi = {10.1016/J.JCSS.2007.06.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FortnowPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PavanSSV07,
author = {Aduri Pavan and
Alan L. Selman and
Samik Sengupta and
N. V. Vinodchandran},
title = {Polylogarithmic-round interactive proofs for coNP collapse the exponential
hierarchy},
journal = {Theor. Comput. Sci.},
volume = {385},
number = {1-3},
pages = {167--178},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.06.013},
doi = {10.1016/J.TCS.2007.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PavanSSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserPSS06,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {2},
pages = {516--542},
year = {2006},
url = {https://doi.org/10.1137/S009753970444421X},
doi = {10.1137/S009753970444421X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GlasserPSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GlasserSS05,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta},
title = {Reductions between disjoint NP-Pairs},
journal = {Inf. Comput.},
volume = {200},
number = {2},
pages = {247--267},
year = {2005},
url = {https://doi.org/10.1016/j.ic.2005.03.003},
doi = {10.1016/J.IC.2005.03.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GlasserSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CaiCPS04,
author = {Jin{-}yi Cai and
Denis Charles and
Aduri Pavan and
Samik Sengupta},
title = {On Higher Arthur-Merlin Classes},
journal = {Int. J. Found. Comput. Sci.},
volume = {15},
number = {1},
pages = {3--19},
year = {2004},
url = {https://doi.org/10.1142/S0129054104002273},
doi = {10.1142/S0129054104002273},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/CaiCPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserSSZ04,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta and
Liyu Zhang},
title = {Disjoint NP-Pairs},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {6},
pages = {1369--1416},
year = {2004},
url = {https://doi.org/10.1137/S0097539703425848},
doi = {10.1137/S0097539703425848},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GlasserSSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserSS04,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta},
title = {Reductions between Disjoint NP-Pairs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {42--53},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313791},
doi = {10.1109/CCC.2004.1313791},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SelmanS04,
author = {Alan L. Selman and
Samik Sengupta},
title = {Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential
Hierarchy},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {82--90},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313805},
doi = {10.1109/CCC.2004.1313805},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SelmanS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserPSS04,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {184--197},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313839},
doi = {10.1109/CCC.2004.1313839},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CrasmaruGRS04,
author = {Marcel Cr{\^{a}}smaru and
Christian Gla{\ss}er and
Kenneth W. Regan and
Samik Sengupta},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {A Protocol for Serializing Unique Strategies},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {660--672},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_51},
doi = {10.1007/978-3-540-28629-5\_51},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CrasmaruGRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-007,
author = {Alan L. Selman and
Samik Sengupta},
title = {Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential
Hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-007}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-007/index.html},
eprinttype = {ECCC},
eprint = {TR04-007},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-019,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-019}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-019/index.html},
eprinttype = {ECCC},
eprint = {TR04-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserSSZ03,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta and
Liyu Zhang},
title = {Disjoint NP-Pairs},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {313--332},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214430},
doi = {10.1109/CCC.2003.1214430},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserSSZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowPS03,
author = {Lance Fortnow and
Aduri Pavan and
Samik Sengupta},
title = {Proving {SAT} does not have Small Circuits with an Application to
the Two},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {347},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214433},
doi = {10.1109/CCC.2003.1214433},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-011,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta and
Liyu Zhang},
title = {Disjoint NP-Pairs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-011}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-011/index.html},
eprinttype = {ECCC},
eprint = {TR03-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-027,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Samik Sengupta},
title = {Reductions between Disjoint NP-Pairs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-027}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-027/index.html},
eprinttype = {ECCC},
eprint = {TR03-027},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CaiCPS02,
author = {Jin{-}yi Cai and
Denis Charles and
Aduri Pavan and
Samik Sengupta},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {On Higher Arthur-Merlin Classes},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {18--27},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_4},
doi = {10.1007/3-540-45655-4\_4},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CaiCPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vlsid/BaruaS97,
author = {Rana Barua and
Samik Sengupta},
title = {Architectures for Arithmetic over GF(2\({}^{\mbox{m}}\))},
booktitle = {10th International Conference on {VLSI} Design {(VLSI} Design 1997),
4-7 January 1997, Hyderabad, India},
pages = {465--469},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ICVD.1997.568178},
doi = {10.1109/ICVD.1997.568178},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vlsid/BaruaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-25 05:47 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:
