default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc158.bht:"
@article{DBLP:journals/iandc/BartalCL00, author = {Yair Bartal and Marek Chrobak and Lawrence L. Larmore}, title = {A Randomized Algorithm for Two Servers on the Line}, journal = {Inf. Comput.}, volume = {158}, number = {1}, pages = {53--69}, year = {2000}, url = {https://doi.org/10.1006/inco.1999.2809}, doi = {10.1006/INCO.1999.2809}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BartalCL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/GoldsmithOR00, author = {Judy Goldsmith and Mitsunori Ogihara and J{\"{o}}rg Rothe}, title = {Tally {NP} Sets and Easy Census Functions}, journal = {Inf. Comput.}, volume = {158}, number = {1}, pages = {29--52}, year = {2000}, url = {https://doi.org/10.1006/inco.1999.2810}, doi = {10.1006/INCO.1999.2810}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/GoldsmithOR00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Hagerup00, author = {Torben Hagerup}, title = {Parallel Preprocessing for Path Queries without Concurrent Reading}, journal = {Inf. Comput.}, volume = {158}, number = {1}, pages = {18--28}, year = {2000}, url = {https://doi.org/10.1006/inco.1999.2814}, doi = {10.1006/INCO.1999.2814}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Hagerup00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Jancar00, author = {Petr Jancar}, title = {Decidability of Bisimilarity for One-Counter Processes}, journal = {Inf. Comput.}, volume = {158}, number = {1}, pages = {1--17}, year = {2000}, url = {https://doi.org/10.1006/inco.1999.2813}, doi = {10.1006/INCO.1999.2813}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/Jancar00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/KoppenhagenM00, author = {Ulla Koppenhagen and Ernst W. Mayr}, title = {Optimal Algorithms for the Coverability, the Subword, the Containment, and the Equivalence Problems for Commutative Semigroups}, journal = {Inf. Comput.}, volume = {158}, number = {2}, pages = {98--124}, year = {2000}, url = {https://doi.org/10.1006/inco.1999.2812}, doi = {10.1006/INCO.1999.2812}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/KoppenhagenM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Maaren00, author = {Hans van Maaren}, title = {A Short Note on Some Tractable Cases of the Satisfiability Problem}, journal = {Inf. Comput.}, volume = {158}, number = {2}, pages = {125--130}, year = {2000}, url = {https://doi.org/10.1006/inco.2000.2867}, doi = {10.1006/INCO.2000.2867}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Maaren00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ModianoE00, author = {Eytan H. Modiano and Anthony Ephremides}, title = {Communication Protocols for Secure Distributed Computation of Binary Functions}, journal = {Inf. Comput.}, volume = {158}, number = {2}, pages = {71--97}, year = {2000}, url = {https://doi.org/10.1006/inco.2000.2865}, doi = {10.1006/INCO.2000.2865}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ModianoE00.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.