Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss52.bht:"
@article{DBLP:journals/jcss/AmirBF96, author = {Amihood Amir and Gary Benson and Martin Farach}, title = {Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {299--307}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0023}, doi = {10.1006/JCSS.1996.0023}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/AmirBF96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AndriesP96, author = {Marc Andries and Jan Paredaens}, title = {On Instance-Completeness for Database Query Languages involving Object Creation}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {357--373}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0027}, doi = {10.1006/JCSS.1996.0027}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AndriesP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/AstesianoZ96, author = {Egidio Astesiano and Elena Zucca}, title = {A Free Construction of Dynamic Terms}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {143--156}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0011}, doi = {10.1006/JCSS.1996.0011}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/AstesianoZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Baker96, author = {Brenda S. Baker}, title = {Parameterized Pattern Matching: Algorithms and Applications}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {28--42}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0003}, doi = {10.1006/JCSS.1996.0003}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Baker96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BartlettLW96, author = {Peter L. Bartlett and Philip M. Long and Robert C. Williamson}, title = {Fat-Shattering and the Learnability of Real-Valued Functions}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {434--452}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0033}, doi = {10.1006/JCSS.1996.0033}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BartlettLW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BshoutyCGKT96, author = {Nader H. Bshouty and Richard Cleve and Ricard Gavald{\`{a}} and Sampath Kannan and Christino Tamon}, title = {Oracles and Queries That Are Sufficient for Exact Learning}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {421--433}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0032}, doi = {10.1006/JCSS.1996.0032}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BshoutyCGKT96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BshoutyGHM96, author = {Nader H. Bshouty and Sally A. Goldman and Thomas R. Hancock and Sleiman Matar}, title = {Asking Questions to Minimize Errors}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {268--286}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0021}, doi = {10.1006/JCSS.1996.0021}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/BshoutyGHM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/BusscheGV96, author = {Jan Van den Bussche and Dirk Van Gucht and Gottfried Vossen}, title = {Reflective Programming in the Relational Algebra}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {537--549}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0040}, doi = {10.1006/JCSS.1996.0040}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/BusscheGV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Chen96, author = {Tsong Yueh Chen}, title = {On the Structural Properties of the Set of Fixpoints for Nondeterministic Recursive Definitions}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {80--86}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0007}, doi = {10.1006/JCSS.1996.0007}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Chen96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/CherubiniP96, author = {Alessandra Cherubini and Pierluigi {San Pietro}}, title = {A Polynomial-Time Parsing Algorithm for K-Depth Languages}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {61--79}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0006}, doi = {10.1006/JCSS.1996.0006}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/CherubiniP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/DobkinGM96, author = {David P. Dobkin and Dimitrios Gunopulos and Wolfgang Maass}, title = {Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {453--470}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0034}, doi = {10.1006/JCSS.1996.0034}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/DobkinGM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/EhrenfeuchtER96, author = {Andrzej Ehrenfeucht and Joost Engelfriet and Grzegorz Rozenberg}, title = {Finite Languages for the Representation of Finite Graphs}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {170--184}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0013}, doi = {10.1006/JCSS.1996.0013}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/EhrenfeuchtER96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/EppsteinGIS96, author = {David Eppstein and Zvi Galil and Giuseppe F. Italiano and Thomas H. Spencer}, title = {Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {3--27}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0002}, doi = {10.1006/JCSS.1996.0002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/EppsteinGIS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FangV96, author = {Shao C. Fang and Santosh S. Venkatesh}, title = {Learning Binary Perceptrons Perfectly Efficiently}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {374--389}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0028}, doi = {10.1006/JCSS.1996.0028}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FangV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FortnowY96, author = {Lance Fortnow and Tomoyuki Yamakami}, title = {Generic Separations}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {191--197}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0015}, doi = {10.1006/JCSS.1996.0015}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FortnowY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FrazierGMP96, author = {Michael Frazier and Sally A. Goldman and Nina Mishra and Leonard Pitt}, title = {Learning from a Consistently Ignorant Teacher}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {471--492}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0035}, doi = {10.1006/JCSS.1996.0035}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FrazierGMP96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Gibson96, author = {Gavin J. Gibson}, title = {Exact Classification with Two-Layer Neural Nets}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {349--356}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0026}, doi = {10.1006/JCSS.1996.0026}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Gibson96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GoldmanM96, author = {Sally A. Goldman and H. David Mathias}, title = {Teaching a Smarter Learner}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {255--267}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0020}, doi = {10.1006/JCSS.1996.0020}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GoldmanM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GrumbachM96, author = {St{\'{e}}phane Grumbach and Tova Milo}, title = {Towards Tractable Algebras for Bags}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {570--588}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0042}, doi = {10.1006/JCSS.1996.0042}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GrumbachM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HaasNSS96, author = {Peter J. Haas and Jeffrey F. Naughton and S. Seshadri and Arun N. Swami}, title = {Selectivity and Cost Estimation for Joins Based on Random Sampling}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {550--569}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0041}, doi = {10.1006/JCSS.1996.0041}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HaasNSS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/HirstH96, author = {Tirza Hirst and David Harel}, title = {Completeness Results for Recursive Data Bases}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {522--536}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0039}, doi = {10.1006/JCSS.1996.0039}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/HirstH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Honkala96, author = {Juha Honkala}, title = {On Parikh Slender Languages and Power Series}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {185--190}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0014}, doi = {10.1006/JCSS.1996.0014}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Honkala96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/JainS96, author = {Sanjay Jain and Arun Sharma}, title = {The Intrinsic Complexity of Language Identification}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {393--402}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0030}, doi = {10.1006/JCSS.1996.0030}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/JainS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KanellakisRVV96, author = {Paris C. Kanellakis and Sridhar Ramaswamy and Darren Erik Vengroff and Jeffrey Scott Vitter}, title = {Indexing for Data Models with Constraints and Classes}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {589--612}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0043}, doi = {10.1006/JCSS.1996.0043}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KanellakisRVV96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KrishnamurthyRS96, author = {Ravi Krishnamurthy and Raghu Ramakrishnan and Oded Shmueli}, title = {A Framework for Testing Safety and Effective Computability}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {100--124}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0009}, doi = {10.1006/JCSS.1996.0009}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KrishnamurthyRS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Kshemkalyani96, author = {Ajay D. Kshemkalyani}, title = {Temporal Interactions of Intervals in Distributed Systems}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {287--298}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0022}, doi = {10.1006/JCSS.1996.0022}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Kshemkalyani96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KummerS96, author = {Martin Kummer and Frank Stephan}, title = {On the Structure of Degrees of Inferability}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {214--238}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0018}, doi = {10.1006/JCSS.1996.0018}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KummerS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KummerS96a, author = {Martin Kummer and Frank Stephan}, title = {Inclusion Problems in Parallel Learning and Games}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {403--420}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0031}, doi = {10.1006/JCSS.1996.0031}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/KummerS96a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LibkinW96, author = {Leonid Libkin and Limsoon Wong}, title = {Semantic Representations and Query Labguages for Or-Sets}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {125--142}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0010}, doi = {10.1006/JCSS.1996.0010}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/LibkinW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Morishita96, author = {Shinichi Morishita}, title = {An Extension of Van Gelder's Alternating Fixpoint to Magic Programs}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {506--521}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0038}, doi = {10.1006/JCSS.1996.0038}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/Morishita96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/NisanZ96, author = {Noam Nisan and David Zuckerman}, title = {Randomness is Linear in Space}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {43--52}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0004}, doi = {10.1006/JCSS.1996.0004}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/NisanZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Pippenger96, author = {Nicholas Pippenger}, title = {Self-Routing Superconcentrators}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {53--60}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0005}, doi = {10.1006/JCSS.1996.0005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Pippenger96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Poutre96, author = {Johannes A. La Poutr{\'{e}}}, title = {Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {87--99}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0008}, doi = {10.1006/JCSS.1996.0008}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Poutre96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/SchapireS96, author = {Robert E. Schapire and Linda Sellie}, title = {Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {201--213}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0017}, doi = {10.1006/JCSS.1996.0017}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/SchapireS96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/SchulerY96, author = {Rainer Schuler and Tomoyuki Yamakami}, title = {Structural Average Case Complexity}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {308--348}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0024}, doi = {10.1006/JCSS.1996.0024}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/SchulerY96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Simon96, author = {Hans Ulrich Simon}, title = {General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {239--254}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0019}, doi = {10.1006/JCSS.1996.0019}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/Simon96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Vaishnavi96, author = {Vijay K. Vaishnavi}, title = {On k-Dimensional Balanced Binary Trees}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {2}, pages = {328--348}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0025}, doi = {10.1006/JCSS.1996.0025}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Vaishnavi96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Willard96, author = {Dan E. Willard}, title = {Applications of Range Query Theory to Relational Data Base Join and Selection Operations}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {1}, pages = {157--169}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0012}, doi = {10.1006/JCSS.1996.0012}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Willard96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/Wong96, author = {Limsoon Wong}, title = {Normal Forms and Conservative Extension Properties for Query Languages over Collection Types}, journal = {J. Comput. Syst. Sci.}, volume = {52}, number = {3}, pages = {495--505}, year = {1996}, url = {https://doi.org/10.1006/jcss.1996.0037}, doi = {10.1006/JCSS.1996.0037}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/Wong96.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.