Jakob Grue Simonsen

Orcid: 0000-0002-3488-9392

Affiliations:
  • University of Copenhagen, Denmark


According to our database1, Jakob Grue Simonsen authored at least 111 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Implicit Representation of Relations.
Theory Comput. Syst., December, 2023

A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff.
J. Econ. Theory, October, 2023

Subclasses of Ptime Interpreted by Programming Languages.
Theory Comput. Syst., June, 2023

Read/write factorizable programs.
J. Funct. Program., 2023

On representations of real numbers and the computational complexity of converting between such representations.
CoRR, 2023

Comparing Trace Similarity Metrics Across Logs and Evaluation Measures.
Proceedings of the Advanced Information Systems Engineering, 2023

Privacy Lost in Online Education: Analysis of Web Tracking Evolution.
Proceedings of the Advanced Data Mining and Applications - 19th International Conference, 2023

Faithfulness Tests for Natural Language Explanations.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers), 2023

2022
Complex-valued Neural Network-based Quantum Language Models.
ACM Trans. Inf. Syst., 2022

Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria.
ACM Trans. Economics and Comput., 2022

Fact Checking with Insufficient Evidence.
Trans. Assoc. Comput. Linguistics, 2022

Diagnostics-Guided Explanation Generation.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Can Workplace Tracking Ever Empower? Collective Sensemaking for the Responsible Use of Sensor Data at Work.
Proc. ACM Hum. Comput. Interact., 2021

Unsupervised Multi-Index Semantic Hashing.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering.
Proceedings of the WWW '21: The Web Conference 2021, 2021

On Position Embeddings in BERT.
Proceedings of the 9th International Conference on Learning Representations, 2021

The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Multi-head Self-attention with Role-Guided Masks.
Proceedings of the Advances in Information Retrieval, 2021

Principled Multi-Aspect Evaluation Measures of Rankings.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations.
Proceedings of the Connecting with Computability, 2021

2020
Denmark's Participation in the Search Engine TREC COVID-19 Challenge: Lessons Learned about Searching for Precise Biomedical Scientific Information on COVID-19.
CoRR, 2020

Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution.
CoRR, 2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME.
Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

An Embellished Account of Agafonov's Proof of Agafonov's Theorem.
CoRR, 2020

Unsupervised Semantic Hashing with Pairwise Reconstruction.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

Content-aware Neural Hashing for Cold-start Recommendation.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

Factuality Checking in News Headlines with Eye Tracking.
Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

Encoding word order in complex embeddings.
Proceedings of the 8th International Conference on Learning Representations, 2020

A Diagnostic Study of Explainability Techniques for Text Classification.
Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

Fact Check-Worthiness Detection with Contrastive Ranking.
Proceedings of the Experimental IR Meets Multilinguality, Multimodality, and Interaction, 2020

On the Complexity of Conversion Between Classic Real Number Representations.
Proceedings of the Beyond the Horizon of Computability, 2020

Liouville Numbers and the Computational Complexity of Changing Bases.
Proceedings of the Beyond the Horizon of Computability, 2020

Generating Fact Checking Explanations.
Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

2019
The fixed point property and a technique to harness double fixed point combinators.
J. Log. Comput., 2019

Computing with Infinite Terms and Infinite Reductions.
Fundam. Informaticae, 2019

Modelling Sequential Music Track Skips using a Multi-RNN Approach.
CoRR, 2019

Contextual Compositionality Detection with External Knowledge Bases andWord Embeddings.
CoRR, 2019

Contextual Compositionality Detection with External Knowledge Bases and Word Embeddings.
Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking.
Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

Unsupervised Neural Generative Semantic Hashing.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Contextually Propagated Term Weights for Document Representation.
Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019

Neural Speed Reading with Structural-Jump-LSTM.
Proceedings of the 7th International Conference on Learning Representations, 2019

MultiFC: A Real-World Multi-Domain Dataset for Evidence-Based Fact Checking of Claims.
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, 2019

Neural Weakly Supervised Fact Check-Worthiness Detection with Contrastive Sampling-Based Ranking Loss.
Proceedings of the Working Notes of CLEF 2019, 2019

More Intensional Versions of Rice's Theorem.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Within-Network Classification in Temporal Graphs.
Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

The Copenhagen Team Participation in the Factuality Task of the Competition of Automatic Identification and Verification of Claims in Political Debates of the CLEF-2018 Fact Checking Lab.
Proceedings of the Working Notes of CLEF 2018, 2018

The Copenhagen Team Participation in the Check-Worthiness Task of the Competition of Automatic Identification and Verification of Claims in Political Debates of the CLEF-2018 CheckThat! Lab.
Proceedings of the Working Notes of CLEF 2018, 2018

2017
Complexity Hierarchies and Higher-order Cons-free Term Rewriting.
Log. Methods Comput. Sci., 2017

Higher-order Cons-free Interpreters.
CoRR, 2017

Computability in the Lattice of Equivalence Relations.
Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

The Power of Non-Determinism in Higher-Order Implicit Complexity.
CoRR, 2017

Evaluation Measures for Relevance and Credibility in Ranked Lists.
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017

Computing Continuous-Time Markov Chains as Transformers of Unbounded Observables.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming.
Proceedings of the Programming Languages and Systems, 2017

2016
Power Law Distributions in Information Retrieval.
ACM Trans. Inf. Syst., 2016

Some Remarks on Real Numbers Induced by First-Order Spectra.
Notre Dame J. Formal Log., 2016

Deep Learning Relevance: Creating Relevant Information (as Opposed to Retrieving it).
CoRR, 2016

Complexity Hierarchies and Higher-Order Cons-Free Rewriting.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Brief Announcement: Labeling Schemes for Power-Law Graphs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Exploiting the Bipartite Structure of Entity Grids for Document Coherence and Retrieval.
Proceedings of the 2016 ACM on International Conference on the Theory of Information Retrieval, 2016

Near Optimal Adjacency Labeling Schemes for Power-Law Graphs.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Adaptive Distributional Extensions to DFR Ranking.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Sketching Shape-changing Interfaces: Exploring Vocabulary, Metaphors Use, and Affordances.
Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016

2015
A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy.
ACM Trans. Comput. Log., 2015

An Exploration of the Relation Between Expectations and User Experience.
Int. J. Hum. Comput. Interact., 2015

Near-optimal adjacency labeling scheme for power-law graphs.
CoRR, 2015

Entropy and Graph Based Modelling of Document Coherence using Discourse Entities: An Application.
CoRR, 2015

Non-Compositional Term Dependence for Information Retrieval.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

The Affordances of Broken Affordances.
Proceedings of the Human-Computer Interaction - INTERACT 2015, 2015

Entropy and Graph Based Modelling of Document Coherence using Discourse Entities: An Application to IR.
Proceedings of the 2015 International Conference on The Theory of Information Retrieval, 2015

A Hierarchical Recurrent Encoder-Decoder for Generative Context-Aware Query Suggestion.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

The Impact of Using Combinatorial Optimisation for Static Caching of Posting Lists.
Proceedings of the Information Retrieval Technology, 2015

2014
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Mining until it hurts: automatic extraction of usability issues from online reviews compared to traditional usability evaluation.
Proceedings of the 8th Nordic Conference on Human-Computer Interaction: Fun, 2014

Is once enough?: on the extent and content of replications in human-computer interaction.
Proceedings of the CHI Conference on Human Factors in Computing Systems, 2014

2013
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus.
ACM Trans. Comput. Log., 2013

An experimental investigation of the normality of irrational algebraic numbers.
Math. Comput., 2013

Comparative Study of Search Engine Result Visualisation: Ranked Lists Versus Graphs.
Proceedings of the 3rd European Workshop on Human-Computer Interaction and Information Retrieval, 2013

Extracting usability and user experience information from online user reviews.
Proceedings of the 2013 ACM SIGCHI Conference on Human Factors in Computing Systems, 2013

2012
Computational Models with No Linear Speedup.
Chic. J. Theor. Comput. Sci., 2012

Term Rewriting Systems as Topological Dynamical Systems.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Characterizing Languages by Normalization and Termination in String Rewriting - (Extended Abstract).
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Beta-Shifts, Their Languages, and Computability.
Theory Comput. Syst., 2011

Infinitary Combinatory Reduction Systems.
Inf. Comput., 2011

Levels of undecidability in rewriting.
Inf. Comput., 2011

Programming in Biomolecular Computation: Programs, Self-Interpretation and Visualisation.
Sci. Ann. Comput. Sci., 2011

Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Using Sequence Alignment and Voting to Improve Optical Music Recognition from Multiple Recognizers.
Proceedings of the 12th International Society for Music Information Retrieval Conference, 2011

The Exact Hardness of Deciding Derivational and Runtime Complexity.
Proceedings of the Computer Science Logic, 2011

Computational Biology: A Programming Perspective.
Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

Lost in Translation: Authorship Attribution using Frame Semantics.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference, 19-24 June, 2011, Portland, Oregon, USA, 2011

2010
Programming in Biomolecular Computation.
Proceedings of the 1st International Workshop on Interactions between Computer Science and Biology, 2010

Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Log. Methods Comput. Sci., 2010

Weak Convergence and Uniform Normalization in Infinitary Rewriting.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Higher-Order (Non-)Modularity .
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and <i>lambda</i>-Calculus.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts.
Theor. Comput. Sci., 2009

POETS: Process-oriented event-driven transaction systems.
J. Log. Algebraic Methods Program., 2009

Infinitary Combinatory Reduction Systems: Confluence
Log. Methods Comput. Sci., 2009

LAIR: A Language for Automated Semantics-Aware Text Sanitization Based on Frame Semantics.
Proceedings of the 3rd IEEE International Conference on Semantic Computing (ICSC 2009), 2009

The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity).
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2006
Compositional specification of commercial contracts.
Int. J. Softw. Tools Technol. Transf., 2006

On local non-compactness in recursive mathematics.
Math. Log. Q., 2006

On modularity in infinitary term rewriting.
Inf. Comput., 2006

On the Computability of the Topological Entropy of Subshifts.
Discret. Math. Theor. Comput. Sci., 2006

2005
Specker sequences revisited.
Math. Log. Q., 2005

On Beta-Shifts Having Arithmetical Languages.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

On Confluence of Infinitary Combinatory Reduction Systems.
Proceedings of the Logic for Programming, 2005

2004
On confluence and residuals in Cauchy convergent transfinite rewriting.
Inf. Process. Lett., 2004

On the Modularity of Confluence in Infinitary Term Rewriting.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004


  Loading...