default search action

combined dblp search
author search
venue search
publication search

ask others

Laurentiu Panaitopol

> Home > Persons

Person information

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?

2015
[j3]
- view
  - electronic edition @ uwaterloo.ca (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/jintseq/ApostolPPT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jintseq/ApostolPPT15
Bradut Apostol, Laurentiu Panaitopol, Lucian Petrescu, László Tóth:
Some Properties of a Sequence Defined with the Aid of Prime Numbers. J. Integer Seq. 18(5): 15.5.5 (2015)

2000 – 2009

see FAQ

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

2005
[j2]
- view
  - electronic edition @ jstor.org
  - no references & citations available
- export record
  dblp key:
  - journals/tamm/Panaitopol05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Panaitopol05
Laurentiu Panaitopol:
On the Representation of Natural Numbers as Sums of Squares. Am. Math. Mon. 112(2): 168-171 (2005)

1990 – 1999

see FAQ

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

1995
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jucs/PanaitopolS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jucs/PanaitopolS95
Laurentiu Panaitopol, Doru Steffánescu:
Bounds for Heights of Integer Polynomial Factors. J. Univers. Comput. Sci. 1(8): 603-613 (1995)

Coauthor Index

see FAQ

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.