Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Yuliya Zabiyaka
@inproceedings{DBLP:conf/sat/ZabiyakaD06, author = {Yuliya Zabiyaka and Adnan Darwiche}, editor = {Armin Biere and Carla P. Gomes}, title = {Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies}, booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4121}, pages = {116--129}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11814948\_14}, doi = {10.1007/11814948\_14}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/sat/ZabiyakaD06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pvm/PachecoMKLZ03, author = {Peter S. Pacheco and Patrick Miller and Jin Kim and Taylor Leese and Yuliya Zabiyaka}, editor = {Jack J. Dongarra and Domenico Laforenza and Salvatore Orlando}, title = {Object-Oriented NeuroSys: Parallel Programs for Simulating Large Networks of Biologically Accurate Neurons}, booktitle = {Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European {PVM/MPI} Users' Group Meeting, Venice, Italy, September 29 - October 2, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2840}, pages = {142--151}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39924-7\_23}, doi = {10.1007/978-3-540-39924-7\_23}, timestamp = {Tue, 14 May 2019 10:00:52 +0200}, biburl = {https://dblp.org/rec/conf/pvm/PachecoMKLZ03.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.