Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Daniel Gonçalves 0004

> Home > Persons

Person information

affiliation: Federal University of Santa Catarina, Department of Mathematics, Florianópolis, Brazil

Other persons with the same name

see FAQ

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2017
[j2]
- view
  - electronic edition @ oldcitypublishing.com
  - no references & citations available
- export record
  dblp key:
  - journals/jca/SobottkaG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jca/SobottkaG17
Marcelo Sobottka, Daniel Gonçalves:
A Note on the Definition of Sliding Block Codes and the Curtis-Hedlund-Lyndon Theorem. J. Cell. Autom. 12(3-4): 209-215 (2017)
2016
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/ijac/GoncalvesY16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijac/GoncalvesY16
Daniel Gonçalves, Gabriela Yoneda:
Free path groupoid grading on Leavitt path algebras. Int. J. Algebra Comput. 26(6): 1217-1235 (2016)
2015
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/SobottkaG15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/SobottkaG15
Marcelo Sobottka, Daniel Gonçalves:
A brief note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem. CoRR abs/1507.02180 (2015)

Coauthor Index

see FAQ

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.