Daniel Goc

Orcid: 0000-0002-8265-4918

Affiliations:
  • Queen's University, Kingston, ON, Canada


According to our database1, Daniel Goc authored at least 19 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Channel Simulation with Causal Rejection Samplers.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2018
TeleHuman2: A Cylindrical Light Field Teleconferencing System for Life-size 3D Human Telepresence.
Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems, 2018

2017
State complexity of permutation on finite languages over a binary alphabet.
Theor. Comput. Sci., 2017

2016
Demo hour.
Interactions, 2016

HoloFlex: A Flexible Light-Field Smartphone with a Microlens Array and a P-OLED Touchscreen.
Proceedings of the 29th Annual Symposium on User Interface Software and Technology, 2016

HoloFlex: A Flexible Holographic Smartphone with Bend Input.
Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems, 2016

2015
BitDrones: Towards Levitating Programmable Matter Using Interactive 3D Quadcopter Displays.
Proceedings of the 28th Annual ACM Symposium on User Interface Software & Technology, 2015

The State Complexity of Permutations on Finite Languages over Binary Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

A New Approach to the Paperfolding Sequences.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).
Int. J. Found. Comput. Sci., 2014

Nondeterministic State Complexity of Proportional Removals.
Int. J. Found. Comput. Sci., 2014

Computation Width and Deviation Number.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
Automatic Theorem-Proving in Combinatorics on Words.
Int. J. Found. Comput. Sci., 2013

Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.
Proceedings of the Language and Automata Theory and Applications, 2013

On the Number of Unbordered Factors.
Proceedings of the Language and Automata Theory and Applications, 2013

Subword Complexity and k-Synchronization.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Least periods of k-automatic sequences
CoRR, 2012

Primitive Words and Lyndon Words in Automatic Sequences
CoRR, 2012

The Subword Complexity of k-Automatic Sequences is k-Synchronized
CoRR, 2012


  Loading...