64 citations · 134 across the 24 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.PL2018
Memory Consistency Models using Constraints
Ruth Hoffmann, Özgür Akgün, Susmit Sarkar
Memory consistency models (MCMs) are at the heart of concurrent programming. They represent the behaviour of concurrent programs at the chip level. To test these models small progr…
cs.AI2018★ 1 cited
Modelling Langford's Problem: A Viewpoint for Search
Özgür Akgün, Ian Miguel
The performance of enumerating all solutions to an instance of Langford's Problem is sensitive to the model and the search strategy. In this paper we compare the performance of a l…
math.CO2018★ 2 cited
Solving computational problems in the theory of word-representable graphs
Özgür Akgün, Ian P. Gent, Sergey Kitaev +1
A simple graph is word-representable if there exists a word over the alphabet such that letters and alternate in iff . Word-representable gra…