Nina Narodytska

According to our database1, Nina Narodytska authored at least 66 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Simple and precise static analysis of untrusted Linux kernel extensions.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Synthesizing Cluster Management Code for Distributed Systems.
Proceedings of the Workshop on Hot Topics in Operating Systems, 2019

2018
Constrained Image Generation Using Binarized Neural Networks with Decision Procedures.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Learning Optimal Decision Trees with SAT.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Core-Guided Minimal Correction Set and Core Enumeration.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formal Analysis of Deep Binarized Neural Networks.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Network Approximation using Tensor Sketching.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formal Verification of Deep Neural Networks.
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

A SAT-Based Approach to Learn Explainable Decision Sets.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

Verifying Properties of Binarized Deep Neural Networks.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Simple Black-Box Adversarial Attacks on Deep Neural Networks.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2017

2016
New Approaches to Constraint Acquisition.
Proceedings of the Data Mining and Constraint Programming, 2016

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Adaptive Condorcet-Based Stopping Rules Can Be Efficient.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

A SAT-Based Counterexample Guided Method for Unbounded Synthesis.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Maximum Satisfiability Using Cores and Correction Sets.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Equilibria Under the Probabilistic Serial Rule.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Controlling Elections by Replacing Candidates or Votes.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Manipulating the Probabilistic Serial Rule.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

SAT-Based Strategy Extraction in Reachability Games.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules.
Artif. Intell., 2014

Cores in Core Based MaxSat Algorithms: An Analysis.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Reasoning about Constraint Models.
Proceedings of the PRICAI 2014: Trends in Artificial Intelligence, 2014

The Computational Impact of Partial Votes on Strategic Voting.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

How Hard Is It to Control an Election by Breaking Ties?
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Solving Games without Controllable Predecessor.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

A Game-Theoretic Analysis of Catalog Optimization.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Maximum Satisfiability Using Core-Guided MaxSAT Resolution.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Controlling Elections by Replacing Candidates: Theoretical and Experimental Results.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Three Generalizations of the FOCUS Constraint.
Proceedings of the IJCAI 2013, 2013

A Social Welfare Optimal Sequential Allocation Procedure.
Proceedings of the IJCAI 2013, 2013

On the Complexity of Global Scheduling Constraints under Structural Restrictions.
Proceedings of the IJCAI 2013, 2013

Constraint Acquisition via Partial Queries.
Proceedings of the IJCAI 2013, 2013

An Adaptive Model Restarts Heuristic.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Breaking Symmetry with Different Orderings.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Manipulating two stage voting rules.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Possible and necessary winner problem in social polls.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Coalitional manipulation for Schulze's rule.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Combining Voting Rules Together.
Proceedings of the ECAI 2012, 2012

The SeqBin Constraint Revisited.
Proceedings of the Principles and Practice of Constraint Programming, 2012

The RegularGcc Matrix Constraint.
Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

On the Violation of Circuits in Decomposable Negation Normal Form.
Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

Eliminating the Weakest Link: Making Manipulation Intractable?
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Reformulation of global constraints.
PhD thesis, 2011

The Complexity of Integer Bound Propagation.
J. Artif. Intell. Res., 2011

The weighted Grammar constraint.
Annals OR, 2011

Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable.
Proceedings of the IJCAI 2011, 2011

The AllDifferent Constraint with Precedences.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Manipulation of Nanson's and Baldwin's Rules.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Complexity of and Algorithms for Borda Manipulation.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Decomposition of the NValue Constraint.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Propagating Conjunctions of AllDifferent Constraints.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Circuit Complexity and Decompositions of Global Constraints.
Proceedings of the IJCAI 2009, 2009

Decompositions of All Different, Global Cardinality and Related Constraints.
Proceedings of the IJCAI 2009, 2009

Reformulating Global Grammar Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

Restricted Global Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
Combining Symmetry Breaking and Global Constraints.
Proceedings of the Recent Advances in Constraints, 2008

The Weighted CfgConstraint.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Flow-Based Propagators for the SEQUENCE and Related Global Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2008

2007
Configuration.
IEEE Intelligent Systems, 2007

Constraint and Variable Ordering Heuristics for Compiling Configuration Problems.
Proceedings of the IJCAI 2007, 2007

Encodings of the Sequence Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2007


  Loading...