|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 19 keywords
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
80 | Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik |
On Coherence, Random-self-reducibility, and Self-correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 59-67, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity |
55 | Aris Zakinthinos, E. Stewart Lee |
How and why feedback composition fails [secure systems]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: Ninth IEEE Computer Security Foundations Workshop, March 10 - 12, 1996, Dromquinna Manor, Kenmare, County Kerry, Ireland, pp. 95-101, 1996, IEEE Computer Society, 0-8186-7522-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
feedback composition, generalized noninterference, secure components, n-forward correctability, system designer, security of data, composability, necessary and sufficient conditions, restrictiveness |
49 | Joan Feigenbaum, Martin Strauss 0001 |
An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 523-534, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Vinayak M. Kumar, Geoffrey Mon |
Relaxed Local Correctability from Local Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
31 | Vinayak M. Kumar, Geoffrey Mon |
Relaxed Local Correctability from Local Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.17035, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
31 | Mattia Cerrato, Alesia Vallenas Coronel, Marius Köppel |
The Case for Correctability in Fair Machine Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWAF ![In: Proceedings of the 2nd European Workshop on Algorithmic Fairness, Winterthur, Switzerland, June 7th to 9th, 2023., 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
31 | Panagiota Birmpa, Jinchao Feng, Markos A. Katsoulakis, Luc Rey-Bellet |
Model Uncertainty and Correctability for Directed Graphical Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM/ASA J. Uncertain. Quantification ![In: SIAM/ASA J. Uncertain. Quantification 10(4), pp. 1461-1512, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
31 | Taro Shibayama, Yingkai Ouyang |
The equivalence between correctability of deletions and insertions of separable states in quantum codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.07214, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Panagiota Birmpa, Jinchao Feng, Markos A. Katsoulakis, Luc Rey-Bellet |
Model Uncertainty and Correctability for Directed Graphical Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.08179, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
31 | Taro Shibayama, Yingkai Ouyang |
The equivalence between correctability of deletions and insertions of separable states in quantum codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITW ![In: IEEE Information Theory Workshop, ITW 2021, Kanazawa, Japan, October 17-21, 2021, pp. 1-6, 2021, IEEE, 978-1-6654-0312-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Fuchun Liu, Rixiang Mo |
Correctability of fault-tolerant stochastic discrete-event systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Syst. Control. Lett. ![In: Syst. Control. Lett. 105, pp. 48-54, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
31 | Shinya Fukumoto, Tadashi Wadayama |
Iterative erasure correcting algorithm for q-ary reed-muller codes based on local correctability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTC ![In: 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016, Brest, France, September 5-9, 2016, pp. 36-40, 2016, IEEE, 978-1-5090-3401-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
31 | Brett Hemenway, Rafail Ostrovsky, Mary Wootters |
Local correctability of expander codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 243, pp. 178-190, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
31 | Brett Hemenway, Rafail Ostrovsky, Mary Wootters |
Local Correctability of Expander Codes ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.8129, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
31 | Brett Hemenway, Rafail Ostrovsky, Mary Wootters |
Local Correctability of Expander Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, pp. 540-551, 2013, Springer, 978-3-642-39205-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
31 | H. K. Hsiao, Hsiu-Hsia Lin, S. S. Yu |
The decodability and correctability of codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 87(7), pp. 1456-1468, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
31 | Widad Machmouchi |
Local-Testability and Self-Correctability of q-ary Sparse Linear Codes ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.3506, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
31 | Widad Machmouchi |
Local-testability and self-correctability of q-ary sparse linear codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings, pp. 1203-1207, 2010, IEEE. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
31 | Mauricio Amaral de Almeida, Hakim Lounis, Walcélio L. Melo |
An Investigation on the Use of Machine Learned Models for Estimating Software Correctability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Eng. Knowl. Eng. ![In: Int. J. Softw. Eng. Knowl. Eng. 9(5), pp. 565-593, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
31 | Jonathan K. Millen |
Unwinding Forward Correctability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Secur. ![In: J. Comput. Secur. 3(1), pp. 35-54, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
31 | Jonathan K. Millen |
Unwinding Forward Correctability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: Seventh IEEE Computer Security Foundations Workshop - CSFW'94, Franconia, New Hampshire, USA, June 14-16, 1994, Proceedings, pp. 2-10, 1994, IEEE Computer Society, 0-8186-6230-1. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Kikuo Fujimura, Pankaj Jalote |
On Robustness of B-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 5(3), pp. 530-534, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
index corruption, pointer corruption, structural error, data structure, robustness, correctability, B-trees, tree data structures, semantic information |
25 | Tali Kaufman, Madhu Sudan 0001 |
Sparse Random Linear Codes are Locally Decodable and Testable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 590-600, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Heiko Mantel |
On the Composition of Secure Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
S&P ![In: 2002 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 12-15, 2002, pp. 88-101, 2002, IEEE Computer Society, 0-7695-1543-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
composition, information flow, compositionality, noninterference, emergent properties |
25 | Dines Bjørner |
Domain Engineering: A Software Engineering Discipline in Need of Research. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25 - December 2, 2000, Proceedings, pp. 1-17, 2000, Springer, 3-540-41348-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|