Computer Science

Positron: Composing Commitment Protocols

Proceedings of the 1st International Workshop on Engineering Multiagent Systems (EMAS). Presented at the International Workshop on Engineering Multiagent Systems, St. Paul, MN.

Towards an Argumentation-Based Model of Social Interaction

Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems (ArgMAS). Presented at the International Workshop on Argumentation in Multi-Agent Systems, St. Paul, MN.

Trustworthy Decision Making via Commitments

Proceedings of the 15th AAMAS Workshop on Trust in Agent Societies (Trust), 24–35.

Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU

ACM SIGPLAN Notices, 48(8), 57.

Agents and Data Mining Interaction

Geometric Separators and the Parabolic Lift

CCCG: The Canadian Conference in Computational Geometry. Presented at the Canadian Conference in Computational Geometry, Waterloo, Ontario.

Knowledge-Assisted Ontology-Based Requirements Evolution

In W. Maalej & A. K. Thurimella (Eds.), Managing Requirements Knowledge (MaRK) (pp. 143–167). https://research-information.bris.ac.uk/en/publications/9d328913-4eb3-4403-bf6f-bbf20ed08017

Argumentation, Evidence, and Schemes: Abstract

Proceedings of the 10th International Workshop on Argumentation in Multi-Agent Systems, 37. https://research-information.bris.ac.uk/en/publications/3b00f0ba-3768-4e45-94f5-93d1a4661f2b

Fine-Grained Treatment to Synchronizations in GPU-to-CPU Translation

In Languages and Compilers for Parallel Computing (pp. 171–184).

Optimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors

In Job Scheduling Strategies for Parallel Processing (pp. 114–133).

HPar

ACM Transactions on Architecture and Code Optimization, 10(4), 1–25.

Simple Profile Rectifications Go a Long Way

In ECOOP 2013 – Object-Oriented Programming (pp. 654–678).

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

In Advances in Cryptology - ASIACRYPT 2013 (pp. 100–119).

Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions

In Advances in Cryptology – EUROCRYPT 2013 (pp. 702–718).

Revisiting Lower and Upper Bounds for Selective Decommitments

In Theory of Cryptography (pp. 559–578).

Linear Logic Programming for Narrative Generation

In Logic Programming and Nonmonotonic Reasoning (pp. 427–432).

Discovering how end-user programmers and their communities use public repositories: A study on Yahoo! Pipes

Information and Software Technology, 55(7), 1289–1303.

In-execution dynamic malware analysis and detection by mining information in process control blocks of Linux OS

Information Sciences, 231, 45–63.

Validating Library Usage Interactively

In Computer Aided Verification (pp. 796–812).

Software effort models should be assessed via leave-one-out validation

Journal of Systems and Software, 86(7), 1879–1890.