default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Chris Pollett
@inproceedings{DBLP:conf/svcc/AustinPP23,
author = {Thomas H. Austin and
Katerina Potika and
Chris Pollett},
title = {Autonomous Lending Organization on Ethereum with Credit Scoring},
booktitle = {Silicon Valley Cybersecurity Conference, {SVCC} 2023, San Jose, CA,
USA, May 17-19, 2023},
pages = {1--8},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/SVCC56964.2023.10164922},
doi = {10.1109/SVCC56964.2023.10164922},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/svcc/AustinPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppna/PollettAPRP22,
author = {Chris Pollett and
Thomas H. Austin and
Katerina Potika and
Justin Rietz and
Prashant Pardeshi},
title = {TontineCoin: Survivor-based Proof-of-Stake},
journal = {Peer-to-Peer Netw. Appl.},
volume = {15},
number = {2},
pages = {988--1007},
year = {2022},
url = {https://doi.org/10.1007/s12083-021-01227-x},
doi = {10.1007/S12083-021-01227-X},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ppna/PollettAPRP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-00108,
author = {Pratikkumar Prajapati and
Chris Pollett},
title = {{MRI-GAN:} {A} Generalized Approach to Detect DeepFakes using Perceptual
Image Assessment},
journal = {CoRR},
volume = {abs/2203.00108},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.00108},
doi = {10.48550/ARXIV.2203.00108},
eprinttype = {arXiv},
eprint = {2203.00108},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-00108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataservice/KasbekarPP20,
author = {Priyanka Kasbekar and
Katerina Potika and
Chris Pollett},
title = {Find me if You Can: Aligning Users in Different Social Networks},
booktitle = {6th {IEEE} International Conference on Big Data Computing Service
and Applications, BigDataService 2020, Oxford, UK, August 3-6, 2020},
pages = {46--53},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/BigDataService49289.2020.00015},
doi = {10.1109/BIGDATASERVICE49289.2020.00015},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bigdataservice/KasbekarPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dappcon/PollettAPR20,
author = {Chris Pollett and
Thomas H. Austin and
Katerina Potika and
Justin Rietz},
editor = {Jie Xu and
Stefan Schulte and
Peter Ruppel and
Axel K{\"{u}}pper and
Divyesh Jadav},
title = {TontineCoin: Murder-Based Proof-of-Stake},
booktitle = {2nd {IEEE} International Conference on Decentralized Applications
and Infrastructures, {DAPPS} 2020, Oxford, UK, August 3-6, 2020},
pages = {82--87},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/DAPPS49028.2020.00009},
doi = {10.1109/DAPPS49028.2020.00009},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dappcon/PollettAPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isvc/DeshmukhP19,
author = {Kunal Deshmukh and
Chris Pollett},
editor = {George Bebis and
Richard Boyle and
Bahram Parvin and
Darko Koracin and
Daniela Ushizima and
Sek Chai and
Shinjiro Sueda and
Xin Lin and
Aidong Lu and
Daniel Thalmann and
Chaoli Wang and
Panpan Xu},
title = {Residual {CNN} Image Compression},
booktitle = {Advances in Visual Computing - 14th International Symposium on Visual
Computing, {ISVC} 2019, Lake Tahoe, NV, USA, October 7-9, 2019, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {11845},
pages = {371--382},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-33723-0\_30},
doi = {10.1007/978-3-030-33723-0\_30},
timestamp = {Tue, 21 Apr 2020 13:28:22 +0200},
biburl = {https://dblp.org/rec/conf/isvc/DeshmukhP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Pollett18,
author = {Chris Pollett},
title = {On the finite axiomatizability of},
journal = {Math. Log. Q.},
volume = {64},
number = {1-2},
pages = {6--24},
year = {2018},
url = {https://doi.org/10.1002/malq.201500092},
doi = {10.1002/MALQ.201500092},
timestamp = {Tue, 08 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Pollett18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caip/HammoudehP17,
author = {Zayd Hammoudeh and
Chris Pollett},
editor = {Michael Felsberg and
Anders Heyden and
Norbert Kr{\"{u}}ger},
title = {Clustering-Based, Fully Automated Mixed-Bag Jigsaw Puzzle Solving},
booktitle = {Computer Analysis of Images and Patterns - 17th International Conference,
{CAIP} 2017, Ystad, Sweden, August 22-24, 2017, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {10425},
pages = {205--217},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-64698-5\_18},
doi = {10.1007/978-3-319-64698-5\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/caip/HammoudehP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Pollett11,
author = {Chris Pollett},
title = {Conservative fragments of \emph{S}\({}^{\mbox{1}}\)\({}_{\mbox{2}}\)
and \emph{R}\({}^{\mbox{1}}\)\({}_{\mbox{2}}\)},
journal = {Arch. Math. Log.},
volume = {50},
number = {3-4},
pages = {367--393},
year = {2011},
url = {https://doi.org/10.1007/s00153-010-0220-9},
doi = {10.1007/S00153-010-0220-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Pollett11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-1307,
author = {Chris Pollett and
Eric Miles},
title = {Alternating Hierarchies for Time-Space Tradeoffs},
journal = {CoRR},
volume = {abs/0801.1307},
year = {2008},
url = {http://arxiv.org/abs/0801.1307},
eprinttype = {arXiv},
eprint = {0801.1307},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-1307.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PollettD07,
author = {Chris Pollett and
Norman Danner},
title = {Circuit principles and weak pigeonhole variants},
journal = {Theor. Comput. Sci.},
volume = {383},
number = {2-3},
pages = {115--131},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.04.017},
doi = {10.1016/J.TCS.2007.04.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PollettD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Pollett06,
author = {Chris Pollett},
title = {Languages to diagonalize against advice classes},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {341--361},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0202-1},
doi = {10.1007/S00037-005-0202-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Pollett06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/DannerP06,
author = {Norman Danner and
Chris Pollett},
title = {The weak pigeonhole principle for function classes in S\({}^{\mbox{1}}\)\({}_{\mbox{2}}\)},
journal = {Math. Log. Q.},
volume = {52},
number = {6},
pages = {575--584},
year = {2006},
url = {https://doi.org/10.1002/malq.200610015},
doi = {10.1002/MALQ.200610015},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/DannerP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0608039,
author = {Norman Danner and
Chris Pollett},
title = {The weak pigeonhole principle for function classes in S{\^{}}1{\_}2},
journal = {CoRR},
volume = {abs/cs/0608039},
year = {2006},
url = {http://arxiv.org/abs/cs/0608039},
eprinttype = {arXiv},
eprint = {cs/0608039},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0608039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AblayevGKMP05,
author = {Farid M. Ablayev and
Aida Gainutdinova and
Marek Karpinski and
Cristopher Moore and
Chris Pollett},
title = {On the computational power of probabilistic and quantum branching
program},
journal = {Inf. Comput.},
volume = {203},
number = {2},
pages = {145--162},
year = {2005},
url = {https://doi.org/10.1016/j.ic.2005.04.003},
doi = {10.1016/J.IC.2005.04.003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AblayevGKMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/PollettD05,
author = {Chris Pollett and
Norman Danner},
editor = {Mike D. Atkinson and
Frank K. H. A. Dehne},
title = {Circuit Principles and Weak Pigeonhole Variants},
booktitle = {Theory of Computing 2005, Eleventh {CATS} 2005, Computing: The Australasian
Theory Symposium, Newcastle, NSW, Australia, January/February 2005},
series = {{CRPIT}},
volume = {41},
pages = {31--40},
publisher = {Australian Computer Society},
year = {2005},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV41Pollett.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/PollettD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic/SimovaSP05,
author = {Martina Simova and
Mark Stamp and
Chris Pollett},
editor = {Hamid R. Arabnia and
Rose Joshua},
title = {Stealthy Ciphertext},
booktitle = {Proceedings of The 2005 International Conference on Internet Computing,
{ICOMP} 2005, Las Vegas, Nevada, USA, June 27-30, 2005},
pages = {380--388},
publisher = {{CSREA} Press},
year = {2005},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ic/SimovaSP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DannerP04,
author = {Norman Danner and
Chris Pollett},
title = {Minimization and {NP} multifunctions},
journal = {Theor. Comput. Sci.},
volume = {318},
number = {1-2},
pages = {105--119},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.10.020},
doi = {10.1016/J.TCS.2003.10.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DannerP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-014,
author = {Chris Pollett},
title = {Languages to diagonalize against advice classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-014}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-014/index.html},
eprinttype = {ECCC},
eprint = {TR04-014},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Pollett03,
author = {Chris Pollett},
title = {On the bounded version of Hilbert's tenth problem},
journal = {Arch. Math. Log.},
volume = {42},
number = {5},
pages = {469--488},
year = {2003},
url = {https://doi.org/10.1007/s00153-002-0162-y},
doi = {10.1007/S00153-002-0162-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Pollett03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannPB03,
author = {Arnold Beckmann and
Chris Pollett and
Samuel R. Buss},
title = {Ordinal notations and well-orderings in bounded arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {120},
number = {1-3},
pages = {197--223},
year = {2003},
url = {https://doi.org/10.1016/S0168-0072(02)00066-0},
doi = {10.1016/S0168-0072(02)00066-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannPB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannBP03,
author = {Arnold Beckmann and
Samuel R. Buss and
Chris Pollett},
title = {Erratum to "Ordinal notations and well-orderings in bounded arithmetic"
[Annals of Pure and Applied Logic 120 {(2003)} 197-223]},
journal = {Ann. Pure Appl. Log.},
volume = {123},
number = {1-3},
pages = {291},
year = {2003},
url = {https://doi.org/10.1016/S0168-0072(03)00039-3},
doi = {10.1016/S0168-0072(03)00039-3},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannBP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Pollett03,
author = {Chris Pollett},
title = {A theory for Log-Space and {NLIN} versus coNLIN},
journal = {J. Symb. Log.},
volume = {68},
number = {4},
pages = {1082--1090},
year = {2003},
url = {https://doi.org/10.2178/jsl/1067620174},
doi = {10.2178/JSL/1067620174},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Pollett03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/PollettP02,
author = {Chris Pollett and
Randall Pruim},
title = {Strengths and Weaknesses of {LH} Arithmetic},
journal = {Math. Log. Q.},
volume = {48},
number = {2},
pages = {221--243},
year = {2002},
url = {https://doi.org/10.1002/1521-3870(200202)48:2\&\#60;221::AID-MALQ221\&\#62;3.0.CO;2-V},
doi = {10.1002/1521-3870(200202)48:2\&\#60;221::AID-MALQ221\&\#62;3.0.CO;2-V},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/PollettP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/GreenHMP02,
author = {Frederic Green and
Steven Homer and
Cristopher Moore and
Christopher Pollett},
title = {Counting, fanout and the complexity of quantum {ACC}},
journal = {Quantum Inf. Comput.},
volume = {2},
number = {1},
pages = {35--65},
year = {2002},
url = {https://doi.org/10.26421/QIC2.1-3},
doi = {10.26421/QIC2.1-3},
timestamp = {Fri, 30 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/qic/GreenHMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AblayevMP02,
author = {Farid M. Ablayev and
Cristopher Moore and
Chris Pollett},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Quantum and Stochastic Branching Programs of Bounded Width},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {343--354},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_30},
doi = {10.1007/3-540-45465-9\_30},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AblayevMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-013,
author = {Chris Pollett and
Farid M. Ablayev and
Cristopher Moore},
title = {Quantum and Stochastic Programs of Bounded Width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-013}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-013/index.html},
eprinttype = {ECCC},
eprint = {TR02-013},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-051,
author = {Chris Pollett},
title = {Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-051}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-051/index.html},
eprinttype = {ECCC},
eprint = {TR02-051},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Pollett00,
author = {Chris Pollett},
title = {Multifunction algebras and the provability of {PH}},
journal = {Ann. Pure Appl. Log.},
volume = {104},
number = {1-3},
pages = {279--302},
year = {2000},
url = {https://doi.org/10.1016/S0168-0072(00)00015-4},
doi = {10.1016/S0168-0072(00)00015-4},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Pollett00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Pollett00,
author = {Chris Pollett},
title = {Translating I-Delta\({}_{\mbox{0}}\) + exp Proofs into Weaker Systems},
journal = {Math. Log. Q.},
volume = {46},
number = {2},
pages = {249--256},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1521-3870(200005)46:2\&\#60;249::AID-MALQ249\&\#62;3.0.CO;2-R},
doi = {10.1002/(SICI)1521-3870(200005)46:2\&\#60;249::AID-MALQ249\&\#62;3.0.CO;2-R},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Pollett00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GreenHP00,
author = {Frederic Green and
Steven Homer and
Chris Pollett},
title = {On the Complexity of Quantum {ACC}},
booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
Complexity, Florence, Italy, July 4-7, 2000},
pages = {250--262},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856756},
doi = {10.1109/CCC.2000.856756},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GreenHP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Pollett99,
author = {Chris Pollett},
title = {Structure and Definability in General Bounded Arithmetic Theories},
journal = {Ann. Pure Appl. Log.},
volume = {100},
number = {1-3},
pages = {189--245},
year = {1999},
url = {https://doi.org/10.1016/S0168-0072(99)00008-1},
doi = {10.1016/S0168-0072(99)00008-1},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Pollett99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/JohannsenP98,
author = {Jan Johannsen and
Chris Pollett},
title = {On Proofs about Threshold Circuits and Counting Hierarchies},
booktitle = {Thirteenth Annual {IEEE} Symposium on Logic in Computer Science, Indianapolis,
Indiana, USA, June 21-24, 1998},
pages = {444--452},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/LICS.1998.705678},
doi = {10.1109/LICS.1998.705678},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/JohannsenP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Pollett96,
author = {Chris Pollett},
editor = {Paul Beame and
Samuel R. Buss},
title = {A propositional proof system for \emph{R\({}^{\mbox{i}}\)\({}_{\mbox{2}}\)}},
booktitle = {Proof Complexity and Feasible Arithmetics, Proceedings of a {DIMACS}
Workshop, New Brunswick, New Jersey, USA, April 21-24, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {39},
pages = {253--277},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/039/14},
doi = {10.1090/DIMACS/039/14},
timestamp = {Sat, 30 Sep 2023 09:38:58 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Pollett96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-08-05 21:19 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:
