Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Martin Tompa
@article{DBLP:journals/bmcbi/TsengT09,
author = {Huei{-}Hun Elizabeth Tseng and
Martin Tompa},
title = {Algorithms for locating extremely conserved elements in multiple sequence
alignments},
journal = {{BMC} Bioinform.},
volume = {10},
pages = {432},
year = {2009},
url = {https://doi.org/10.1186/1471-2105-10-432},
doi = {10.1186/1471-2105-10-432},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/TsengT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/WangNZTSZ09,
author = {Kai Wang and
Manikandan Narayanan and
Hua Zhong and
Martin Tompa and
Eric E. Schadt and
Jun Zhu},
title = {Meta-analysis of Inter-species Liver Co-expression Networks Elucidates
Traits Associated with Common Human Diseases},
journal = {PLoS Comput. Biol.},
volume = {5},
number = {12},
year = {2009},
url = {https://doi.org/10.1371/journal.pcbi.1000616},
doi = {10.1371/JOURNAL.PCBI.1000616},
timestamp = {Wed, 11 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ploscb/WangNZTSZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/PrakashT09,
author = {Amol Prakash and
Martin Tompa},
title = {Assessing the Discordance of Multiple Sequence Alignments},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {6},
number = {4},
pages = {542--551},
year = {2009},
url = {https://doi.org/10.1109/TCBB.2007.70271},
doi = {10.1109/TCBB.2007.70271},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/PrakashT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/WangRT07,
author = {Adrienne X. Wang and
Walter L. Ruzzo and
Martin Tompa},
title = {How accurately is ncRNA aligned within whole-genome multiple alignments?},
journal = {{BMC} Bioinform.},
volume = {8},
year = {2007},
url = {https://doi.org/10.1186/1471-2105-8-417},
doi = {10.1186/1471-2105-8-417},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/WangRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ploscb/YaoBWNBTR07,
author = {Zizhen Yao and
Jeffrey E. Barrick and
Zasha Weinberg and
Shane J. Neph and
Ronald R. Breaker and
Martin Tompa and
Walter L. Ruzzo},
title = {A Computational Pipeline for High- Throughput Discovery of \emph{cis}-Regulatory
Noncoding {RNA} in Prokaryotes},
journal = {PLoS Comput. Biol.},
volume = {3},
number = {7},
year = {2007},
url = {https://doi.org/10.1371/journal.pcbi.0030126},
doi = {10.1371/JOURNAL.PCBI.0030126},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ploscb/YaoBWNBTR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/LiT06,
author = {Nan Li and
Martin Tompa},
title = {Analysis of computational approaches for motif discovery},
journal = {Algorithms Mol. Biol.},
volume = {1},
year = {2006},
url = {https://doi.org/10.1186/1748-7188-1-8},
doi = {10.1186/1748-7188-1-8},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/LiT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/NephT06,
author = {Shane J. Neph and
Martin Tompa},
title = {MicroFootPrinter: a tool for phylogenetic footprinting in prokaryotic
genomes},
journal = {Nucleic Acids Res.},
volume = {34},
number = {Web-Server-Issue},
pages = {366--368},
year = {2006},
url = {https://doi.org/10.1093/nar/gkl069},
doi = {10.1093/NAR/GKL069},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nar/NephT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/PrakashT05,
author = {Amol Prakash and
Martin Tompa},
title = {Statistics of local multiple alignments},
booktitle = {Proceedings Thirteenth International Conference on Intelligent Systems
for Molecular Biology 2005, Detroit, MI, USA, 25-29 June 2005},
pages = {344--350},
year = {2005},
url = {https://doi.org/10.1093/bioinformatics/bti1042},
doi = {10.1093/BIOINFORMATICS/BTI1042},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ismb/PrakashT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/SinhaBT04,
author = {Saurabh Sinha and
Mathieu Blanchette and
Martin Tompa},
title = {PhyME: {A} probabilistic algorithm for finding motifs in sets of orthologous
sequences},
journal = {{BMC} Bioinform.},
volume = {5},
pages = {170},
year = {2004},
url = {https://doi.org/10.1186/1471-2105-5-170},
doi = {10.1186/1471-2105-5-170},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/SinhaBT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/psb/PrakashBST04,
author = {Amol Prakash and
Mathieu Blanchette and
Saurabh Sinha and
Martin Tompa},
editor = {Russ B. Altman and
A. Keith Dunker and
Lawrence Hunter and
Tiffany A. Jung and
Teri E. Klein},
title = {Motif Discovery in Heterogeneous Sequence Data},
booktitle = {Biocomputing 2004, Proceedings of the Pacific Symposium, Hawaii, USA,
6-10 January 2004},
pages = {348--359},
publisher = {World Scientific},
year = {2004},
url = {http://psb.stanford.edu/psb-online/proceedings/psb04/prakash.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/psb/PrakashBST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/SinhaT03,
author = {Saurabh Sinha and
Martin Tompa},
title = {{YMF:} a program for discovery of novel transcription factor binding
sites by statistical overrepresentation},
journal = {Nucleic Acids Res.},
volume = {31},
number = {13},
pages = {3586--3588},
year = {2003},
url = {https://doi.org/10.1093/nar/gkg618},
doi = {10.1093/NAR/GKG618},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nar/SinhaT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nar/BlanchetteT03,
author = {Mathieu Blanchette and
Martin Tompa},
title = {FootPrinter: a program designed for phylogenetic footprinting},
journal = {Nucleic Acids Res.},
volume = {31},
number = {13},
pages = {3840--3842},
year = {2003},
url = {https://doi.org/10.1093/nar/gkg606},
doi = {10.1093/NAR/GKG606},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nar/BlanchetteT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibe/BlanchetteKT03,
author = {Mathieu Blanchette and
Samson Kwong and
Martin Tompa},
title = {An Empirical Comparison of Tools for Phylogenetic Footprinting},
booktitle = {3rd {IEEE} International Symposium on BioInformatics and BioEngineering
{(BIBE} 2003), 10-12 March 2003, Bethesda, MD, {USA}},
pages = {69--78},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/BIBE.2003.1188931},
doi = {10.1109/BIBE.2003.1188931},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibe/BlanchetteKT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibe/SinhaT03,
author = {Saurabh Sinha and
Martin Tompa},
title = {Performance Comparison of Algorithms for FindingTranscription Factor
Binding Sites},
booktitle = {3rd {IEEE} International Symposium on BioInformatics and BioEngineering
{(BIBE} 2003), 10-12 March 2003, Bethesda, MD, {USA}},
pages = {214},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/BIBE.2003.1188949},
doi = {10.1109/BIBE.2003.1188949},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibe/SinhaT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ColbournLT02,
author = {Charles J. Colbourn and
Alan C. H. Ling and
Martin Tompa},
title = {Construction of optimal quality control for oligo arrays},
journal = {Bioinform.},
volume = {18},
number = {4},
pages = {529--535},
year = {2002},
url = {https://doi.org/10.1093/bioinformatics/18.4.529},
doi = {10.1093/BIOINFORMATICS/18.4.529},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/ColbournLT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/SenguptaT02,
author = {Rimli Sengupta and
Martin Tompa},
title = {Quality Control in Manufacturing Oligo Arrays: {A} Combinatorial Design
Approach},
journal = {J. Comput. Biol.},
volume = {9},
number = {1},
pages = {1--22},
year = {2002},
url = {https://doi.org/10.1089/10665270252833163},
doi = {10.1089/10665270252833163},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/SenguptaT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BlanchetteST02,
author = {Mathieu Blanchette and
Benno Schwikowski and
Martin Tompa},
title = {Algorithms for Phylogenetic Footprinting},
journal = {J. Comput. Biol.},
volume = {9},
number = {2},
pages = {211--223},
year = {2002},
url = {https://doi.org/10.1089/10665270252935421},
doi = {10.1089/10665270252935421},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BlanchetteST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BuhlerT02,
author = {Jeremy Buhler and
Martin Tompa},
title = {Finding Motifs Using Random Projections},
journal = {J. Comput. Biol.},
volume = {9},
number = {2},
pages = {225--242},
year = {2002},
url = {https://doi.org/10.1089/10665270252935430},
doi = {10.1089/10665270252935430},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BuhlerT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonCLT01,
author = {Noga Alon and
Charles J. Colbourn and
Alan C. H. Ling and
Martin Tompa},
title = {Equireplicate Balanced Binary Codes for Oligo Arrays},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {4},
pages = {481--497},
year = {2001},
url = {https://doi.org/10.1137/S0895480101383895},
doi = {10.1137/S0895480101383895},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonCLT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/psb/SenguptaT01,
author = {Rimli Sengupta and
Martin Tompa},
editor = {Russ B. Altman and
A. Keith Dunker and
Lawrence Hunter and
Teri E. Klein},
title = {Quality Control in Manufacturing Oligo Arrays: {A} Combinatorial Design
Approach},
booktitle = {Proceedings of the 6th Pacific Symposium on Biocomputing, {PSB} 2001,
Hawaii, USA, January 3-7, 2001},
pages = {348--359},
year = {2001},
url = {http://psb.stanford.edu/psb-online/proceedings/psb01/sengupta.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/psb/SenguptaT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BuhlerT01,
author = {Jeremy Buhler and
Martin Tompa},
editor = {Thomas Lengauer},
title = {Finding motifs using random projections},
booktitle = {Proceedings of the Fifth Annual International Conference on Computational
Biology, {RECOMB} 2001, Montr{\'{e}}al, Qu{\'{e}}bec, Canada,
April 22-25, 2001},
pages = {69--76},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/369133.369172},
doi = {10.1145/369133.369172},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/recomb/BuhlerT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/BlanchetteST00,
author = {Mathieu Blanchette and
Benno Schwikowski and
Martin Tompa},
editor = {Philip E. Bourne and
Michael Gribskov and
Russ B. Altman and
Nancy Jensen and
Debra A. Hope and
Thomas Lengauer and
Julie C. Mitchell and
Eric D. Scheeff and
Chris Smith and
Shawn Strande and
Helge Weissig},
title = {An Exact Algorithm to Identify Motifs in Orthologous Sequences from
Multiple Species},
booktitle = {Proceedings of the Eighth International Conference on Intelligent
Systems for Molecular Biology, August 19-23, 2000, La Jolla / San
Diego, CA, {USA}},
pages = {37--45},
publisher = {{AAAI}},
year = {2000},
url = {http://www.aaai.org/Library/ISMB/2000/ismb00-004.php},
timestamp = {Thu, 13 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ismb/BlanchetteST00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/SinhaT00,
author = {Saurabh Sinha and
Martin Tompa},
editor = {Philip E. Bourne and
Michael Gribskov and
Russ B. Altman and
Nancy Jensen and
Debra A. Hope and
Thomas Lengauer and
Julie C. Mitchell and
Eric D. Scheeff and
Chris Smith and
Shawn Strande and
Helge Weissig},
title = {A Statistical Method for Finding Transcription Factor Binding Sites},
booktitle = {Proceedings of the Eighth International Conference on Intelligent
Systems for Molecular Biology, August 19-23, 2000, La Jolla / San
Diego, CA, {USA}},
pages = {344--354},
publisher = {{AAAI}},
year = {2000},
url = {http://www.aaai.org/Library/ISMB/2000/ismb00-035.php},
timestamp = {Thu, 13 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ismb/SinhaT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameBRRT99,
author = {Paul Beame and
Allan Borodin and
Prabhakar Raghavan and
Walter L. Ruzzo and
Martin Tompa},
title = {A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {3},
pages = {1051--1072},
year = {1999},
url = {https://doi.org/10.1137/S0097539793282947},
doi = {10.1137/S0097539793282947},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeameBRRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/RuzzoT99,
author = {Walter L. Ruzzo and
Martin Tompa},
editor = {Thomas Lengauer and
Reinhard Schneider and
Peer Bork and
Douglas L. Brutlag and
Janice I. Glasgow and
Hans{-}Werner Mewes and
Ralf Zimmer},
title = {A Linear Time Algorithm for Finding All Maximal Scoring Subsequences},
booktitle = {Proceedings of the Seventh International Conference on Intelligent
Systems for Molecular Biology, August 6-10, 1999, Heidelberg, Germany},
pages = {234--241},
publisher = {{AAAI}},
year = {1999},
url = {http://www.aaai.org/Library/ISMB/1999/ismb99-027.php},
timestamp = {Mon, 24 Jun 2013 09:48:15 +0200},
biburl = {https://dblp.org/rec/conf/ismb/RuzzoT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismb/Tompa99,
author = {Martin Tompa},
editor = {Thomas Lengauer and
Reinhard Schneider and
Peer Bork and
Douglas L. Brutlag and
Janice I. Glasgow and
Hans{-}Werner Mewes and
Ralf Zimmer},
title = {An Exact Method for Finding Short Motifs in Sequences, with Application
to the Ribosome Binding Site Problem},
booktitle = {Proceedings of the Seventh International Conference on Intelligent
Systems for Molecular Biology, August 6-10, 1999, Heidelberg, Germany},
pages = {262--271},
publisher = {{AAAI}},
year = {1999},
url = {http://www.aaai.org/Library/ISMB/1999/ismb99-030.php},
timestamp = {Thu, 13 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ismb/Tompa99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/RockeT98,
author = {Emily Rocke and
Martin Tompa},
editor = {Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {An algorithm for finding novel gapped motifs in {DNA} sequences},
booktitle = {Proceedings of the Second Annual International Conference on Research
in Computational Molecular Biology, {RECOMB} 1998, New York, NY, USA,
March 22-25, 1998},
pages = {228--233},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/279069.279119},
doi = {10.1145/279069.279119},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/RockeT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeameBRRT96,
author = {Paul Beame and
Allan Borodin and
Prabhakar Raghavan and
Walter L. Ruzzo and
Martin Tompa},
title = {Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata},
journal = {Inf. Comput.},
volume = {130},
number = {2},
pages = {101--129},
year = {1996},
url = {https://doi.org/10.1006/inco.1996.0085},
doi = {10.1006/INCO.1996.0085},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeameBRRT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/ChinnLT96,
author = {Donald D. Chinn and
Frank Thomson Leighton and
Martin Tompa},
title = {Minimal Adaptive Routing on the Mesh with Bounded Queue Size},
journal = {J. Parallel Distributed Comput.},
volume = {34},
number = {2},
pages = {154--170},
year = {1996},
url = {https://doi.org/10.1006/jpdc.1996.0052},
doi = {10.1006/JPDC.1996.0052},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/ChinnLT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BussT95,
author = {Jonathan F. Buss and
Martin Tompa},
title = {Lower Bounds on Universal Traversal Sequences Based on Chains of Length
Five},
journal = {Inf. Comput.},
volume = {120},
number = {2},
pages = {326--329},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1117},
doi = {10.1006/INCO.1995.1117},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BussT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TiwariT94,
author = {Prasoon Tiwari and
Martin Tompa},
title = {A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit
Depth},
journal = {Inf. Process. Lett.},
volume = {49},
number = {5},
pages = {243--248},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)90061-2},
doi = {10.1016/0020-0190(94)90061-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TiwariT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BeameTY94,
author = {Paul Beame and
Martin Tompa and
Peiyuan Yan},
title = {Communication-Space Tradeoffs for Unrestricted Protocols},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {3},
pages = {652--661},
year = {1994},
url = {https://doi.org/10.1137/S0097539791196883},
doi = {10.1137/S0097539791196883},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BeameTY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ChinnLT94,
author = {Donald D. Chinn and
Frank Thomson Leighton and
Martin Tompa},
editor = {Lawrence Snyder and
Charles E. Leiserson},
title = {Minimal Adaptive Routing on the Mesh with Bounded Queue Size},
booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29,
1994},
pages = {354--363},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/181014.181451},
doi = {10.1145/181014.181451},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/ChinnLT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BorodinRT92,
author = {Allan Borodin and
Walter L. Ruzzo and
Martin Tompa},
title = {Lower Bounds on the Length of Universal Traversal Sequences},
journal = {J. Comput. Syst. Sci.},
volume = {45},
number = {2},
pages = {180--203},
year = {1992},
url = {https://doi.org/10.1016/0022-0000(92)90046-L},
doi = {10.1016/0022-0000(92)90046-L},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BorodinRT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LamTT92,
author = {Tak Wah Lam and
Prasoon Tiwari and
Martin Tompa},
title = {Trade-Offs between Communication and Space},
journal = {J. Comput. Syst. Sci.},
volume = {45},
number = {3},
pages = {296--315},
year = {1992},
url = {https://doi.org/10.1016/0022-0000(92)90028-H},
doi = {10.1016/0022-0000(92)90028-H},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LamTT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Tompa92,
author = {Martin Tompa},
title = {Lower Bounds on Universal Traversal Sequences for Cycles and Other
Low Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1153--1160},
year = {1992},
url = {https://doi.org/10.1137/0221067},
doi = {10.1137/0221067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Tompa92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChandraT90,
author = {Ashok K. Chandra and
Martin Tompa},
title = {The complexity of short two-person games},
journal = {Discret. Appl. Math.},
volume = {29},
number = {1},
pages = {21--33},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90080-V},
doi = {10.1016/0166-218X(90)90080-V},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChandraT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Tompa90,
author = {Martin Tompa},
title = {Figures of merit: the sequel},
journal = {{SIGACT} News},
volume = {21},
number = {4},
pages = {78--81},
year = {1990},
url = {https://doi.org/10.1145/101371.101376},
doi = {10.1145/101371.101376},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Tompa90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameTY90,
author = {Paul Beame and
Martin Tompa and
Peiyuan Yan},
title = {Communication-Space Tradeoffs for Unrestricted Protocols},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {420--428},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89562},
doi = {10.1109/FSCS.1990.89562},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameTY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeameBRRT90,
author = {Paul Beame and
Allan Borodin and
Prabhakar Raghavan and
Walter L. Ruzzo and
Martin Tompa},
title = {Time-Space Tradeoffs for Undirected Graph Traversal},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {429--438},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89563},
doi = {10.1109/FSCS.1990.89563},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeameBRRT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CoppersmithTR89,
author = {Don Coppersmith and
Prabhakar Raghavan and
Martin Tompa},
title = {Parallel Graph Algorithms That Are Efficient on Average},
journal = {Inf. Comput.},
volume = {81},
number = {3},
pages = {318--333},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90035-7},
doi = {10.1016/0890-5401(89)90035-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/CoppersmithTR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VenkateswaranT89,
author = {H. Venkateswaran and
Martin Tompa},
title = {A New Pebble Game That Characterizes Parallel Complexity Classes},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {533--549},
year = {1989},
url = {https://doi.org/10.1137/0218036},
doi = {10.1137/0218036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VenkateswaranT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinCDRT89,
author = {Allan Borodin and
Stephen A. Cook and
Patrick W. Dymond and
Walter L. Ruzzo and
Martin Tompa},
title = {Two Applications of Inductive Counting for Complementation Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {559--578},
year = {1989},
url = {https://doi.org/10.1137/0218038},
doi = {10.1137/0218038},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinCDRT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorodinCDRT89a,
author = {Allan Borodin and
Stephen A. Cook and
Patrick W. Dymond and
Walter L. Ruzzo and
Martin Tompa},
title = {Erratum: Two Applications of Inductive Counting for Complementation
Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1283},
year = {1989},
url = {https://doi.org/10.1137/0218084},
doi = {10.1137/0218084},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BorodinCDRT89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Tompa89,
author = {Martin Tompa},
title = {Figures of merit},
journal = {{SIGACT} News},
volume = {20},
number = {1},
pages = {62--71},
year = {1989},
url = {https://doi.org/10.1145/65780.65782},
doi = {10.1145/65780.65782},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Tompa89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LamTT89,
author = {Tak Wah Lam and
Prasoon Tiwari and
Martin Tompa},
editor = {David S. Johnson},
title = {Tradeoffs Between Communication and Space},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {217--226},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73028},
doi = {10.1145/73007.73028},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LamTT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorodinRT89,
author = {Allan Borodin and
Walter L. Ruzzo and
Martin Tompa},
editor = {David S. Johnson},
title = {Lower Bounds on the Length of Universal Traversal Sequences (Detailed
Abstract)},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {562--573},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73061},
doi = {10.1145/73007.73061},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BorodinRT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FichT88,
author = {Faith E. Fich and
Martin Tompa},
title = {The parallel complexity of exponentiating polynomials over finite
fields},
journal = {J. {ACM}},
volume = {35},
number = {3},
pages = {651--667},
year = {1988},
url = {https://doi.org/10.1145/44483.44496},
doi = {10.1145/44483.44496},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FichT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/TompaW88,
author = {Martin Tompa and
Heather Woll},
title = {How to Share a Secret with Cheaters},
journal = {J. Cryptol.},
volume = {1},
number = {2},
pages = {133--138},
year = {1988},
url = {https://doi.org/10.1007/BF02252871},
doi = {10.1007/BF02252871},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/TompaW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BorodinCDRT88,
author = {Allan Borodin and
Stephen A. Cook and
Patrick W. Dymond and
Walter L. Ruzzo and
Martin Tompa},
title = {Two applications of complementation via inductive counting},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
Georgetown University, Washington, D. C., USA, June 14-17, 1988},
pages = {116--125},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SCT.1988.5271},
doi = {10.1109/SCT.1988.5271},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BorodinCDRT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/Tompa88,
author = {Martin Tompa},
editor = {Moshe Y. Vardi},
title = {Zero Knowledge Interactive Proofs of Knowledge {(A} Digest)},
booktitle = {Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning
about Knowledge, Pacific Grove, CA, USA, March 1988},
pages = {1--12},
publisher = {Morgan Kaufmann},
year = {1988},
timestamp = {Thu, 21 Jun 2018 07:50:39 +0200},
biburl = {https://dblp.org/rec/conf/tark/Tompa88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CoppersmithRT87,
author = {Don Coppersmith and
Prabhakar Raghavan and
Martin Tompa},
title = {Parallel Graph Algorithms that Are Efficient on Average},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {260--269},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.46},
doi = {10.1109/SFCS.1987.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CoppersmithRT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TompaW87,
author = {Martin Tompa and
Heather Woll},
title = {Random Self-Reducibility and Zero Knowledge Interactive Proofs of
Possession of Information},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {472--482},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.49},
doi = {10.1109/SFCS.1987.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TompaW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/TompaW86,
author = {Martin Tompa and
Heather Woll},
editor = {Andrew M. Odlyzko},
title = {How to Share a Secret with Cheaters},
booktitle = {Advances in Cryptology - {CRYPTO} '86, Santa Barbara, California,
USA, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {263},
pages = {261--265},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-47721-7\_20},
doi = {10.1007/3-540-47721-7\_20},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/TompaW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/VenkateswaranT86,
author = {H. Venkateswaran and
Martin Tompa},
title = {A New Pebble Game that Characterizes Parallel Complexity Classes},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {348--360},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.2},
doi = {10.1109/SFCS.1986.2},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/VenkateswaranT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ManberT85,
author = {Udi Manber and
Martin Tompa},
title = {The Complexity of Problems on Probabilistic Nondeterministic, and
Alternating Decision Trees},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {720--732},
year = {1985},
url = {https://doi.org/10.1145/3828.3838},
doi = {10.1145/3828.3838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ManberT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DymondT85,
author = {Patrick W. Dymond and
Martin Tompa},
title = {Speedups of Deterministic Machines by Synchronous Parallel Machines},
journal = {J. Comput. Syst. Sci.},
volume = {30},
number = {2},
pages = {149--161},
year = {1985},
url = {https://doi.org/10.1016/0022-0000(85)90011-X},
doi = {10.1016/0022-0000(85)90011-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DymondT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/BorodinFHT85,
author = {Allan Borodin and
Ronald Fagin and
John E. Hopcroft and
Martin Tompa},
title = {Decreasing the Nesting Depth of Expressions Involving Square Roots},
journal = {J. Symb. Comput.},
volume = {1},
number = {2},
pages = {169--188},
year = {1985},
url = {https://doi.org/10.1016/S0747-7171(85)80013-4},
doi = {10.1016/S0747-7171(85)80013-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/BorodinFHT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FichT85,
author = {Faith E. Fich and
Martin Tompa},
editor = {Robert Sedgewick},
title = {The Parallel Complexity of Exponentiating Polynomials over Finite
Fields},
booktitle = {Proceedings of the 17th Annual {ACM} Symposium on Theory of Computing,
May 6-8, 1985, Providence, Rhode Island, {USA}},
pages = {38--47},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/22145.22150},
doi = {10.1145/22145.22150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FichT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RuzzoST84,
author = {Walter L. Ruzzo and
Janos Simon and
Martin Tompa},
title = {Space-Bounded Hierarchies and Probabilistic Computations},
journal = {J. Comput. Syst. Sci.},
volume = {28},
number = {2},
pages = {216--230},
year = {1984},
url = {https://doi.org/10.1016/0022-0000(84)90066-7},
doi = {10.1016/0022-0000(84)90066-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/RuzzoST84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ManberT84,
author = {Udi Manber and
Martin Tompa},
title = {The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring
Problem},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {109--115},
year = {1984},
url = {https://doi.org/10.1137/0213008},
doi = {10.1137/0213008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ManberT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DymondT83,
author = {Patrick W. Dymond and
Martin Tompa},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Speedups of Deterministic Machines by Synchronous Parallel Machines},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {336--343},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808763},
doi = {10.1145/800061.808763},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DymondT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Tompa82,
author = {Martin Tompa},
title = {Two Familiar Transitive Closure Algorithms Which Admit No Polynomial
Time, Sublinear Space Implementations},
journal = {{SIAM} J. Comput.},
volume = {11},
number = {1},
pages = {130--137},
year = {1982},
url = {https://doi.org/10.1137/0211010},
doi = {10.1137/0211010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Tompa82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RuzzoST82,
author = {Walter L. Ruzzo and
Janos Simon and
Martin Tompa},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Space-Bounded Hierarchies and Probabilistic Computations},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {215--223},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802194},
doi = {10.1145/800070.802194},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RuzzoST82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ManberT82,
author = {Udi Manber and
Martin Tompa},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Probabilistic, Nondeterministic, and Alternating Decision Trees},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {234--244},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802197},
doi = {10.1145/800070.802197},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ManberT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Tompa81,
author = {Martin Tompa},
title = {An Extension of Savitch's Theorem to Small Space Bounds},
journal = {Inf. Process. Lett.},
volume = {12},
number = {2},
pages = {106--108},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90013-2},
doi = {10.1016/0020-0190(81)90013-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Tompa81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BorodinFKLT81,
author = {Allan Borodin and
Michael J. Fischer and
David G. Kirkpatrick and
Nancy A. Lynch and
Martin Tompa},
title = {A Time-Space Tradeoff for Sorting on Non-Oblivious Machines},
journal = {J. Comput. Syst. Sci.},
volume = {22},
number = {3},
pages = {351--364},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90037-4},
doi = {10.1016/0022-0000(81)90037-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BorodinFKLT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tompa81,
author = {Martin Tompa},
title = {Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity
Properties of Their Circuits},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {1},
pages = {106},
year = {1981},
timestamp = {Fri, 19 Oct 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Tompa81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tompa81a,
author = {Martin Tompa},
title = {An Optimal Solution to a Wire-Routing Problem},
journal = {J. Comput. Syst. Sci.},
volume = {23},
number = {2},
pages = {127--150},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90010-6},
doi = {10.1016/0022-0000(81)90010-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tompa81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ManberT81,
author = {Udi Manber and
Martin Tompa},
title = {The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring
Problem},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {220--227},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.47},
doi = {10.1109/SFCS.1981.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ManberT81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Tompa80,
author = {Martin Tompa},
title = {Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties
of Their Circuits},
journal = {J. Comput. Syst. Sci.},
volume = {20},
number = {2},
pages = {118--132},
year = {1980},
url = {https://doi.org/10.1016/0022-0000(80)90056-2},
doi = {10.1016/0022-0000(80)90056-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Tompa80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tompa80,
author = {Martin Tompa},
editor = {Raymond E. Miller and
Seymour Ginsburg and
Walter A. Burkhard and
Richard J. Lipton},
title = {An Optimal Solution to a Wire-Routing Problem (Preliminary Version)},
booktitle = {Proceedings of the 12th Annual {ACM} Symposium on Theory of Computing,
April 28-30, 1980, Los Angeles, California, {USA}},
pages = {161--176},
publisher = {{ACM}},
year = {1980},
url = {https://doi.org/10.1145/800141.804664},
doi = {10.1145/800141.804664},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Tompa80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tompa80a,
author = {Martin Tompa},
editor = {Raymond E. Miller and
Seymour Ginsburg and
Walter A. Burkhard and
Richard J. Lipton},
title = {Two Familiar Transitive Closure Algorithms which Admit No Polynomial
Time, Sublinear Space Implementations},
booktitle = {Proceedings of the 12th Annual {ACM} Symposium on Theory of Computing,
April 28-30, 1980, Los Angeles, California, {USA}},
pages = {333--338},
publisher = {{ACM}},
year = {1980},
url = {https://doi.org/10.1145/800141.804682},
doi = {10.1145/800141.804682},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Tompa80a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BorodinFKLT79,
author = {Allan Borodin and
Michael J. Fischer and
David G. Kirkpatrick and
Nancy A. Lynch and
Martin Tompa},
title = {A time-space tradeoff for sorting and related non-oblivious computations},
journal = {{SIGACT} News},
volume = {11},
number = {2},
pages = {24},
year = {1979},
url = {https://doi.org/10.1145/1008620.1008621},
doi = {10.1145/1008620.1008621},
timestamp = {Tue, 03 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/BorodinFKLT79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorodinFKLT79,
author = {Allan Borodin and
Michael J. Fischer and
David G. Kirkpatrick and
Nancy A. Lynch and
Martin Tompa},
title = {A Time-Space Tradeoff for Sorting on Non-Oblivious Machines},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {319--327},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.4},
doi = {10.1109/SFCS.1979.4},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorodinFKLT79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tompa78,
author = {Martin Tompa},
editor = {Richard J. Lipton and
Walter A. Burkhard and
Walter J. Savitch and
Emily P. Friedman and
Alfred V. Aho},
title = {Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties
of their Circuits},
booktitle = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
May 1-3, 1978, San Diego, California, {USA}},
pages = {196--204},
publisher = {{ACM}},
year = {1978},
url = {https://doi.org/10.1145/800133.804348},
doi = {10.1145/800133.804348},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Tompa78.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:39 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:
