blank Quick help
blank Maintenance news

Scheduled maintenance

Regular maintenance outages:
between 05.00 and 05.15 hrs CET (Monday to Sunday).

Other outages
Availability

2022.02.11

More...
blank News flashes

News Flashes

New version of the European Patent Register – SPC proceedings information in the Unitary Patent Register.

2024-07-24

More...
blank Related links

Release notes
European Patent Register Assistant
European Patent Register Resource Book
European Patent Register – pocket guide
FAQ - European Patent Register
FAQ - Register Alert
Federated Register (Flyer)
Global Dossier (Flyer)
Register events
Deep link coverage
Federated Register content
The Patent Information Tour
Fair use charter

Extract from the Register of European Patents

EP About this file: EP2677450

EP2677450 - A system and method for compressed level-ordered edge sequence encoding [Right-click to bookmark this link]
StatusNo opposition filed within time limit
Status updated on  05.03.2021
Database last updated on 14.09.2024
FormerThe patent has been granted
Status updated on  27.03.2020
FormerGrant of patent is intended
Status updated on  20.11.2019
FormerExamination is in progress
Status updated on  17.05.2019
Most recent event   Tooltip08.07.2022Lapse of the patent in a contracting state
New state(s): MK		published on 10.08.2022  [2022/32]
Applicant(s)For all designated states
Palo Alto Research Center Incorporated
3333 Coyote Hill Road
Palo Alto, California 94304 / US
[2013/52]
Inventor(s)01 / Schmidt, Tim
2785 S. Bascom Ave
Campbell, CA California 95008 / US
02 / Zhou, Rong
1034 Whitebick Drive
San Jose, CA California 95129 / US
 [2013/52]
Representative(s)Gill Jennings & Every LLP
The Broadgate Tower
20 Primrose Street
London EC2A 2ES / GB
[2020/18]
Former [2013/52]Lord, Michael
Gill Jennings & Every LLP The Broadgate Tower 20 Primrose Street
London EC2A 2ES / GB
Application number, filing date13170391.004.06.2013
[2013/52]
Priority number, dateUS20121353129022.06.2012         Original published format: US201213531290
[2013/52]
Filing languageEN
Procedural languageEN
PublicationType: A1 Application with search report 
No.:EP2677450
Date:25.12.2013
Language:EN
[2013/52]
Type: B1 Patent specification 
No.:EP2677450
Date:29.04.2020
Language:EN
[2020/18]
Search report(s)(Supplementary) European search report - dispatched on:EP09.10.2013
ClassificationIPC:H03M7/30, H03M7/00
[2019/50]
CPC:
H04L9/0836 (EP,US); G06F16/2246 (EP,US); H03M7/00 (EP);
H03M7/30 (EP); H04L9/00 (EP,US); G06F16/322 (EP,US);
G06F16/9027 (EP,US); G06F16/90344 (EP,US) (-)
Former IPC [2019/47]G06F17/10
Former IPC [2013/52]G06F21/00, G06F17/30
Designated contracting statesAL,   AT,   BE,   BG,   CH,   CY,   CZ,   DE,   DK,   EE,   ES,   FI,   FR,   GB,   GR,   HR,   HU,   IE,   IS,   IT,   LI,   LT,   LU,   LV,   MC,   MK,   MT,   NL,   NO,   PL,   PT,   RO,   RS,   SE,   SI,   SK,   SM,   TR [2020/18]
Former [2013/52]AL,  AT,  BE,  BG,  CH,  CY,  CZ,  DE,  DK,  EE,  ES,  FI,  FR,  GB,  GR,  HR,  HU,  IE,  IS,  IT,  LI,  LT,  LU,  LV,  MC,  MK,  MT,  NL,  NO,  PL,  PT,  RO,  RS,  SE,  SI,  SK,  SM,  TR 
TitleGerman:System und Verfahren für CLOES-Kodierung[2013/52]
English:A system and method for compressed level-ordered edge sequence encoding[2013/52]
French:Système et procédé de codage de séquence de bord ordonné à niveau comprimé[2013/52]
Examination procedure23.06.2014Amendment by applicant (claims and/or description)
25.06.2014Examination requested  [2014/32]
21.05.2019Despatch of a communication from the examining division (Time limit: M04)
23.09.2019Reply to a communication from the examining division
21.11.2019Communication of intention to grant the patent
16.03.2020Fee for grant paid
16.03.2020Fee for publishing/printing paid
16.03.2020Receipt of the translation of the claim(s)
Divisional application(s)The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is  21.05.2019
Opposition(s)01.02.2021No opposition filed within time limit [2021/14]
Fees paidRenewal fee
30.06.2015Renewal fee patent year 03
30.06.2016Renewal fee patent year 04
30.06.2017Renewal fee patent year 05
02.07.2018Renewal fee patent year 06
01.07.2019Renewal fee patent year 07
Opt-out from the exclusive  Tooltip
competence of the Unified
Patent Court		 See the Register of the Unified Patent Court for opt-out data
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court.
Lapses during opposition  TooltipHU04.06.2013
AL29.04.2020
AT29.04.2020
CY29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
MK29.04.2020
MT29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SI29.04.2020
SK29.04.2020
SM29.04.2020
TR29.04.2020
IE04.06.2020
LU04.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
[2022/32]
Former [2022/27]HU04.06.2013
AL29.04.2020
AT29.04.2020
CY29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
MT29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SI29.04.2020
SK29.04.2020
SM29.04.2020
TR29.04.2020
IE04.06.2020
LU04.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2022/26]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SI29.04.2020
SK29.04.2020
SM29.04.2020
TR29.04.2020
IE04.06.2020
LU04.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/24]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SI29.04.2020
SK29.04.2020
SM29.04.2020
IE04.06.2020
LU04.06.2020
BE30.06.2020
CH30.06.2020
LI30.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/20]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SK29.04.2020
SM29.04.2020
IE04.06.2020
LU04.06.2020
CH30.06.2020
LI30.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/15]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SK29.04.2020
SM29.04.2020
LU04.06.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/10]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
PL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SK29.04.2020
SM29.04.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/09]AL29.04.2020
AT29.04.2020
CZ29.04.2020
DK29.04.2020
EE29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
IT29.04.2020
LT29.04.2020
LV29.04.2020
MC29.04.2020
NL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SM29.04.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/08]AL29.04.2020
DK29.04.2020
ES29.04.2020
FI29.04.2020
HR29.04.2020
LT29.04.2020
LV29.04.2020
NL29.04.2020
RO29.04.2020
RS29.04.2020
SE29.04.2020
SM29.04.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/04]AL29.04.2020
FI29.04.2020
HR29.04.2020
LT29.04.2020
LV29.04.2020
NL29.04.2020
RS29.04.2020
SE29.04.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2021/01]FI29.04.2020
HR29.04.2020
LT29.04.2020
LV29.04.2020
RS29.04.2020
SE29.04.2020
BG29.07.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2020/51]FI29.04.2020
HR29.04.2020
LT29.04.2020
LV29.04.2020
RS29.04.2020
SE29.04.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2020/50]FI29.04.2020
HR29.04.2020
LT29.04.2020
LV29.04.2020
SE29.04.2020
NO29.07.2020
GR30.07.2020
IS29.08.2020
PT31.08.2020
Former [2020/48]FI29.04.2020
LT29.04.2020
SE29.04.2020
NO29.07.2020
IS29.08.2020
PT31.08.2020
Former [2020/47]LT29.04.2020
NO29.07.2020
IS29.08.2020
Former [2020/46]IS29.08.2020
Documents cited:Search[I]  - anonymous, "Trie", Wikipedia, (20120607), URL: http://en.wikipedia.org/w/index.php?title=Trie&oldid=496446330, (20130927), XP002713829 [I] 1-14 * the whole document *
 [I]  - RAVINDRA GURAVANNAVAR ET AL, "Reducing Order Enforcement Cost in Complex Query Plans", DATA ENGINEERING, 2007. ICDE 2007. IEEE 23RD INTERNATIONAL CONFERENCE ON, IEEE, PI, (20070401), ISBN 978-1-4244-0802-3, pages 856 - 865, XP031095829 [I] 1-14 * the whole document *
by applicant   - CULBERSON J.; SCHAEFFER, J., PATTERN DATABASES, COMPUTATIONAL INTELLIGENCE, (1998), vol. 14, no. 3, pages 318 - 334
    - "Directed model checking with distance-preserving abstractions", DRAGER, K.; FINKBEINER, B.; PODELSKI, A., Model checking software: 13th International SPIN Workshop, Vienna, Austria, SPRINGER-VERLAG NEW YORK INC., (20060330), page 19
    - HELMERT, M.; HASLUM, P.; HOFFMANN, J., "Flexible abstraction heuristics for optimal sequential planning", PROC. ICAPS, (2007), vol. 2007, pages 176 - 183
    - HELMERT, M., "The fast downward planning system", JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, (2006), vol. 26, pages 191 - 246
    - EDELKAMP, S., "Symbolic pattern databases in heuristic search planning", PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON AI PLANNING AND SCHEDULING, (2002), pages 274 - 283
    - JENSEN, R.; BRYANT, R.; VELOSO, M., "SetA*: An efficient bdd-based heuristic search algorithm", PROCEEDINGS OF THE 18TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02, (2002), pages 668 - 673
    - HASLUM, P. ET AL., "Domain-independent construction of pattern database heuristics for cost-optimal planning", PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, (2007), pages 1007 - 1012
    - HELMERT M.; HASLUM, P.; HOFFMANN, J., "Flexible abstraction heuristics for optimal sequential planning", PROC. ICAPS 2007, (2007), pages 176 - 183
The EPO accepts no responsibility for the accuracy of data originating from other authorities; in particular, it does not guarantee that it is complete, up to date or fit for specific purposes.