Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/sigact/sigact11.bht:"
@article{DBLP:journals/sigact/BentleyS79, author = {Jon Louis Bentley and James B. Saxe}, title = {Algorithms on vector sets}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {36--39}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008624}, doi = {10.1145/1008620.1008624}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/BentleyS79.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} }
@article{DBLP:journals/sigact/Cherniavsky79, author = {John C. Cherniavsky}, title = {Review of "The theory of computer science: a programming approach" by J. M. Brady. Chapman and Hall}, journal = {{SIGACT} News}, volume = {11}, number = {1}, pages = {17}, year = {1979}, url = {https://doi.org/10.1145/1008613.1008617}, doi = {10.1145/1008613.1008617}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Cherniavsky79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Cherniavsky79a, author = {John C. Cherniavsky}, title = {Review of "Automated theorem proving: a logical basis" by D. W. Loveland. North-Holland Publishing Co. 1977}, journal = {{SIGACT} News}, volume = {11}, number = {1}, pages = {18}, year = {1979}, url = {https://doi.org/10.1145/1008613.1008618}, doi = {10.1145/1008613.1008618}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Cherniavsky79a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/Cherniavsky79b, author = {John C. Cherniavsky}, title = {Review of "TORIX: a programming system for operations on vectors and matrices over arbitrary fields and of variable size, vol 1" by S. G. Van Der Meulen and M. Veldhorst. Mathematisch Centrum 1978}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {6}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008627}, doi = {10.1145/1008620.1008627}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/Cherniavsky79b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/DeMilloL79, author = {Richard A. DeMillo and Richard J. Lipton}, title = {Review of "Proofs and refutations: the logic of mathematical discovery" by Imre Lakatos. Cambridge University Press 1976}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {7--9}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008628}, doi = {10.1145/1008620.1008628}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/DeMilloL79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/DerusH79, author = {Kenneth H. Derus and John C. Hansen}, title = {Logics of truth and disposition}, journal = {{SIGACT} News}, volume = {11}, number = {1}, pages = {36--43}, year = {1979}, url = {https://doi.org/10.1145/1008613.1008614}, doi = {10.1145/1008613.1008614}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/DerusH79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/DerusH79a, author = {Kenneth H. Derus and John C. Hansen}, title = {Propositions with multiple dispositions and multiple truth values}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {30--35}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008623}, doi = {10.1145/1008620.1008623}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/DerusH79a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/EhrigKP79, author = {Hartmut Ehrig and Hans{-}J{\"{o}}rg Kreowski and Peter Padawitz}, title = {Algebraic implementation of abstract data types: an announcement}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {25--29}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008622}, doi = {10.1145/1008620.1008622}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/EhrigKP79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/X79, title = {Recent technical reports}, journal = {{SIGACT} News}, volume = {11}, number = {1}, pages = {44--80}, year = {1979}, url = {https://doi.org/10.1145/1008613.1008615}, doi = {10.1145/1008613.1008615}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/X79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/X79a, title = {Recent technical reports}, journal = {{SIGACT} News}, volume = {11}, number = {2}, pages = {40--57}, year = {1979}, url = {https://doi.org/10.1145/1008620.1008625}, doi = {10.1145/1008620.1008625}, timestamp = {Tue, 03 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sigact/X79a.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.