default search action
BibTeX records: Louis van Ekert
@inproceedings{DBLP:conf/aacc/SimmondsSE04, author = {Andrew James Simmonds and Peter Sandilands and Louis van Ekert}, editor = {Suresh Manandhar and Jim Austin and Uday B. Desai and Yoshio Oyanagi and Asoke K. Talukder}, title = {An Ontology for Network Security Attacks}, booktitle = {Applied Computing, Second Asian Applied Computing Conference, {AACC} 2004, Kathmandu, Nepal, October 29-31, 2004. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3285}, pages = {317--323}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30176-9\_41}, doi = {10.1007/978-3-540-30176-9\_41}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/aacc/SimmondsSE04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/KaunitzE84, author = {John Kaunitz and Louis van Ekert}, title = {Audit Trail Compaction for Database Recovery}, journal = {Commun. {ACM}}, volume = {27}, number = {7}, pages = {678--683}, year = {1984}, url = {https://doi.org/10.1145/358105.358194}, doi = {10.1145/358105.358194}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/KaunitzE84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/acj/KaunitzE81, author = {John Kaunitz and Louis van Ekert}, title = {Data Base Backup - The Problem of Very Large Data Bases}, journal = {Aust. Comput. J.}, volume = {13}, number = {4}, pages = {136--142}, year = {1981}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/acj/KaunitzE81.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.