Main

related bits

0

processing priority

3

site type

0 (generic, awaiting analysis)

review version

11

html import

27 (unknown)

Events

first seen date

2024-11-30 22:34:20

expired found date

-

created at

2024-11-30 22:34:20

updated at

2024-11-30 22:34:20

Domain name statistics

length

23

crc

61891

tld

86

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

87719371 (github.io)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

2024-12-14 22:34:20

Server

server bits

server ip

-

Mainpage statistics

mp import status

27

mp rejected date

-

mp saved date

-

mp size orig

42372

mp size raw text

5399

mp inner links count

0

mp inner links status

1 (no links)

Open Graph

title

description

image

site name

author

updated

2026-02-23 15:15:33

raw text

disclaimer Our original disclaimer (Apr. 2017) 1. A claim This page concerns the following paper: Optimal In-place Suffix Sorting , By Zhize Li, Jian Li and Hongwei Huo. The paper was accepted by ICALP 2017, under the condition of merging with another ICALP submission by Keisuke Goto (arXiv version arXiv:1703.01009v2 ). In the arXiv version, Goto made the following claim, which implies that his work is independent of ours. In our paper, we have three major results. Goto’s paper only has one result, which is very similar to one of our major results (plus an easy corollary). Hence, the ICALP PC decided that we should merge the paper. Actually, his result is much weaker than ours. We can allow the size of the alphabet to be , while he can only deal with the size is less than , where is the length of the string .  More importantly, he requires the alphabet to be continuous , i.e., all characters in the alphabet should be appeared in the string . E.g., if...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Książka (126)

index version

1

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

4166

text words

937

text unique words

326

text lines

65

text sentences

58

text paragraphs

17

text words per sentence

16

text matched phrases

0

text matched dictionaries

0

RSS

rss path

rss status

0 (new)

rss found date

-

rss size orig

0

rss items

0

rss spam phrases

0

rss detected language

0 (awaiting analysis)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

0 (new)

sitemap review version

2

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-