-- MySQL Administrator dump 1.4
--
-- ------------------------------------------------------
-- Server version	5.0.41-community-nt


/*!40101 SET @OLD_CHARACTER_SET_CLIENT=@@CHARACTER_SET_CLIENT */;
/*!40101 SET @OLD_CHARACTER_SET_RESULTS=@@CHARACTER_SET_RESULTS */;
/*!40101 SET @OLD_COLLATION_CONNECTION=@@COLLATION_CONNECTION */;
/*!40101 SET NAMES utf8 */;

/*!40014 SET @OLD_UNIQUE_CHECKS=@@UNIQUE_CHECKS, UNIQUE_CHECKS=0 */;
/*!40014 SET @OLD_FOREIGN_KEY_CHECKS=@@FOREIGN_KEY_CHECKS, FOREIGN_KEY_CHECKS=0 */;
/*!40101 SET @OLD_SQL_MODE=@@SQL_MODE, SQL_MODE='NO_AUTO_VALUE_ON_ZERO' */;


--
-- Create schema research
--

CREATE DATABASE IF NOT EXISTS research;
USE research;

--
-- Definition of table `academic`
--

DROP TABLE IF EXISTS `academic`;
CREATE TABLE `academic` (
  `AcNum` int(11) default NULL,
  `DeptNum` int(11) default NULL,
  `FamName` varchar(255) default NULL,
  `GiveName` varchar(255) default NULL,
  `Initials` varchar(255) default NULL,
  `Title` varchar(255) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `academic`
--

/*!40000 ALTER TABLE `academic` DISABLE KEYS */;
INSERT INTO `academic` (`AcNum`,`DeptNum`,`FamName`,`GiveName`,`Initials`,`Title`) VALUES 
 (392,138,'Benjamin','Steve','S R A','AProf'),
 (393,138,'Sun','James','J N','Dr'),
 (394,136,'Ditlefsen','Sanjay','S M','Ms'),
 (395,123,'Heine','Kevin','K M','Mr'),
 (396,138,'Sheehan','Ahson','A C','Dr'),
 (397,104,'Debenedetti','Simon','S R J','Prof'),
 (399,139,'Coan','Larry','L A J','Prof'),
 (400,137,'David','Chris','C T','Mr'),
 (401,119,'Olnaes','Joe','J G','Mr'),
 (402,116,'Schmid','Joseph','J P','Dr'),
 (403,138,'Bartzsch','David','D R C','Dr'),
 (404,116,'Pennypacker','William','W M','Dr'),
 (405,123,'Zhu','Daniel','D J A','Dr'),
 (406,123,'Ferkovich','Dongyu','D J R','Mr'),
 (407,123,'Coates','Ian','I M','Ms'),
 (408,123,'Friedrichs','David','D G K','Mr'),
 (409,139,'Eddins','Harald','H M A','Mr'),
 (410,126,'Knight','Ray','R G','Mr'),
 (411,112,'Plainguet','Ryan','R A L','Dr'),
 (413,103,'Kesek','Gerald','G L G C','Dr'),
 (414,127,'Platt','Edward','E D J','Dr'),
 (415,137,'Mahadevan','Thomas','T J S','Dr'),
 (416,109,'Andrews','Ganesh','G P A','AProf'),
 (417,120,'Chan','Alberto','A C N','Dr'),
 (418,120,'Hardie','Ronnie','R C D','Dr'),
 (419,120,'Pasquale','Kris','K A S','Dr'),
 (420,113,'Drake','Steven','S J D','Dr'),
 (421,113,'Kelly','John','J R',NULL),
 (422,109,'Carpenter','Lanetta','L S','Dr'),
 (423,109,'Benna','Fuzzy','F Y K','Dr'),
 (424,109,'Fleming','Craig','C R K','Dr'),
 (425,120,'Larsen','Ray','R J','Dr'),
 (426,120,'Woo','Paolo','P V M',NULL),
 (427,113,'Genyus','Henry','H T L','Dr'),
 (428,113,'Pinto','Larry','L L','Ms'),
 (429,112,'Leroy','Vivian','V P W','Dr'),
 (430,113,'Brock','Tim','T V T','Dr'),
 (431,139,'Drexler','Simon','S Y','Dr'),
 (432,109,'Enoksson','Alan','A Y A','Mr'),
 (433,126,'Grav','Gerald','G G','Dr'),
 (434,103,'Rodriguez','Larry','L G T','AProf'),
 (435,104,'Longcore','Joel','J G M','Dr'),
 (436,103,'Scott','Bob','B I','Dr'),
 (437,103,'Wood','Nathan','N R L','Mrs'),
 (438,103,'Reagan','David','D P','Dr'),
 (439,136,'Finin','Peter','P','Mr'),
 (440,103,'Alloy','Neil','N F.',NULL),
 (441,139,'Gefaell','Swami','S R G.','Dr'),
 (442,137,'Allan','Kevin','K G','Dr'),
 (443,102,'Mertalo','Sean','S B C','Dr'),
 (444,141,'Havey','Sarah','S D A','Dr.'),
 (446,108,'Padilla','Bill','B C.A.','AProf'),
 (447,122,'Denley','Rich','R R','Dr'),
 (448,128,'Boniface','Michael','M A','Dr'),
 (449,126,'Moon','Roberto','R R','Dr'),
 (450,128,'Koniaris','Eric','E D.B.','Dr'),
 (451,126,'Preece','Gilles','G M.V.','Dr'),
 (452,112,'Osborn','Saptho','S B','Dr'),
 (453,147,'Nappi','Richard','R C','Dr'),
 (454,126,'Frost','Tom','T V','Dr'),
 (455,125,'Thornton','Mustafa','M LS',NULL),
 (456,126,'Roebuck','George','G J.A.','Dr.'),
 (457,119,'Tong','Daryl','D C.A.','Dr.'),
 (458,105,'White','Purple','P JN','Prof.'),
 (459,146,'Woodward','Willem','W P S','Dr'),
 (460,114,'Grenald','Batel','B W J','Dr'),
 (461,100,'Lesiak','Charles','C P','Dr.'),
 (462,137,'Wellen','Randall','R P','Dr.'),
 (463,103,'Spearing','James','J B','Dr.'),
 (464,147,'Prior','George','G D','Dr.'),
 (465,100,'Dodge','Noah','N MJ','AProf'),
 (466,144,'Stauffer','Roger','R P.A.','Mr'),
 (467,144,'Owens','Brian','B T A','Ms'),
 (468,144,'Gortatowsky','Michael','M P K','Mr'),
 (469,103,'Wooldridge','Shaq','S T.','Dr.'),
 (100,100,'Kornreich','Jeroen','J D','AProf'),
 (101,100,'Yee','Mark','M D','Dr'),
 (102,100,'Fernandes','Russell','R T J','Mr'),
 (103,100,'Cohen','Richard','R R A','AProf'),
 (104,100,'Polemitis','Joe','J L','Miss'),
 (105,100,'Brower','Tony','T B','AProf'),
 (106,100,'Royce','Mel','M P','Prof'),
 (107,100,'Christine','Leonardo','L T P','Mr'),
 (108,100,'Brandon','Chuck','C A','Dr'),
 (109,101,'Gustafsson','Hakan','H O Y','Dr'),
 (111,132,'Barton','Michel','M G K','Prof'),
 (113,101,'Sadhal','Sharanya','S B','Dr'),
 (114,101,'Morley','Chris','C M T','Ms'),
 (115,145,'Garton','Graham','G A S M','Dr'),
 (116,147,'Nair','Marc','M P','Mr'),
 (117,101,'Baliga','Lance','L G C','Dr'),
 (118,145,'Rickert','Hannu','H X','Dr'),
 (119,102,'Lamkin','Bas','B M','Dr'),
 (120,102,'Tang','Greg','G J','Mr'),
 (121,102,'Skelton','Robert','R R S','Mr'),
 (122,142,'Harris','Mark','M J L','Mr'),
 (123,102,'Wyld','Mitchell','M S','Dr'),
 (124,102,'Haenssgen','Francis','F A','Mr'),
 (125,102,'Ahlberg','Grosek','G F','Ms'),
 (126,102,'Bodoh','Anne','A S','Dr'),
 (127,102,'Hathaway','Walley','W J','Dr'),
 (128,102,'Silvermane','Ajay','A A N','Dr'),
 (129,102,'Hopkins','Sheldon','S T','AProf'),
 (130,102,'Correll','Tim','T N K','Dr'),
 (131,102,'Ruschak','Robert','R H K','Mr'),
 (132,103,'Bataille','Michael','M J','Prof'),
 (133,103,'Reichelt','Lee','L M A','Dr'),
 (134,103,'Owen','Kenneth','K M','Dr'),
 (135,103,'Carroll','Ulf','U K','Dr'),
 (137,105,'Chalmers','Bijan','B D','Dr'),
 (138,105,'Mayston','Brian','B A J','AProf'),
 (139,105,'Marziani','Rolf','R K B','Dr'),
 (140,105,'Wheeler','Ben','B K','Dr'),
 (141,105,'Ashley','Maria','M J','Mr'),
 (142,105,'Lawitzke','Ky','K R T','Dr'),
 (143,106,'Stewart','Andrew','A D P','Dr'),
 (144,106,'Kinsella','Declan','D G G','Prof'),
 (145,106,'Prakash','Kate','K H','Dr'),
 (146,107,'Marcy','Ike','I H','Ms'),
 (147,108,'Witt','Brian','B P G','Mr'),
 (148,108,'Delavega','Demetrios','D P','Mr'),
 (149,108,'Cunningham','Tim','T T','Mr'),
 (150,108,'Steinhæbel','Leeroy','L G D','Mr'),
 (151,108,'Nielsen','Morgan','M S','Dr'),
 (152,108,'Steiner','Oleg','O J K','Prof'),
 (153,108,'Wallace','Valdis','V J W','Mr'),
 (154,108,'Lai','Chris','C J','Dr'),
 (155,108,'James','Frank','F X','Mr'),
 (156,108,'Martin','Faried','F G','AProf'),
 (157,108,'Conduit','Sunny','S P','Dr'),
 (158,108,'Meier','Eric','E J','Dr'),
 (159,108,'Bigelow','Hassan','H D','Mrs'),
 (160,108,'Nguyen','Mark','M R','Mr'),
 (161,109,'Pines','Tim','T R','Dr'),
 (162,110,'Betts','Neil','N P','Dr'),
 (163,111,'Peterson','Stefan','S G','Dr'),
 (164,111,'Stanton','Ballintijn','B G W','Dr'),
 (165,111,'Tope','Donn','D C','Dr'),
 (166,111,'Buie','William','W R I','Dr'),
 (167,112,'Bergquist','Benjamin','B M','Dr'),
 (168,113,'Berg','Tony','T D','Mr'),
 (169,113,'Roland','Trever','T C A','Dr'),
 (170,114,'Numnonda','Paul','P N','Mr'),
 (171,114,'Dube','Shaji','S P','AProf'),
 (172,114,'Klein','Lei','L C','Dr'),
 (173,115,'Kok','Sinan','S S','Mr'),
 (174,116,'Decair','Cyrus','C D','Dr'),
 (175,116,'Williams','Thomas','T J','Dr'),
 (176,116,'Anderson','Spenser','S G','Dr'),
 (177,116,'Glicksman','Roar','R I J','Dr'),
 (178,116,'Empranthiri','Bill','B J','Dr'),
 (179,116,'Hill','Dave','D D','Mr'),
 (180,116,'Wong','Andrew','A P A','Dr'),
 (181,116,'Steyn','Michaael','M A','Prof'),
 (182,116,'Robert','Daniel','D M E','Prof'),
 (183,116,'Shannon','Koh','K H','Dr'),
 (184,116,'Scanlon','Randolph','R P J','Dr'),
 (185,116,'Tamaccio','Robert','R G','Prof'),
 (186,116,'Conner','Eric','E E','Mr'),
 (187,116,'Mir','Larry','L G','Mr'),
 (188,116,'Saettler','Sandland','S J','Prof'),
 (189,116,'Korman','Robert','R J','Dr'),
 (190,119,'Morse','Frank','F J','Prof'),
 (191,119,'Bierling','Ken','K R E','Mr'),
 (192,119,'Ganguly','Ingo','I D R','Mr'),
 (193,119,'McAleer','David','D J G',NULL),
 (194,119,'Hahm','Deepak','D J F','Dr'),
 (195,119,'Hall','Dhr','D C F','Dr'),
 (196,119,'Hlynka','Jack','J M W','Dr'),
 (197,120,'Chiou','John','J A H J','Prof'),
 (198,121,'Chen','Cheryl','C JS','Dr'),
 (199,122,'Karr','Svante','S K','Mr'),
 (200,122,'Hedges','Thomas','T J K','Prof'),
 (201,122,'Kellner','Hans','H J','Mrs'),
 (202,122,'Kilg','Adam','A T','AProf'),
 (203,122,'Mitchell','Iain','I B','Dr'),
 (204,122,'Schaeffer','Rob','R C B','Dr'),
 (205,122,'Zakel','Will','W B','Mr'),
 (206,122,'Robinson','Edward','E R','Dr'),
 (207,122,'Zinn','Kevin','K J','Mr'),
 (208,122,'Ray','Eric','E D','Mr'),
 (209,123,'Boy','John','J G','Mr'),
 (212,122,'Henri','Bob','B T R','Dr'),
 (213,102,'Eek','Jorge','J K',NULL),
 (214,124,'Mackiewicz','Nathan','N G','AProf'),
 (215,124,'Berends','Geoffrey','G G I','Mr'),
 (216,124,'Gerritsen','Luigi','L P D','Dr'),
 (217,124,'Winter','Elisabeth','E B H','Mr'),
 (218,124,'Nieberger','Brad','B P D','Mr'),
 (219,124,'Leonida','Dominik','D D L','Dr'),
 (220,124,'Minker','David','D G R','Mr'),
 (221,124,'Baruffi','Heikki','H D H','Mr'),
 (222,122,'Ringer','Heinz','H R','Mr'),
 (223,106,'Osburn','Aldis','A G R','Dr'),
 (224,110,'Page','Jim','J A N','Dr'),
 (225,106,'Beattie','Roger','R S','Dr'),
 (226,123,'Pant','Jack','J M','Dr'),
 (227,103,'Friedman','James','J C N G','AProf'),
 (228,122,'Miller','Gail','G C W','Mr'),
 (229,122,'Glazer','Bernd','B U','Mr'),
 (230,122,'Burgeson','Jason','J B','Prof'),
 (231,122,'Howard','George','G J','AProf'),
 (232,115,'Grohol','Pete','P P','Prof'),
 (233,115,'Goudie','Daniel','D B','Dr'),
 (234,115,'Horne','Susan','S R F','Dr'),
 (235,115,'Weinstock','Maria','M H','Dr'),
 (236,115,'Smith','Mark','M M R','Dr'),
 (237,115,'Link','Andre','A M','Dr'),
 (238,115,'Muthukumar','Corey','C D M','Mr'),
 (239,115,'Christofanelli','Dean','D C','Dr'),
 (240,115,'McHenry','Frederick','F M','Dr'),
 (241,115,'Powers','John','J K','Mr'),
 (242,115,'Herrera','Daniel','D G','Dr'),
 (243,110,'Tait','Clifford','C E V','Prof'),
 (244,110,'Frank','Cesar','C B B','Dr'),
 (245,110,'Aigner','Tony','T R P','Prof'),
 (246,110,'Berggreen','Shivanand','S I','Dr'),
 (247,110,'Tanji','Lucheng','L J B','Dr'),
 (248,120,'Orth','Tino','T P','Mr'),
 (249,112,'McKelvey','Paul','P P J','Mr'),
 (250,118,'Lewine','Robert','R J','Mr'),
 (251,100,'Woodpecker','Omar','O C P','Dr'),
 (252,108,'Spota','Derek','D G','Mr'),
 (253,116,'Sinha','Doug','D J','Prof'),
 (254,122,'Briggs','Alexander','A J','Mr'),
 (255,108,'Trenholme','Jamie','J J M','Mr'),
 (256,122,'Richer','Hans','H S K','Mr'),
 (257,100,'Gladius','Bill','B R','Dr'),
 (258,108,'Murdock','Mucho','M H L','Dr'),
 (259,100,'Bialecki','Stephenson','S L A','Dr'),
 (260,111,'White','Roger','R C S','Prof'),
 (261,111,'Riggins','Ronnie','R E J','Dr'),
 (262,111,'Ooi','Scott','S C','Cmdr'),
 (263,111,'Maclean','Clark','C D','Mr'),
 (264,111,'Harding','Eduardo','E L P','Dr'),
 (265,111,'Mahdavi','Tim','T D L','Mr'),
 (266,111,'Taguchi','Mikki','M R A','Dr'),
 (267,111,'Schwenk','Mohand','M C S J','Mr'),
 (268,111,'Mikusko','Keith','K D','Mr'),
 (269,111,'McCauley','Simon','S J','Ms'),
 (271,111,'Picard','Doug','D F','Dr'),
 (272,111,'Brian','Jason','J D B','Mr'),
 (273,111,'Bredfeldt','Floeckner','F J M','Mrs'),
 (274,125,'Taur','Ryszard','R T Y','Dr'),
 (275,125,'Federkins','Kevin','K P','Dr'),
 (276,125,'Lucas','Gary','G A','Dr'),
 (277,125,'Fitzgerald','Glenn','G G','Dr'),
 (278,125,'Bell','Jason','J G','Mr'),
 (279,125,'Prior','Lori','L R P','Dr'),
 (280,125,'Grantham','Jerry','J L J','Dr'),
 (281,125,'Shetty','Gerard','G D B','Dr'),
 (282,125,'Khadye','Roger','R L J','Dr'),
 (283,125,'Palmer','Dennis','D R','Prof'),
 (284,125,'Bruce','Steve','S Z','Dr'),
 (285,125,'Cessaro','Don','D A','Dr'),
 (286,125,'Makki','Adam','A L','Dr'),
 (287,125,'Hinojosa','James','J T','Dr'),
 (288,125,'Rooney','Xuming','X Z','Dr'),
 (289,125,'Selby','Phil','P H','Dr'),
 (290,125,'Garber','Jonathan','J E A','AProf'),
 (291,125,'Aristotle','David','D L','Dr'),
 (292,125,'Langstaff','Alan','A P J','Dr'),
 (293,125,'Duvall','Chad','C P G','AProf'),
 (294,125,'Weikamp','Mark','M J','Mr'),
 (295,126,'Das','Ron','R J','Dr'),
 (296,126,'Jacobs','Tess','T G','Mr'),
 (297,119,'Roy','Tzach','T B H','Mr'),
 (298,127,'Santhanakrishnan','Alan','A G J','Dr'),
 (299,119,'Marquis','Thomas','T B S','Mr'),
 (300,119,'Koska','Joachim','J M J P','Mr'),
 (301,119,'Howell','Matthew','M J H','Ms'),
 (302,119,'Brueck','Palyne','P G J','Prof'),
 (303,119,'Otte','Albyn','A M M','Ms'),
 (304,119,'Gass','Mark','M A J','Dr'),
 (305,119,'Whitman','Helmuth','H S P','Ms'),
 (306,119,'Jabbar','Murali','M J R','Dr'),
 (307,119,'Duchowski','Anders','A P J','Ms'),
 (308,119,'Portz','Shawn','S J J','Dr'),
 (309,116,'Maples','Rich','R W P','Dr'),
 (310,128,'Kuhn','Paul','P J R','Prof'),
 (311,128,'Singh','Balarie','B N','Dr'),
 (312,128,'Perry','Louis','L R J','AProf'),
 (313,128,'LeSable','Kwok','K J','Prof'),
 (314,128,'Turnbull','Janis','J J H','Dr'),
 (315,147,'Kalander','Kasper','K A C','Dr'),
 (316,128,'Matthews','Stephen','S A D','Dr'),
 (317,116,'Hartkoorn','Scott','S P A','Prof'),
 (319,106,'MacMillan','Michael','M V','Ms'),
 (320,120,'Szymanski','Neil','N C A','Dr'),
 (321,128,'Read','Jeremy','J M J','Dr'),
 (322,128,'Howard','Jamie','J N Y','AProf'),
 (323,106,'Blavatnik','Doug','D S L','Dr'),
 (324,128,'Hohenstein','Kel','K W R','Dr'),
 (325,127,'Banker','Pisharody','P P J','Dr'),
 (326,116,'Beegle','Tim','T R G','Mr'),
 (327,128,'Koren','Joseph','J J','Ms'),
 (328,118,'Mikulcik','Neal','N P R','Dr'),
 (329,130,'Findlow','Jim','J K','Dr'),
 (330,140,'Bob','Michael','M A','Mr'),
 (331,132,'Wood','Eric','E R','Dr'),
 (332,133,'Eaves','Maureen','M D H','Dr'),
 (333,116,'Vaughan','Greg','G A','Mr'),
 (334,133,'Hedrick','Alison','A T M','Prof'),
 (335,133,'Ebbert','Abigail','A J',NULL),
 (336,134,'Baindur','Andy','A M','Mr'),
 (337,133,'Jewell','Joseph','J G B',NULL),
 (338,133,'Neil','Paul','P S S','Dr'),
 (339,133,'Bonin','Jose','J M J',NULL),
 (340,128,'Reingold','Brent','B D D','Dr'),
 (341,135,'Shebs','Chen','C J R','Dr'),
 (342,135,'Thurston','Dan','D S','Mr'),
 (343,135,'Craig','Marc','M M J J','Ms'),
 (344,135,'Hochstaettler','Daniel','D C',NULL),
 (345,114,'Mak','Diana','D G','Dr'),
 (346,103,'Paterson','Brad','B A M','Dr'),
 (347,146,'Tran','Melissa','M S','Dr'),
 (348,135,'McMahon','Albert','A R H','Mr'),
 (349,135,'Kaufman','Darrell','D M P','Ms'),
 (350,132,'Shin','Michael','M M J','AProf'),
 (351,136,'Massey','Randy','R R','Dr'),
 (352,114,'Palmeri','Anna','A D','Dr'),
 (353,101,'Nodine','Peter','P N','Dr'),
 (354,100,'Panvalkar','Daniel','D R A','Mr'),
 (355,118,'McCune','Robert','R C','Mr'),
 (356,118,'Sacco','Vik','V N W','Dr'),
 (357,118,'Degrassi','Luis','L R G','Mr'),
 (358,118,'Prigge','Lydia','L S','Mr'),
 (359,118,'Edelson','Bryan','B P D','Mr'),
 (360,118,'Ly','Pierre','P M P','Dr'),
 (361,118,'Brooke','Andrew','A C D','Prof'),
 (363,118,'Evans','Gerard','G D M W','AProf'),
 (364,118,'Benner','Raghavan','R G H B','Mr'),
 (365,118,'Potter','Madam','M T E','Dr'),
 (366,118,'Brooks','Yvon','Y J L','Ms'),
 (367,118,'MacIntyre','Stephen','S K E','Miss'),
 (368,100,'Kwon','Ron','R R M','Prof'),
 (369,100,'Lawson','Robert','R C','Dr'),
 (370,137,'Pierce','Matthew','M C N','Dr'),
 (371,123,'Dahlberg','Gert','G P H','Mr'),
 (372,112,'Rivoire','Tayfun','T S','Dr'),
 (373,133,'Haag','Michael','M A E',NULL),
 (374,138,'Pitard','Enhua','E P F','Dr'),
 (375,138,'Joe','Steven','S M S','Dr'),
 (376,138,'Smith','Christian','C R L','Dr'),
 (377,138,'Waite','Dan','D C J','Mr'),
 (378,133,'Lee','Lee','L D',NULL),
 (379,133,'Albert','Diane','D R',NULL),
 (380,133,'Niguma','Sarah','S P',NULL),
 (381,133,'Coulter','Tony','T J',NULL),
 (382,133,'Kelley','Larry','L M',NULL),
 (383,133,'Ahern','Eric','E S',NULL),
 (384,133,'McCuen','Giuseppe','G G',NULL),
 (385,133,'Allis','Gokhan','G Z',NULL),
 (386,133,'Berggren','Jim','J D',NULL),
 (387,133,'Wooten','Bruce','B M',NULL),
 (388,133,'Henry','Pascal','P D',NULL),
 (389,133,'Yum','Dave','D B',NULL),
 (390,133,'Zylstra','Timothy','T C',NULL),
 (391,138,'Ruiz','Larry','L P D','Mr');
/*!40000 ALTER TABLE `academic` ENABLE KEYS */;


--
-- Definition of table `author`
--

DROP TABLE IF EXISTS `author`;
CREATE TABLE `author` (
  `PaNum` int(11) default NULL,
  `AcNum` int(11) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `author`
--

/*!40000 ALTER TABLE `author` DISABLE KEYS */;
INSERT INTO `author` (`PaNum`,`AcNum`) VALUES 
 (869,156),
 (870,157),
 (871,158),
 (871,159),
 (872,160),
 (872,129),
 (873,161),
 (873,162),
 (874,163),
 (875,164),
 (875,165),
 (876,166),
 (876,167),
 (877,169),
 (878,169),
 (879,170),
 (880,171),
 (881,172),
 (881,173),
 (882,174),
 (883,175),
 (884,176),
 (884,149),
 (885,177),
 (886,178),
 (886,127),
 (886,179),
 (886,129),
 (887,180),
 (887,181),
 (888,182),
 (889,183),
 (889,323),
 (890,184),
 (891,185),
 (891,461),
 (892,186),
 (892,187),
 (893,188),
 (893,189),
 (894,190),
 (894,191),
 (894,192),
 (894,193),
 (895,194),
 (895,195),
 (896,196),
 (897,197),
 (897,198),
 (898,199),
 (899,200),
 (900,201),
 (901,202),
 (901,203),
 (902,204),
 (903,205),
 (904,206),
 (905,208),
 (906,209),
 (907,212),
 (907,213),
 (908,169),
 (908,214),
 (909,117),
 (909,215),
 (910,216),
 (911,217),
 (911,297),
 (912,218),
 (912,219),
 (913,220),
 (913,221),
 (914,222),
 (915,223),
 (915,224),
 (915,225),
 (916,226),
 (916,227),
 (917,228),
 (918,229),
 (919,230),
 (919,231),
 (920,232),
 (920,233),
 (921,234),
 (922,235),
 (923,236),
 (923,237),
 (923,238),
 (924,239),
 (924,240),
 (925,241),
 (926,135),
 (926,137),
 (927,242),
 (927,243),
 (928,244),
 (929,245),
 (930,246),
 (930,247),
 (930,248),
 (931,249),
 (931,250),
 (932,251),
 (932,249),
 (933,252),
 (933,253),
 (934,227),
 (935,254),
 (935,439),
 (935,255),
 (935,256),
 (936,257),
 (936,258),
 (936,259),
 (937,260),
 (937,261),
 (937,262),
 (937,263),
 (937,323),
 (938,264),
 (938,265),
 (939,266),
 (939,267),
 (939,268),
 (939,269),
 (940,271),
 (941,272),
 (941,273),
 (942,274),
 (943,274),
 (944,275),
 (944,276),
 (944,263),
 (944,189),
 (945,277),
 (945,186),
 (946,278),
 (947,279),
 (948,280),
 (948,208),
 (949,281),
 (949,282),
 (950,208),
 (951,283),
 (951,284),
 (952,285),
 (952,284),
 (953,286),
 (953,287),
 (954,288),
 (955,289),
 (956,290),
 (957,291),
 (957,292),
 (958,128),
 (959,293),
 (960,294),
 (960,295),
 (961,296),
 (961,297),
 (962,298),
 (963,299),
 (964,300),
 (965,301),
 (965,302),
 (966,303),
 (966,304),
 (967,305),
 (967,306),
 (968,307),
 (969,308),
 (969,309),
 (970,310),
 (971,311),
 (971,312),
 (971,313),
 (972,263),
 (972,314),
 (973,165),
 (974,315),
 (974,316),
 (975,317),
 (975,237),
 (976,319),
 (977,320),
 (977,321),
 (978,291),
 (979,322),
 (980,323),
 (980,324),
 (981,325),
 (982,326),
 (983,135),
 (983,137),
 (983,327),
 (983,328),
 (984,329),
 (985,330),
 (985,331),
 (985,332),
 (986,333),
 (987,264),
 (987,334),
 (988,335),
 (988,336),
 (989,239),
 (989,192),
 (990,337),
 (990,338),
 (991,339),
 (992,340),
 (992,341),
 (993,342),
 (994,442),
 (994,343),
 (994,132),
 (995,249),
 (995,250),
 (996,344),
 (996,345),
 (997,346),
 (997,347),
 (998,348),
 (999,349),
 (999,350),
 (1000,351),
 (1001,257),
 (1001,352),
 (1001,259),
 (1002,353),
 (1002,354),
 (1003,355),
 (1004,356),
 (1005,357),
 (1005,358),
 (1006,359),
 (1006,360),
 (1007,361),
 (1007,363),
 (1008,157),
 (1009,364),
 (1009,365),
 (1009,366),
 (1010,367),
 (1011,368),
 (1012,448),
 (1012,429),
 (1013,369),
 (1013,214),
 (1014,370),
 (1015,371),
 (1015,372),
 (1016,373),
 (1017,374),
 (1018,375),
 (1018,376),
 (1019,377),
 (1019,378),
 (1019,379),
 (1020,380),
 (1021,381),
 (1021,382),
 (1021,383),
 (1021,384),
 (1022,385),
 (1022,386),
 (1022,237),
 (1022,387),
 (1023,388),
 (1023,389),
 (1024,390),
 (1025,391),
 (1025,392),
 (1026,393),
 (1026,394),
 (1027,311),
 (1027,395),
 (1027,396),
 (1028,397),
 (1028,399),
 (1028,400),
 (1029,401),
 (1030,295),
 (1031,402),
 (1032,403),
 (1033,404),
 (1033,405),
 (1033,406),
 (1034,166),
 (1035,407),
 (1035,439),
 (1035,408),
 (1035,409),
 (1036,289),
 (1037,380),
 (1038,145),
 (1039,410),
 (1039,154),
 (1040,411),
 (1040,413),
 (1040,414),
 (1041,251),
 (1041,249),
 (1041,389),
 (1042,283),
 (1043,415),
 (1043,416),
 (1043,417),
 (1044,415),
 (1044,416),
 (1044,417),
 (1045,137),
 (1046,188),
 (1046,189),
 (1047,418),
 (1048,419),
 (1049,420),
 (1050,368),
 (1051,421),
 (1051,422),
 (1052,375),
 (1052,283),
 (1053,423),
 (1053,424),
 (1054,223),
 (1054,224),
 (1054,225),
 (1055,425),
 (1055,426),
 (1056,427),
 (1057,428),
 (1057,429),
 (1057,430),
 (1058,431),
 (1059,432),
 (1059,335),
 (1059,336),
 (1060,433),
 (1060,249),
 (1060,434),
 (1061,435),
 (1061,436),
 (1062,437),
 (1063,438),
 (1064,439),
 (1064,440),
 (1064,441),
 (1065,188),
 (1065,189),
 (1066,442),
 (1066,358),
 (1067,405),
 (1067,443),
 (1068,444),
 (1068,446),
 (1069,183),
 (1069,447),
 (1069,351),
 (1070,448),
 (1071,449),
 (1072,450),
 (1072,451),
 (1073,452),
 (1073,453),
 (1073,454),
 (1074,455),
 (1074,456),
 (1075,457),
 (1075,458),
 (1076,459),
 (1076,460),
 (1077,461),
 (1078,462),
 (1078,463),
 (1078,464),
 (1079,465),
 (1079,466),
 (1080,467),
 (1080,468),
 (1081,469),
 (1081,100),
 (1082,101),
 (1083,102),
 (1084,103),
 (1085,104),
 (1085,105),
 (1085,106),
 (1086,107),
 (1086,108),
 (1086,453),
 (1087,350),
 (1088,109),
 (1088,111),
 (1089,113),
 (1089,114),
 (1090,115),
 (1090,116),
 (1091,117),
 (1092,118),
 (1092,119),
 (1093,120),
 (1093,244),
 (1094,121),
 (1095,122),
 (1096,123),
 (1096,124),
 (1097,125),
 (1097,126),
 (1098,127),
 (1098,128),
 (1099,129),
 (1099,310),
 (1099,130),
 (1100,129),
 (1100,310),
 (1100,130),
 (1101,131),
 (1102,306),
 (1102,132),
 (1102,133),
 (1103,134),
 (1103,135),
 (1104,137),
 (1104,462),
 (1105,138),
 (1105,139),
 (1106,140),
 (1107,141),
 (1108,142),
 (1108,143),
 (1109,144),
 (1110,306),
 (1111,145),
 (1111,146),
 (1112,267),
 (1112,268),
 (1112,148),
 (1113,149),
 (1113,150),
 (1113,151),
 (1114,152),
 (1115,153),
 (1116,154),
 (1117,155),
 (1117,156),
 (1118,157),
 (1118,158),
 (1119,159),
 (1120,160),
 (1121,161),
 (1121,162),
 (1121,163),
 (1122,164),
 (1123,165),
 (1124,166),
 (1125,306),
 (1126,167),
 (1127,169),
 (1127,169),
 (1128,170),
 (1129,171),
 (1129,172),
 (1130,173),
 (1130,152),
 (1131,174),
 (1132,175),
 (1132,176),
 (1133,177),
 (1133,178),
 (1134,179),
 (1134,180),
 (1135,181),
 (1135,182),
 (1136,183),
 (1136,184),
 (1136,114),
 (1137,185),
 (1137,186),
 (1137,187),
 (1138,188),
 (1139,189),
 (1140,190),
 (1141,191),
 (1141,192),
 (1141,193),
 (1142,194),
 (1142,195),
 (1143,196),
 (1143,197),
 (1143,198),
 (1144,180),
 (1144,199),
 (1145,200),
 (1146,201),
 (1147,326),
 (1148,202),
 (1148,203),
 (1148,290),
 (1149,204),
 (1149,205),
 (1150,204),
 (1150,205),
 (1151,206),
 (1152,235),
 (1153,244),
 (1154,182),
 (1155,208),
 (1155,209),
 (1156,212),
 (1156,213),
 (1157,152),
 (1157,173),
 (1158,244),
 (1159,214),
 (1159,215),
 (1159,216),
 (1160,217),
 (1161,218),
 (1162,219),
 (1163,220),
 (1163,221),
 (1164,222),
 (1164,335),
 (1164,323),
 (1165,223),
 (1165,224),
 (1165,225),
 (1166,166),
 (1167,226),
 (1167,227),
 (1168,390),
 (1168,228),
 (1169,223),
 (1169,224),
 (1169,225),
 (1170,326),
 (1171,229),
 (1171,230),
 (1172,231),
 (1172,232),
 (1172,233),
 (1173,234),
 (1174,235),
 (1174,236),
 (1174,237),
 (1175,238),
 (1176,326),
 (1177,239),
 (1177,197),
 (1178,240),
 (1178,241),
 (1178,242),
 (1179,243),
 (1179,244),
 (1180,245),
 (1180,246),
 (1181,247),
 (1181,248),
 (1182,249),
 (1182,172),
 (1183,250),
 (1184,251),
 (1184,252),
 (1185,253),
 (1185,254),
 (1186,255),
 (1187,256),
 (1188,257),
 (1188,268),
 (1189,258),
 (1189,259),
 (1189,260),
 (1189,261),
 (1190,262),
 (1190,305),
 (1191,263),
 (1191,264),
 (1191,265),
 (1192,266),
 (1193,267),
 (1194,268),
 (1194,269),
 (1195,268),
 (1195,269),
 (1196,271),
 (1196,272),
 (1196,273),
 (1197,266),
 (1197,267),
 (1197,268),
 (1198,274),
 (1199,326),
 (1200,174),
 (1201,275),
 (1202,276),
 (1202,277),
 (1202,278),
 (1203,279),
 (1203,148),
 (1203,280),
 (1203,281),
 (1204,282),
 (1205,283),
 (1205,284),
 (1205,285),
 (1206,286),
 (1206,287),
 (1206,288),
 (1206,134),
 (1207,289),
 (1208,290),
 (1208,291),
 (1208,284),
 (1209,173),
 (1210,292),
 (1211,293),
 (1212,290),
 (1212,284),
 (1213,294),
 (1213,127),
 (1214,289),
 (1215,295),
 (1216,296),
 (1217,297),
 (1218,298),
 (1218,299),
 (1219,295),
 (1220,300),
 (1220,301),
 (1221,274),
 (1222,292),
 (1223,302),
 (1223,303),
 (1223,304),
 (1224,305),
 (1225,306),
 (1225,292),
 (1226,307),
 (1227,308),
 (1227,309),
 (1228,310),
 (1228,311),
 (1229,162),
 (1230,312),
 (1230,313),
 (1230,314),
 (1231,315),
 (1232,316),
 (1232,317),
 (1233,319),
 (1234,320),
 (1234,321),
 (1235,297),
 (1235,296),
 (1236,322),
 (1236,323),
 (1237,324),
 (1237,325),
 (1237,326),
 (1238,327),
 (1238,328),
 (1238,329),
 (1239,330),
 (1239,331),
 (1239,332),
 (1240,298),
 (1241,333),
 (1242,334),
 (1243,335),
 (1244,324),
 (1244,325),
 (1244,326),
 (1245,336),
 (1245,337),
 (1246,338),
 (1246,339),
 (1247,340),
 (1247,341),
 (1247,342),
 (1247,343),
 (1248,344),
 (1248,345),
 (1248,346),
 (1249,347),
 (1249,348),
 (1249,349),
 (1250,350),
 (1251,351),
 (1251,352),
 (1252,224),
 (1252,353),
 (1252,354),
 (1253,222),
 (1254,355),
 (1255,356),
 (1256,357),
 (1256,358),
 (1257,359),
 (1258,360),
 (1258,361),
 (1258,363),
 (1259,162),
 (1259,224),
 (1259,250),
 (1260,216),
 (1261,364),
 (1261,365),
 (1261,366),
 (1262,333),
 (1263,367),
 (1264,368),
 (1264,369),
 (1265,295),
 (1266,370),
 (1266,371),
 (1267,372),
 (1268,373),
 (1268,374),
 (1269,364),
 (1269,365),
 (1270,375),
 (1270,376),
 (1271,377),
 (1272,378),
 (1273,379),
 (1273,380),
 (1273,381),
 (1274,382),
 (1274,280),
 (1275,383),
 (1276,384),
 (1277,385),
 (1277,333),
 (1278,386),
 (1279,387),
 (1279,388),
 (1280,103),
 (1280,389),
 (1281,390),
 (1282,391),
 (1282,392),
 (1282,393),
 (1282,394),
 (1282,395),
 (1283,396),
 (1284,397),
 (1285,399),
 (1285,385),
 (1285,333),
 (1286,400),
 (1287,249),
 (1287,205),
 (1288,401),
 (1289,353),
 (1290,254),
 (1290,312),
 (1290,314),
 (1291,402),
 (1291,403),
 (1291,404),
 (1292,405),
 (1293,162),
 (1293,250),
 (1293,406),
 (1294,407),
 (1294,408),
 (1294,409),
 (1294,410),
 (1294,411),
 (1294,413),
 (1294,414),
 (1294,415),
 (1294,416),
 (1295,417),
 (1296,418),
 (1296,419),
 (1297,420),
 (1297,285),
 (1297,421),
 (1298,173),
 (1299,422),
 (1300,423),
 (1300,424),
 (1301,333),
 (1301,385),
 (1302,425),
 (1303,426),
 (1303,427),
 (1304,428),
 (1305,402),
 (1305,403),
 (1306,417),
 (1306,429),
 (1307,430),
 (1307,431),
 (1308,432),
 (1309,346),
 (1310,433),
 (1310,105),
 (1310,345),
 (1311,434),
 (1311,435),
 (1312,399),
 (1312,402),
 (1313,436),
 (1313,437),
 (1314,438),
 (1314,439),
 (1314,440),
 (1315,441),
 (1315,442),
 (1315,443),
 (1315,444),
 (1315,446),
 (1315,447),
 (1316,448),
 (1316,449),
 (1317,450),
 (1317,451),
 (1318,350),
 (1318,452),
 (1319,433),
 (1319,285),
 (1319,453),
 (1320,454),
 (1320,455),
 (1321,456),
 (1322,396),
 (1323,457),
 (1324,458),
 (1324,459),
 (1325,460),
 (1325,461),
 (1326,462),
 (1327,463),
 (1328,464),
 (1329,465),
 (1330,429),
 (1330,466),
 (1330,467),
 (1331,468),
 (1331,469),
 (1331,100),
 (1332,101),
 (1332,102),
 (1333,103),
 (1333,104),
 (1334,105),
 (1334,106),
 (1335,107),
 (1335,108),
 (1336,109),
 (1336,413),
 (1336,111),
 (1337,328),
 (1338,274),
 (1338,113),
 (1339,114),
 (1339,336),
 (1339,115),
 (1340,116),
 (1340,117),
 (1341,319),
 (1342,109),
 (1342,118),
 (1343,119),
 (1343,120),
 (1344,121),
 (1345,122),
 (1346,123),
 (1347,301),
 (1347,124),
 (1347,299),
 (1347,336),
 (1348,125),
 (1349,126),
 (1350,127),
 (1350,128),
 (1350,129),
 (1351,130),
 (1351,131),
 (1352,311),
 (1353,385),
 (1353,333),
 (1354,306),
 (1355,132),
 (1356,133),
 (1357,134),
 (1357,421),
 (1358,343),
 (1359,135),
 (1359,137),
 (1360,138),
 (1361,139),
 (1362,458),
 (1363,140),
 (1363,141),
 (1364,142),
 (1365,432),
 (1366,143),
 (1366,144),
 (1366,145),
 (1366,146),
 (1367,452),
 (1368,241),
 (1369,148),
 (1370,148),
 (1371,149),
 (1371,150),
 (1371,151),
 (1371,299),
 (1372,152),
 (1372,153),
 (1373,125),
 (1374,154),
 (1375,155),
 (1376,273),
 (1377,156),
 (1377,157),
 (1378,158),
 (1379,159),
 (1379,101),
 (1380,160),
 (1381,161),
 (1381,162),
 (1381,163),
 (1382,164),
 (1382,165),
 (1382,166),
 (1383,353),
 (1384,167),
 (1384,132),
 (1385,427),
 (1386,328),
 (1387,429),
 (1387,169),
 (1387,170),
 (1388,171),
 (1389,172),
 (1389,173),
 (1389,307),
 (1390,469),
 (1391,174),
 (1392,175),
 (1392,176),
 (1393,177),
 (1394,311),
 (1394,178),
 (1395,179),
 (1396,180),
 (1396,181),
 (1396,182),
 (1397,183),
 (1398,370),
 (1398,184),
 (1399,185),
 (1399,186),
 (1400,187),
 (1400,254),
 (1400,314),
 (1400,188),
 (1401,435),
 (1402,340),
 (1402,189),
 (1403,133),
 (1403,456),
 (1403,190),
 (1404,328),
 (1405,191),
 (1405,192),
 (1405,193),
 (1406,194),
 (1406,195),
 (1407,196),
 (1408,197),
 (1408,198),
 (1409,199),
 (1410,200),
 (1410,201),
 (1411,452),
 (1412,202),
 (1412,203),
 (1412,204),
 (1413,133),
 (1413,205),
 (1414,206),
 (1414,208),
 (1415,348),
 (1415,208),
 (1416,209),
 (1416,212),
 (1417,384),
 (1417,213),
 (1418,214),
 (1419,215),
 (1420,216),
 (1421,217),
 (1422,218),
 (1422,438),
 (1423,219),
 (1423,220),
 (1423,221),
 (1424,254),
 (1424,137),
 (1424,312),
 (1425,241),
 (1426,222),
 (1426,383),
 (1427,223),
 (1427,224),
 (1428,241),
 (1429,328),
 (1430,225),
 (1430,226),
 (1431,227),
 (1432,228),
 (1432,404),
 (1432,229),
 (1433,282),
 (1433,230),
 (1434,231),
 (1435,232),
 (1435,165),
 (1436,142),
 (1437,328),
 (1438,233),
 (1439,234),
 (1439,216),
 (1440,105),
 (1440,235),
 (1441,236),
 (1442,237),
 (1442,238),
 (1443,239),
 (1443,240),
 (1444,241),
 (1444,242),
 (1445,243),
 (1445,244),
 (1446,370),
 (1446,245),
 (1447,246),
 (1448,458),
 (1449,247),
 (1450,132),
 (1451,248),
 (1451,249),
 (1451,100),
 (1452,250),
 (1452,138),
 (1452,251),
 (1453,452),
 (1454,319),
 (1455,154),
 (1455,252),
 (1456,253),
 (1456,254),
 (1456,255),
 (1457,122),
 (1457,256),
 (1457,257),
 (1458,428),
 (1459,258),
 (1460,259),
 (1461,260),
 (1462,261),
 (1463,262),
 (1463,263),
 (1464,264),
 (1464,265),
 (1465,266),
 (1465,267),
 (1465,268),
 (1466,269),
 (1467,286),
 (1468,250),
 (1468,138),
 (1468,251),
 (1469,271),
 (1469,272),
 (1469,273),
 (1470,274),
 (1471,275),
 (1472,276),
 (1472,277),
 (1473,253),
 (1473,278),
 (1474,349),
 (1475,279),
 (1476,280),
 (1476,281),
 (1476,282),
 (1476,283),
 (1476,284),
 (1477,241),
 (1478,285),
 (1479,286),
 (1480,287),
 (1480,288),
 (1481,289),
 (1482,287),
 (1483,290),
 (1484,433),
 (1484,291),
 (1484,292),
 (1485,311),
 (1486,293),
 (1486,461),
 (1487,294),
 (1487,295),
 (1488,296),
 (1488,297),
 (1489,216),
 (1489,345),
 (1489,298),
 (1490,299),
 (1491,300),
 (1,100),
 (1,101),
 (2,102),
 (3,103),
 (3,104),
 (4,105),
 (5,106),
 (5,107),
 (5,108),
 (5,109),
 (5,111),
 (6,113),
 (7,114),
 (7,115),
 (7,116),
 (7,117),
 (8,118),
 (9,119),
 (9,120),
 (10,121),
 (11,122),
 (11,123),
 (11,124),
 (11,125),
 (11,126),
 (12,127),
 (12,128),
 (12,129),
 (13,130),
 (13,131),
 (14,132),
 (14,133),
 (15,134),
 (16,135),
 (16,137),
 (17,138),
 (17,139),
 (18,140),
 (18,141),
 (19,142),
 (20,143),
 (21,144),
 (22,145),
 (22,146),
 (23,148),
 (24,149),
 (24,150),
 (24,151),
 (25,152),
 (25,153),
 (25,154),
 (26,155),
 (26,156),
 (27,157),
 (27,158),
 (28,159),
 (28,160),
 (28,127),
 (29,161),
 (29,162),
 (30,163),
 (31,164),
 (32,165),
 (32,166),
 (32,167),
 (33,169),
 (34,169),
 (34,170),
 (35,171),
 (36,172),
 (36,173),
 (37,174),
 (37,175),
 (37,176),
 (38,177),
 (38,178),
 (39,179),
 (39,180),
 (39,181),
 (40,182),
 (41,183),
 (41,184),
 (42,185),
 (42,186),
 (42,187),
 (43,188),
 (43,189),
 (44,190),
 (45,191),
 (45,192),
 (46,193),
 (46,194),
 (47,195),
 (48,196),
 (48,197),
 (48,198),
 (49,199),
 (49,200),
 (49,201),
 (49,202),
 (49,203),
 (49,204),
 (49,205),
 (49,206),
 (50,208),
 (50,209),
 (50,212),
 (51,213),
 (51,214),
 (52,215),
 (52,216),
 (53,217),
 (54,218),
 (55,162),
 (55,219),
 (56,220),
 (56,221),
 (56,222),
 (56,223),
 (57,224),
 (58,225),
 (58,226),
 (59,227),
 (59,228),
 (60,229),
 (61,230),
 (61,231),
 (62,232),
 (62,233),
 (63,234),
 (63,235),
 (64,236),
 (65,237),
 (65,238),
 (65,239),
 (66,240),
 (67,241),
 (67,242),
 (68,243),
 (68,244),
 (69,245),
 (70,246),
 (70,247),
 (70,248),
 (71,249),
 (71,250),
 (72,251),
 (73,252),
 (73,253),
 (74,254),
 (74,255),
 (74,256),
 (75,257),
 (76,258),
 (76,259),
 (77,260),
 (77,261),
 (78,132),
 (79,262),
 (79,263),
 (80,264),
 (81,265),
 (81,266),
 (82,267),
 (82,268),
 (83,269),
 (83,271),
 (83,272),
 (84,273),
 (84,134),
 (85,246),
 (85,248),
 (85,274),
 (86,275),
 (86,276),
 (87,277),
 (87,278),
 (88,279),
 (89,280),
 (89,281),
 (89,282),
 (90,280),
 (90,283),
 (91,284),
 (92,285),
 (93,286),
 (93,287),
 (94,288),
 (94,289),
 (95,290),
 (95,291),
 (96,292),
 (97,293),
 (98,294),
 (99,295),
 (99,296),
 (100,297),
 (101,298),
 (102,299),
 (102,300),
 (103,301),
 (103,302),
 (104,303),
 (104,304),
 (105,305),
 (106,306),
 (106,220),
 (106,307),
 (107,308),
 (108,309),
 (108,310),
 (109,311),
 (110,312),
 (110,313),
 (110,314),
 (111,315),
 (112,316),
 (113,317),
 (114,319),
 (114,320),
 (115,321),
 (115,322),
 (116,323),
 (116,324),
 (117,325),
 (117,326),
 (117,327),
 (118,328),
 (118,329),
 (119,330),
 (119,331),
 (120,332),
 (121,333),
 (121,334),
 (122,335),
 (123,336),
 (124,337),
 (124,338),
 (125,339),
 (126,292),
 (126,340),
 (126,341),
 (127,342),
 (127,343),
 (128,344),
 (128,345),
 (129,346),
 (129,347),
 (130,348),
 (131,349),
 (132,350),
 (132,351),
 (133,352),
 (133,353),
 (133,354),
 (134,355),
 (135,356),
 (135,357),
 (136,358),
 (137,359),
 (137,360),
 (138,361),
 (138,363),
 (138,364),
 (139,365),
 (139,366),
 (140,367),
 (140,368),
 (141,369),
 (141,370),
 (142,371),
 (143,372),
 (143,373),
 (144,374),
 (145,375),
 (146,376),
 (146,377),
 (147,378),
 (148,379),
 (149,380),
 (149,381),
 (150,382),
 (151,383),
 (151,384),
 (152,385),
 (152,386),
 (152,387),
 (153,388),
 (154,389),
 (154,390),
 (155,391),
 (156,392),
 (156,393),
 (157,394),
 (157,395),
 (158,396),
 (158,397),
 (159,399),
 (159,400),
 (160,401),
 (160,402),
 (160,403),
 (161,404),
 (161,405),
 (162,406),
 (162,407),
 (163,408),
 (163,409),
 (164,410),
 (164,411),
 (164,413),
 (164,414),
 (165,415),
 (165,416),
 (166,417),
 (167,418),
 (168,338),
 (168,419),
 (169,420),
 (169,421),
 (170,422),
 (170,423),
 (170,424),
 (170,425),
 (171,426),
 (172,427),
 (173,428),
 (174,429),
 (175,368),
 (176,430),
 (177,431),
 (178,432),
 (178,433),
 (178,434),
 (178,435),
 (178,436),
 (179,437),
 (179,438),
 (180,439),
 (181,105),
 (181,440),
 (181,441),
 (182,442),
 (182,443),
 (182,133),
 (182,132),
 (183,444),
 (184,446),
 (185,447),
 (185,448),
 (185,449),
 (185,450),
 (186,451),
 (186,452),
 (187,224),
 (187,453),
 (188,454),
 (189,455),
 (190,456),
 (190,457),
 (190,458),
 (190,459),
 (190,460),
 (190,461),
 (191,462),
 (191,463),
 (192,464),
 (193,465),
 (194,466),
 (195,467),
 (195,468),
 (196,419),
 (196,338),
 (197,469),
 (198,100),
 (198,101),
 (199,102),
 (199,103),
 (199,104),
 (200,105),
 (200,106),
 (201,107),
 (201,108),
 (201,109),
 (201,111),
 (202,113),
 (202,114),
 (203,115),
 (204,116),
 (204,117),
 (205,118),
 (205,119),
 (206,120),
 (206,121),
 (206,122),
 (206,123),
 (206,124),
 (207,125),
 (207,126),
 (208,127),
 (208,128),
 (208,419),
 (209,129),
 (209,392),
 (210,130),
 (211,131),
 (212,132),
 (212,375),
 (213,179),
 (213,133),
 (213,134),
 (213,135),
 (214,254),
 (214,137),
 (215,138),
 (216,134),
 (216,287),
 (217,139),
 (217,140),
 (218,141),
 (219,142),
 (219,142),
 (220,453),
 (221,143),
 (222,144),
 (222,145),
 (223,146),
 (224,148),
 (225,149),
 (226,150),
 (226,151),
 (227,152),
 (228,153),
 (228,154),
 (228,155),
 (228,156),
 (229,157),
 (230,158),
 (230,159),
 (230,160),
 (231,161),
 (231,162),
 (232,163),
 (232,164),
 (232,165),
 (232,166),
 (233,167),
 (234,169),
 (234,170),
 (234,171),
 (234,172),
 (234,173),
 (234,174),
 (234,175),
 (235,176),
 (235,177),
 (236,178),
 (237,179),
 (237,180),
 (238,181),
 (239,182),
 (239,183),
 (240,184),
 (241,185),
 (241,186),
 (241,187),
 (241,188),
 (242,189),
 (242,190),
 (242,191),
 (243,192),
 (244,193),
 (244,194),
 (244,195),
 (245,196),
 (245,197),
 (246,198),
 (246,199),
 (247,200),
 (247,201),
 (248,202),
 (248,203),
 (248,204),
 (249,205),
 (249,206),
 (250,208),
 (251,208),
 (252,209),
 (253,212),
 (254,213),
 (255,214),
 (255,215),
 (256,216),
 (257,283),
 (257,280),
 (258,217),
 (258,218),
 (258,219),
 (259,288),
 (260,220),
 (260,221),
 (260,222),
 (260,223),
 (261,224),
 (261,306),
 (261,225),
 (261,226),
 (261,227),
 (262,214),
 (262,228),
 (262,229),
 (262,230),
 (262,231),
 (263,232),
 (263,284),
 (264,233),
 (264,234),
 (265,290),
 (265,235),
 (266,213),
 (267,236),
 (267,252),
 (268,131),
 (268,237),
 (268,238),
 (269,239),
 (269,240),
 (270,241),
 (270,242),
 (271,196),
 (271,243),
 (272,244),
 (273,245),
 (273,246),
 (273,247),
 (273,248),
 (274,249),
 (274,250),
 (274,251),
 (274,252),
 (275,253),
 (275,254),
 (275,255),
 (275,256),
 (275,257),
 (276,224),
 (276,258),
 (276,259),
 (276,260),
 (277,261),
 (277,262),
 (278,263),
 (278,264),
 (279,265),
 (279,280),
 (280,266),
 (280,267),
 (280,268),
 (280,269),
 (280,271),
 (281,272),
 (281,273),
 (282,274),
 (282,275),
 (283,276),
 (283,277),
 (284,278),
 (284,279),
 (285,280),
 (285,281),
 (286,282),
 (287,283),
 (287,284),
 (287,123),
 (288,137),
 (288,285),
 (289,286),
 (290,287),
 (290,288),
 (291,289),
 (291,290),
 (292,291),
 (293,292),
 (294,293),
 (294,228),
 (295,294),
 (295,295),
 (295,215),
 (296,296),
 (297,297),
 (297,298),
 (297,299),
 (298,300),
 (298,301),
 (298,302),
 (299,303),
 (299,304),
 (299,178),
 (300,305),
 (300,306),
 (301,307),
 (302,138),
 (302,308),
 (303,309),
 (304,310),
 (305,311),
 (305,312),
 (306,313),
 (307,314),
 (308,315),
 (309,316),
 (309,317),
 (309,319),
 (310,320),
 (311,321),
 (312,322),
 (312,323),
 (312,324),
 (313,325),
 (313,326),
 (314,327),
 (315,328),
 (315,327),
 (316,329),
 (317,330),
 (318,331),
 (319,332),
 (320,333),
 (321,334),
 (321,335),
 (322,336),
 (322,337),
 (323,338),
 (324,339),
 (324,340),
 (325,341),
 (326,342),
 (327,343),
 (327,344),
 (328,345),
 (329,232),
 (329,346),
 (329,347),
 (329,348),
 (330,349),
 (330,350),
 (331,351),
 (331,352),
 (331,353),
 (332,354),
 (333,355),
 (334,356),
 (334,357),
 (335,358),
 (335,306),
 (335,305),
 (336,359),
 (336,360),
 (337,361),
 (337,363),
 (338,364),
 (339,365),
 (340,366),
 (340,367),
 (341,233),
 (341,265),
 (342,368),
 (343,369),
 (344,370),
 (344,371),
 (344,372),
 (344,231),
 (345,209),
 (345,373),
 (345,374),
 (346,375),
 (346,376),
 (347,377),
 (348,353),
 (348,378),
 (349,379),
 (350,380),
 (351,381),
 (352,382),
 (353,383),
 (353,384),
 (354,385),
 (354,386),
 (354,387),
 (355,388),
 (355,389),
 (355,390),
 (356,391),
 (357,392),
 (357,393),
 (357,394),
 (357,395),
 (358,396),
 (358,397),
 (358,399),
 (358,400),
 (359,401),
 (359,402),
 (360,209),
 (360,373),
 (360,374),
 (360,403),
 (361,404),
 (361,405),
 (362,406),
 (362,294),
 (362,295),
 (362,215),
 (363,407),
 (363,408),
 (364,409),
 (364,410),
 (365,411),
 (366,413),
 (367,164),
 (368,414),
 (368,415),
 (369,416),
 (369,417),
 (370,224),
 (371,178),
 (371,418),
 (372,419),
 (372,420),
 (372,421),
 (373,278),
 (374,422),
 (374,423),
 (374,424),
 (375,425),
 (375,426),
 (375,427),
 (376,428),
 (377,429),
 (377,430),
 (377,431),
 (378,432),
 (378,433),
 (378,434),
 (379,435),
 (379,436),
 (380,437),
 (380,438),
 (380,439),
 (381,440),
 (381,441),
 (381,442),
 (382,443),
 (382,444),
 (383,446),
 (383,447),
 (384,448),
 (384,449),
 (385,450),
 (385,451),
 (386,452),
 (386,453),
 (386,454),
 (386,455),
 (387,456),
 (387,457),
 (388,458),
 (388,459),
 (388,460),
 (389,162),
 (390,461),
 (391,462),
 (391,463),
 (392,464),
 (393,290),
 (393,465),
 (394,466),
 (395,280),
 (395,467),
 (395,283),
 (396,468),
 (397,469),
 (398,131),
 (398,100),
 (398,101),
 (399,102),
 (399,103),
 (400,104),
 (400,105),
 (401,331),
 (402,106),
 (402,107),
 (403,108),
 (403,109),
 (404,372),
 (404,111),
 (405,113),
 (406,114),
 (406,446),
 (407,115),
 (407,116),
 (408,117),
 (409,118),
 (409,119),
 (410,120),
 (410,121),
 (410,122),
 (410,123),
 (410,124),
 (410,125),
 (411,126),
 (411,127),
 (412,128),
 (412,129),
 (412,130),
 (413,233),
 (413,131),
 (414,141),
 (415,408),
 (416,132),
 (416,133),
 (416,134),
 (417,135),
 (418,137),
 (418,138),
 (419,139),
 (420,140),
 (421,141),
 (421,142),
 (421,143),
 (422,144),
 (422,200),
 (423,145),
 (423,146),
 (424,257),
 (425,363),
 (426,192),
 (427,148),
 (427,149),
 (428,140),
 (429,150),
 (429,151),
 (430,444),
 (430,193),
 (431,152),
 (431,153),
 (431,154),
 (432,155),
 (432,156),
 (432,157),
 (433,158),
 (433,418),
 (434,159),
 (434,289),
 (435,160),
 (435,161),
 (436,162),
 (437,163),
 (438,164),
 (438,165),
 (438,166),
 (438,167),
 (439,169),
 (440,170),
 (441,171),
 (441,181),
 (441,172),
 (441,173),
 (442,174),
 (442,175),
 (442,176),
 (442,177),
 (442,117),
 (442,178),
 (443,179),
 (443,180),
 (444,181),
 (444,182),
 (444,183),
 (444,184),
 (445,179),
 (445,185),
 (445,186),
 (445,180),
 (446,187),
 (446,188),
 (446,189),
 (446,190),
 (446,191),
 (446,192),
 (447,193),
 (448,194),
 (448,195),
 (449,187),
 (449,196),
 (449,197),
 (449,198),
 (449,199),
 (449,189),
 (449,190),
 (449,191),
 (449,200),
 (450,174),
 (451,201),
 (452,202),
 (453,203),
 (453,204),
 (454,205),
 (454,206),
 (455,208),
 (455,209),
 (456,212),
 (457,213),
 (458,214),
 (458,215),
 (459,216),
 (459,215),
 (460,217),
 (460,218),
 (461,219),
 (462,290),
 (462,220),
 (463,221),
 (463,222),
 (463,223),
 (464,224),
 (464,225),
 (465,265),
 (465,226),
 (466,227),
 (467,228),
 (467,229),
 (467,230),
 (467,231),
 (468,232),
 (468,233),
 (469,234),
 (470,235),
 (470,236),
 (471,237),
 (471,238),
 (471,239),
 (472,240),
 (473,241),
 (473,242),
 (474,243),
 (475,244),
 (475,245),
 (476,246),
 (476,247),
 (477,248),
 (478,249),
 (478,250),
 (478,251),
 (479,252),
 (479,253),
 (480,254),
 (480,255),
 (481,256),
 (481,257),
 (482,258),
 (482,452),
 (482,259),
 (483,260),
 (484,261),
 (484,262),
 (484,263),
 (485,264),
 (486,130),
 (487,265),
 (487,266),
 (487,267),
 (488,268),
 (488,269),
 (488,271),
 (488,272),
 (489,273),
 (489,274),
 (489,275),
 (489,435),
 (490,276),
 (490,277),
 (490,278),
 (491,279),
 (491,280),
 (492,281),
 (492,282),
 (493,283),
 (494,284),
 (494,285),
 (495,286),
 (495,287),
 (495,288),
 (496,289),
 (496,290),
 (497,291),
 (497,292),
 (498,293),
 (498,294),
 (499,295),
 (500,296),
 (500,297),
 (501,298),
 (502,299),
 (502,300),
 (502,301),
 (503,394),
 (503,302),
 (504,303),
 (504,304),
 (504,305),
 (505,306),
 (506,307),
 (506,308),
 (506,309),
 (507,310),
 (508,311),
 (508,312),
 (508,313),
 (509,314),
 (510,109),
 (510,315),
 (510,394),
 (511,316),
 (511,317),
 (511,459),
 (511,319),
 (511,320),
 (512,321),
 (513,322),
 (513,323),
 (514,324),
 (514,325),
 (514,326),
 (514,327),
 (514,328),
 (515,329),
 (515,346),
 (516,258),
 (516,330),
 (517,331),
 (517,332),
 (517,333),
 (518,334),
 (518,335),
 (519,336),
 (519,104),
 (519,105),
 (520,337),
 (520,338),
 (520,339),
 (521,340),
 (521,341),
 (522,342),
 (522,343),
 (523,344),
 (524,345),
 (524,338),
 (524,346),
 (525,295),
 (525,347),
 (525,294),
 (525,216),
 (526,348),
 (527,348),
 (528,349),
 (528,350),
 (529,351),
 (529,352),
 (530,353),
 (531,354),
 (531,355),
 (532,356),
 (532,357),
 (533,358),
 (533,359),
 (533,360),
 (534,361),
 (534,363),
 (535,306),
 (536,364),
 (537,419),
 (538,365),
 (538,366),
 (539,367),
 (539,368),
 (540,369),
 (541,370),
 (542,371),
 (542,372),
 (543,373),
 (543,374),
 (544,375),
 (544,376),
 (544,422),
 (545,377),
 (545,378),
 (545,379),
 (546,380),
 (546,407),
 (547,381),
 (547,382),
 (548,383),
 (549,338),
 (549,345),
 (550,384),
 (550,385),
 (551,386),
 (551,387),
 (552,388),
 (552,389),
 (553,390),
 (553,391),
 (554,322),
 (554,392),
 (554,393),
 (555,394),
 (556,395),
 (557,396),
 (558,397),
 (558,399),
 (559,400),
 (559,401),
 (559,402),
 (559,403),
 (560,404),
 (560,405),
 (560,406),
 (561,407),
 (562,408),
 (562,409),
 (563,410),
 (564,107),
 (564,411),
 (565,413),
 (565,407),
 (566,414),
 (567,415),
 (567,416),
 (568,417),
 (568,325),
 (569,418),
 (570,348),
 (570,419),
 (571,420),
 (571,421),
 (572,422),
 (572,423),
 (573,424),
 (573,425),
 (574,426),
 (574,427),
 (574,428),
 (574,421),
 (575,429),
 (576,430),
 (576,431),
 (577,432),
 (578,433),
 (578,434),
 (579,377),
 (579,378),
 (579,379),
 (580,435),
 (581,436),
 (581,437),
 (581,438),
 (582,439),
 (582,440),
 (582,441),
 (582,442),
 (582,443),
 (582,444),
 (582,446),
 (583,447),
 (583,346),
 (584,448),
 (584,449),
 (584,450),
 (585,346),
 (586,451),
 (586,452),
 (586,453),
 (587,454),
 (587,425),
 (588,455),
 (588,456),
 (588,457),
 (589,458),
 (589,459),
 (589,460),
 (589,461),
 (590,462),
 (590,463),
 (591,464),
 (592,465),
 (592,466),
 (593,467),
 (593,468),
 (594,469),
 (594,100),
 (594,101),
 (594,102),
 (595,103),
 (596,104),
 (596,105),
 (597,106),
 (598,107),
 (598,108),
 (598,109),
 (599,111),
 (599,113),
 (600,114),
 (600,115),
 (600,116),
 (601,117),
 (601,118),
 (601,119),
 (602,120),
 (603,121),
 (603,122),
 (603,123),
 (603,124),
 (603,125),
 (604,126),
 (604,127),
 (605,128),
 (605,120),
 (606,129),
 (606,130),
 (607,131),
 (608,132),
 (608,133),
 (609,134),
 (610,135),
 (610,137),
 (611,138),
 (612,193),
 (612,139),
 (612,140),
 (612,141),
 (612,142),
 (613,143),
 (614,193),
 (614,139),
 (614,140),
 (614,141),
 (614,142),
 (615,144),
 (616,145),
 (617,146),
 (618,148),
 (619,149),
 (619,150),
 (620,151),
 (620,152),
 (621,153),
 (621,154),
 (621,115),
 (621,155),
 (622,108),
 (623,156),
 (623,157),
 (624,193),
 (624,142),
 (625,158),
 (626,159),
 (626,160),
 (627,161),
 (627,162),
 (628,149),
 (628,163),
 (629,164),
 (629,165),
 (630,166),
 (631,167),
 (632,169),
 (633,169),
 (634,170),
 (634,171),
 (635,172),
 (636,173),
 (636,174),
 (637,175),
 (637,149),
 (638,176),
 (638,177),
 (639,178),
 (639,179),
 (640,180),
 (640,388),
 (641,181),
 (641,182),
 (642,183),
 (642,184),
 (643,185),
 (644,186),
 (645,187),
 (646,188),
 (647,185),
 (648,189),
 (648,190),
 (649,191),
 (650,250),
 (651,158),
 (652,158),
 (653,192),
 (654,193),
 (654,194),
 (655,195),
 (656,196),
 (656,197),
 (657,198),
 (658,199),
 (659,200),
 (659,201),
 (660,202),
 (660,203),
 (660,204),
 (660,205),
 (661,206),
 (661,194),
 (661,193),
 (662,208),
 (663,209),
 (663,212),
 (664,213),
 (664,214),
 (665,158),
 (666,215),
 (666,216),
 (667,179),
 (668,217),
 (668,218),
 (668,219),
 (669,220),
 (669,221),
 (670,222),
 (671,223),
 (672,224),
 (673,395),
 (673,225),
 (674,226),
 (675,227),
 (676,228),
 (676,229),
 (676,230),
 (676,231),
 (677,232),
 (677,233),
 (678,234),
 (678,235),
 (679,236),
 (679,237),
 (679,238),
 (680,239),
 (680,240),
 (680,187),
 (681,241),
 (682,242),
 (683,187),
 (683,243),
 (684,244),
 (685,245),
 (686,215),
 (686,216),
 (687,246),
 (688,247),
 (688,214),
 (689,215),
 (689,216),
 (690,215),
 (690,248),
 (691,249),
 (692,250),
 (692,193),
 (692,162),
 (693,407),
 (693,406),
 (694,251),
 (694,252),
 (694,184),
 (695,253),
 (696,407),
 (696,254),
 (697,255),
 (697,256),
 (698,257),
 (698,258),
 (699,259),
 (700,260),
 (700,182),
 (701,261),
 (701,262),
 (702,263),
 (703,264),
 (704,265),
 (704,266),
 (705,267),
 (705,268),
 (706,269),
 (706,271),
 (707,272),
 (707,184),
 (708,273),
 (708,274),
 (709,275),
 (710,276),
 (710,158),
 (711,277),
 (711,278),
 (712,279),
 (713,280),
 (714,271),
 (715,281),
 (715,282),
 (716,283),
 (717,284),
 (717,285),
 (718,286),
 (718,287),
 (719,288),
 (720,289),
 (721,290),
 (721,291),
 (722,292),
 (722,264),
 (722,293),
 (723,255),
 (724,284),
 (724,285),
 (725,294),
 (725,295),
 (726,296),
 (727,209),
 (728,297),
 (728,298),
 (729,265),
 (729,266),
 (730,275),
 (731,299),
 (732,300),
 (733,301),
 (734,302),
 (734,303),
 (735,394),
 (735,395),
 (735,304),
 (736,305),
 (736,415),
 (736,306),
 (737,348),
 (738,307),
 (739,308),
 (740,251),
 (740,309),
 (741,310),
 (742,311),
 (743,312),
 (744,313),
 (744,233),
 (745,314),
 (745,315),
 (745,316),
 (746,209),
 (747,317),
 (747,182),
 (748,200),
 (748,319),
 (749,320),
 (749,321),
 (749,322),
 (749,323),
 (750,307),
 (751,324),
 (751,325),
 (752,326),
 (753,327),
 (754,328),
 (755,329),
 (755,330),
 (756,308),
 (757,331),
 (758,300),
 (759,332),
 (760,333),
 (761,334),
 (761,335),
 (762,336),
 (763,337),
 (764,338),
 (764,339),
 (765,340),
 (765,341),
 (766,342),
 (767,311),
 (768,343),
 (768,344),
 (769,345),
 (770,346),
 (770,347),
 (771,348),
 (771,349),
 (772,350),
 (773,251),
 (773,351),
 (774,352),
 (774,343),
 (775,353),
 (776,265),
 (777,354),
 (777,297),
 (778,158),
 (779,355),
 (779,356),
 (780,357),
 (780,358),
 (780,359),
 (781,360),
 (782,361),
 (782,363),
 (783,364),
 (783,365),
 (784,366),
 (785,367),
 (786,368),
 (786,369),
 (786,370),
 (787,345),
 (787,371),
 (788,274),
 (788,435),
 (788,372),
 (789,373),
 (789,374),
 (789,375),
 (790,376),
 (790,325),
 (791,377),
 (791,378),
 (792,379),
 (792,380),
 (793,381),
 (793,382),
 (794,383),
 (795,340),
 (795,384),
 (795,385),
 (795,386),
 (796,387),
 (796,307),
 (797,388),
 (797,389),
 (798,390),
 (799,391),
 (800,392),
 (801,393),
 (802,394),
 (802,395),
 (803,396),
 (803,397),
 (803,399),
 (804,400),
 (805,401),
 (805,402),
 (806,403),
 (806,404),
 (806,405),
 (807,406),
 (808,407),
 (809,408),
 (809,409),
 (809,410),
 (809,411),
 (810,413),
 (810,414),
 (811,400),
 (811,415),
 (812,416),
 (813,417),
 (814,418),
 (814,419),
 (815,420),
 (816,421),
 (816,422),
 (816,423),
 (817,424),
 (817,425),
 (818,426),
 (818,435),
 (819,427),
 (819,428),
 (820,429),
 (821,430),
 (822,431),
 (822,403),
 (823,365),
 (823,432),
 (824,406),
 (824,433),
 (825,434),
 (825,388),
 (825,389),
 (825,435),
 (826,436),
 (826,437),
 (827,438),
 (828,439),
 (828,254),
 (829,440),
 (830,441),
 (830,420),
 (831,442),
 (831,443),
 (832,444),
 (832,446),
 (832,447),
 (833,448),
 (834,449),
 (835,450),
 (835,451),
 (835,452),
 (836,453),
 (836,454),
 (836,455),
 (836,456),
 (837,457),
 (837,458),
 (837,459),
 (837,460),
 (838,461),
 (839,462),
 (839,463),
 (840,464),
 (840,465),
 (841,466),
 (841,467),
 (842,468),
 (842,469),
 (842,100),
 (843,101),
 (843,102),
 (843,103),
 (844,104),
 (844,105),
 (844,106),
 (845,107),
 (845,108),
 (845,109),
 (846,111),
 (847,113),
 (847,114),
 (847,115),
 (848,116),
 (849,117),
 (849,118),
 (850,119),
 (850,120),
 (850,121),
 (851,122),
 (851,123),
 (852,124),
 (853,125),
 (853,323),
 (854,126),
 (855,127),
 (855,128),
 (855,129),
 (855,130),
 (856,131),
 (857,132),
 (858,133),
 (858,134),
 (859,135),
 (859,137),
 (859,138),
 (860,139),
 (860,140),
 (861,141),
 (861,142),
 (862,143),
 (862,144),
 (863,145),
 (864,146),
 (865,148),
 (865,149),
 (866,150),
 (867,151),
 (867,152),
 (868,153),
 (868,154),
 (869,155),
 (2947,295),
 (2948,336),
 (2949,337),
 (2950,296),
 (2951,338),
 (2951,339),
 (2952,340),
 (2953,341),
 (2954,342),
 (2955,343),
 (2956,344),
 (2956,345),
 (2957,346),
 (2958,347),
 (2959,348),
 (2959,349),
 (2960,167),
 (2961,350),
 (2961,306),
 (2961,414),
 (2962,351),
 (2962,368),
 (2963,352),
 (2964,353),
 (2965,354),
 (2966,186),
 (2967,140),
 (2967,355),
 (2967,356),
 (2968,357),
 (2968,358),
 (2969,359),
 (2970,360),
 (2971,361),
 (2972,363),
 (2972,310),
 (2973,364),
 (2973,133),
 (2973,435),
 (2973,365),
 (2974,366),
 (2975,367),
 (2975,368),
 (2976,369),
 (2976,370),
 (2977,371),
 (2977,372),
 (2977,284),
 (2978,266),
 (2978,373),
 (2979,374),
 (2980,375),
 (2980,376),
 (2981,140),
 (2981,128),
 (2982,377),
 (2982,182),
 (2983,378),
 (2983,379),
 (2984,380),
 (2984,381),
 (2985,382),
 (2985,383),
 (2985,291),
 (2986,223),
 (2987,384),
 (2988,385),
 (2989,255),
 (2990,386),
 (2990,387),
 (2991,388),
 (2992,389),
 (2993,258),
 (2994,416),
 (2995,153),
 (2995,367),
 (2996,122),
 (2996,256),
 (2996,390),
 (2997,391),
 (2998,120),
 (2998,392),
 (2999,407),
 (2999,393),
 (3000,159),
 (3001,394),
 (3001,395),
 (3002,396),
 (3002,397),
 (3002,399),
 (3003,400),
 (3004,401),
 (3004,402),
 (3005,403),
 (3005,135),
 (3006,404),
 (3007,405),
 (3008,260),
 (3009,137),
 (3009,406),
 (3010,407),
 (3010,408),
 (3010,409),
 (3011,367),
 (3011,410),
 (3011,411),
 (3012,413),
 (3012,414),
 (3013,415),
 (3013,416),
 (3014,417),
 (3015,418),
 (3015,419),
 (3016,420),
 (3016,421),
 (3016,422),
 (3017,423),
 (3018,424),
 (3018,425),
 (3019,255),
 (3019,428),
 (3020,335),
 (3021,426),
 (3021,427),
 (3022,428),
 (3022,429),
 (3022,430),
 (3023,431),
 (3024,432),
 (3025,427),
 (3025,428),
 (3026,433),
 (3026,434),
 (3027,236),
 (3028,186),
 (3028,414),
 (3029,435),
 (3029,436),
 (3030,437),
 (3031,281),
 (3031,214),
 (3032,438),
 (3033,439),
 (3034,440),
 (3035,335),
 (3035,126),
 (3036,441),
 (3036,442),
 (3036,443),
 (3037,444),
 (3037,446),
 (3038,447),
 (3039,287),
 (3040,448),
 (3041,449),
 (3041,450),
 (3042,451),
 (3043,452),
 (3043,358),
 (3044,453),
 (3045,454),
 (3046,455),
 (3046,321),
 (3047,129),
 (3048,456),
 (3048,184),
 (3049,457),
 (3050,458),
 (3050,459),
 (3050,410),
 (3050,414),
 (3050,460),
 (3050,461),
 (3051,148),
 (3052,462),
 (3052,166),
 (3052,444),
 (3053,463),
 (3053,464),
 (3054,162),
 (3055,465),
 (3056,466),
 (3057,467),
 (3057,129),
 (3057,145),
 (3058,468),
 (3059,469),
 (3060,100),
 (3060,101),
 (3061,322),
 (3062,306),
 (3062,102),
 (3063,103),
 (3063,104),
 (3064,105),
 (3065,106),
 (3066,107),
 (3066,416),
 (3067,108),
 (3068,109),
 (3068,417),
 (3069,114),
 (3069,443),
 (3069,405),
 (3070,263),
 (3071,111),
 (3071,124),
 (3072,313),
 (3073,113),
 (3073,114),
 (3074,115),
 (3074,116),
 (3075,305),
 (3076,117),
 (3076,118),
 (3076,195),
 (3077,428),
 (3078,233),
 (3078,119),
 (3078,120),
 (3079,187),
 (3080,121),
 (3080,457),
 (3081,366),
 (3081,367),
 (3082,122),
 (3082,123),
 (3083,204),
 (3084,124),
 (3084,125),
 (3085,126),
 (3085,127),
 (3086,317),
 (3087,128),
 (3087,263),
 (3088,129),
 (3089,130),
 (3090,131),
 (3090,140),
 (3091,253),
 (3091,132),
 (3091,133),
 (3091,134),
 (3092,367),
 (3092,135),
 (3093,137),
 (3094,463),
 (3094,464),
 (3095,138),
 (3096,420),
 (3096,139),
 (3097,140),
 (3098,141),
 (3098,142),
 (3099,143),
 (3100,288),
 (3101,144),
 (3102,145),
 (3103,146),
 (3104,144),
 (3104,208),
 (3105,148),
 (3106,201),
 (3107,148),
 (3107,149),
 (3108,150),
 (3108,151),
 (3109,152),
 (3110,153),
 (3110,193),
 (3111,154),
 (3112,155),
 (3113,156),
 (3114,157),
 (3114,274),
 (3115,158),
 (3115,128),
 (3116,159),
 (3117,155),
 (3117,160),
 (3118,161),
 (3118,162),
 (3118,163),
 (3119,164),
 (3120,432),
 (3121,165),
 (3121,439),
 (3122,166),
 (3122,449),
 (3123,302),
 (3124,167),
 (3125,169),
 (3126,169),
 (3126,395),
 (3127,170),
 (3128,401),
 (3128,171),
 (3128,172),
 (3129,241),
 (3129,173),
 (3130,174),
 (3130,175),
 (3131,176),
 (3132,177),
 (3133,178),
 (3133,179),
 (3134,180),
 (3134,166),
 (3134,181),
 (3135,182),
 (3135,183),
 (3136,184),
 (3137,185),
 (3138,186),
 (3139,187),
 (3140,188),
 (3141,189),
 (3141,190),
 (3142,191),
 (3143,192),
 (3144,193),
 (3145,194),
 (3145,195),
 (3146,196),
 (3147,277),
 (3147,197),
 (3148,198),
 (3149,199),
 (3149,200),
 (3150,201),
 (3151,202),
 (3152,187),
 (3153,203),
 (3154,204),
 (3154,205),
 (3154,206),
 (3155,208),
 (3156,209),
 (3157,379),
 (3158,212),
 (3159,151),
 (3159,213),
 (3160,214),
 (3160,176),
 (3161,215),
 (3162,216),
 (3162,217),
 (3163,218),
 (3164,137),
 (3164,219),
 (3165,220),
 (3165,221),
 (3166,222),
 (3167,223),
 (3168,224),
 (3169,225),
 (3170,226),
 (3170,227),
 (3171,228),
 (3171,229),
 (3172,230),
 (3172,231),
 (3173,232),
 (3174,233),
 (3175,234),
 (3176,235),
 (3177,151),
 (3178,236),
 (3179,237),
 (3179,238),
 (3180,239),
 (3180,240),
 (3181,241),
 (3182,242),
 (3183,243),
 (3183,244),
 (3184,245),
 (3185,246),
 (3186,247),
 (3187,248),
 (3188,249),
 (3189,250),
 (3190,251),
 (3191,252),
 (3192,253),
 (3192,254),
 (3193,255),
 (3194,256),
 (3194,257),
 (3195,258),
 (3196,259),
 (3197,260),
 (3198,261),
 (3199,262),
 (3199,263),
 (3200,264),
 (3201,215),
 (3202,265),
 (3203,266),
 (3204,267),
 (3205,268),
 (3205,269),
 (3206,271),
 (3207,272),
 (3208,273),
 (3208,274),
 (3209,275),
 (3210,276),
 (3211,150),
 (3212,277),
 (3213,278),
 (3213,279),
 (3214,280),
 (3215,151),
 (3215,281),
 (3216,282),
 (3217,283),
 (3218,225),
 (3219,284),
 (3219,285),
 (3220,286),
 (3221,287),
 (3221,288),
 (3221,289),
 (3222,290),
 (3222,291),
 (3223,292),
 (3223,293),
 (3223,291),
 (3224,294),
 (3225,295),
 (3226,296),
 (3227,297),
 (3227,298),
 (3228,299),
 (3229,300),
 (3229,301),
 (3229,302),
 (3230,303),
 (3230,304),
 (3230,305),
 (3230,306),
 (3231,267),
 (3232,307),
 (3233,308),
 (3234,309),
 (3234,248),
 (3234,310),
 (3234,215),
 (3235,151),
 (3235,311),
 (3236,312),
 (3237,251),
 (3238,313),
 (3238,314),
 (3239,315),
 (3240,316),
 (3240,317),
 (3241,319),
 (3241,320),
 (3242,321),
 (3243,282),
 (3244,322),
 (3245,323),
 (3246,324),
 (3247,325),
 (3248,131),
 (3249,113),
 (3250,326),
 (3251,241),
 (3251,327),
 (3252,328),
 (3252,329),
 (3253,179),
 (3253,330),
 (3254,331),
 (3255,332),
 (3256,333),
 (3257,334),
 (3257,335),
 (3258,336),
 (3258,337),
 (3259,338),
 (3260,151),
 (3260,311),
 (3261,339),
 (3262,340),
 (3263,341),
 (3264,342),
 (3265,343),
 (3266,344),
 (3267,345),
 (3267,346),
 (3268,347),
 (3269,348),
 (3270,124),
 (3270,349),
 (3271,350),
 (3272,246),
 (3273,351),
 (3274,196),
 (3274,352),
 (3274,353),
 (3275,354),
 (3275,355),
 (3276,356),
 (3277,357),
 (3278,151),
 (3279,358),
 (3279,311),
 (3280,338),
 (3281,359),
 (3282,360),
 (3283,361),
 (3284,138),
 (3285,363),
 (3286,364),
 (3286,365),
 (3286,366),
 (3287,367),
 (3288,341),
 (3288,368),
 (3289,369),
 (3290,370),
 (3291,371),
 (3291,372),
 (3292,373),
 (3293,423),
 (3294,374),
 (3295,375),
 (3295,376),
 (3296,377),
 (3297,151),
 (3297,151),
 (3297,321),
 (3298,378),
 (3299,323),
 (3300,379),
 (3301,255),
 (3301,380),
 (3302,381),
 (3302,382),
 (3303,383),
 (3304,384),
 (3305,385),
 (3306,297),
 (3307,386),
 (3308,387),
 (3309,388),
 (3310,389),
 (3311,390),
 (3312,391),
 (3313,392),
 (3314,151),
 (3314,151),
 (3314,321),
 (3315,393),
 (3316,394),
 (3317,379),
 (3318,395),
 (3319,396),
 (3320,397),
 (3321,399),
 (3322,400),
 (3323,401),
 (3324,402),
 (3324,403),
 (3325,404),
 (3325,405),
 (3326,395),
 (3326,117),
 (3326,406),
 (3327,407),
 (3327,408),
 (3328,157),
 (3328,409),
 (3329,208),
 (3330,321),
 (3331,410),
 (3332,247),
 (3332,411),
 (3333,413),
 (3333,150),
 (3334,414),
 (3334,415),
 (3335,208),
 (3336,287),
 (3336,288),
 (3336,289),
 (3336,416),
 (3337,417),
 (3338,418),
 (3339,419),
 (3340,336),
 (3340,337),
 (3341,420),
 (3342,421),
 (3342,422),
 (3343,423),
 (3343,375),
 (3343,376),
 (3344,424),
 (3345,215),
 (3346,425),
 (3347,119),
 (3347,426),
 (3348,427),
 (3349,428),
 (3349,429),
 (3350,208),
 (3350,430),
 (3351,431),
 (3351,432),
 (3352,433),
 (3352,434),
 (3353,435),
 (3354,436),
 (3355,437),
 (3356,438),
 (3356,439),
 (3356,440),
 (3357,441),
 (3358,442),
 (3358,443),
 (3358,444),
 (3359,446),
 (3360,447),
 (3360,448),
 (3361,449),
 (3362,420),
 (3363,450),
 (3364,451),
 (3364,452),
 (3365,453),
 (3366,454),
 (3367,455),
 (3368,456),
 (3368,457),
 (3369,410),
 (3370,340),
 (3371,458),
 (3372,459),
 (3373,410),
 (3373,460),
 (3374,375),
 (3374,376),
 (3375,461),
 (3376,462),
 (3377,463),
 (3377,464),
 (3378,151),
 (3378,321),
 (3379,465),
 (3379,466),
 (3380,467),
 (3380,355),
 (3381,161),
 (3381,468),
 (3382,469),
 (3383,100),
 (3384,101),
 (3384,323),
 (3385,102),
 (3385,103),
 (3385,104),
 (3386,105),
 (3387,106),
 (3388,107),
 (3388,108),
 (3389,109),
 (3390,321),
 (3391,111),
 (3391,113),
 (3392,114),
 (3393,115),
 (3394,116),
 (3395,119),
 (3396,345),
 (3397,117),
 (3397,421),
 (3398,118),
 (3399,119),
 (3399,120),
 (3399,121),
 (3399,122),
 (3400,123),
 (3401,340),
 (3402,145),
 (3403,397),
 (3404,124),
 (3404,125),
 (3405,356),
 (3406,410),
 (3407,456),
 (3407,457),
 (3408,437),
 (3409,208),
 (3409,126),
 (3410,127),
 (3411,280),
 (3412,128),
 (3412,129),
 (3413,130),
 (3414,131),
 (3415,109),
 (3416,132),
 (3417,170),
 (3418,133),
 (3419,134),
 (3420,420),
 (3421,135),
 (3421,137),
 (3422,138),
 (3423,139),
 (3424,140),
 (3425,141),
 (3426,109),
 (3427,356),
 (3428,142),
 (3428,143),
 (3429,127),
 (3430,433),
 (3431,144),
 (3431,145),
 (3432,146),
 (3433,420),
 (3434,148),
 (3435,149),
 (3436,150),
 (3437,151),
 (3438,152),
 (3439,153),
 (3440,457),
 (3441,154),
 (3442,192),
 (3442,155),
 (3443,447),
 (3444,156),
 (3445,157),
 (3446,158),
 (3447,138),
 (3448,159),
 (3449,119),
 (3450,151),
 (3450,154),
 (3451,160),
 (3452,111),
 (3453,321),
 (3454,125),
 (3454,161),
 (3455,161),
 (3455,274),
 (3456,162),
 (3456,163),
 (3457,164),
 (3457,165),
 (3457,166),
 (3458,167),
 (3459,340),
 (3459,308),
 (3460,340),
 (3460,169),
 (3460,170),
 (3461,171),
 (3462,124),
 (3463,438),
 (3464,439),
 (3465,172),
 (3466,179),
 (3467,173),
 (3468,436),
 (3468,174),
 (3469,175),
 (3470,176),
 (3470,177),
 (3471,178),
 (3472,179),
 (3473,149),
 (3474,156),
 (3475,180),
 (3476,181),
 (3477,182),
 (3478,183),
 (3479,184),
 (3479,185),
 (3480,186),
 (3481,160),
 (3482,390),
 (3483,187),
 (3483,188),
 (3484,319),
 (3484,189),
 (3485,169),
 (3485,340),
 (3485,131),
 (3485,267),
 (3486,190),
 (3487,191),
 (3488,192),
 (3489,193),
 (3489,194),
 (3490,289),
 (3491,401),
 (3492,195),
 (3492,333),
 (3493,208),
 (3494,196),
 (3494,186),
 (3494,396),
 (3495,131),
 (3495,197),
 (3496,198),
 (3496,274),
 (3497,199),
 (3498,200),
 (3498,201),
 (3499,202),
 (3500,203),
 (3501,204),
 (3501,205),
 (3502,206),
 (3503,208),
 (3504,208),
 (3505,209),
 (3505,212),
 (3506,117),
 (3507,213),
 (3508,441),
 (3508,457),
 (3509,120),
 (3510,119),
 (3511,113),
 (3512,214),
 (3513,379),
 (3514,215),
 (3515,216),
 (3515,217),
 (3516,218),
 (3517,219),
 (3517,220),
 (3518,109),
 (3518,221),
 (3518,464),
 (3519,222),
 (3519,223),
 (3520,224),
 (3520,225),
 (3521,226),
 (3522,117),
 (3522,227),
 (3523,228),
 (3524,321),
 (3524,229),
 (3525,230),
 (3526,231),
 (3526,232),
 (3527,364),
 (3527,198),
 (3528,360),
 (3528,233),
 (3529,234),
 (3529,235),
 (3530,234),
 (3530,235),
 (3531,236),
 (3531,237),
 (3532,238),
 (3533,297),
 (3534,239),
 (3535,279),
 (3536,240),
 (3537,241),
 (3537,242),
 (3538,243),
 (3539,244),
 (3539,245),
 (3539,246),
 (3540,247),
 (3540,248),
 (3541,249),
 (3542,380),
 (3543,250),
 (3544,251),
 (3545,410),
 (3545,456),
 (3546,117),
 (3547,117),
 (3547,421),
 (3548,423),
 (3549,252),
 (3550,253),
 (3551,254),
 (3552,255),
 (3553,256),
 (3554,257),
 (3554,258),
 (3555,259),
 (3556,260),
 (3557,159),
 (3558,159),
 (3559,261),
 (3559,262),
 (3560,105),
 (3561,119),
 (3562,296),
 (3562,263),
 (3562,264),
 (3563,235),
 (3564,265),
 (3564,266),
 (3564,267),
 (3565,268),
 (3566,269),
 (3566,271),
 (3567,272),
 (3567,209),
 (3568,248),
 (3568,273),
 (3569,242),
 (3570,208),
 (3571,274),
 (3572,311),
 (3573,233),
 (3574,275),
 (3575,276),
 (3575,151),
 (3576,277),
 (3577,278),
 (3577,279),
 (3577,457),
 (3578,280),
 (3578,125),
 (3579,281),
 (3579,395),
 (3580,282),
 (3580,283),
 (3581,111),
 (3582,284),
 (3582,285),
 (3583,321),
 (3584,118),
 (3585,220),
 (3586,140),
 (3587,286),
 (3587,287),
 (3588,148),
 (3589,247),
 (3589,216),
 (3589,288),
 (3590,349),
 (3591,289),
 (3592,289),
 (3593,290),
 (3593,291),
 (3594,292),
 (3595,233),
 (3595,360),
 (3595,306),
 (3596,293),
 (3596,169),
 (3597,294),
 (3598,208),
 (3599,295),
 (3599,296),
 (3600,233),
 (3600,297),
 (3601,457),
 (3602,298),
 (3602,299),
 (3603,150),
 (3603,280),
 (3603,321),
 (3604,415),
 (3605,300),
 (3606,193),
 (3606,301),
 (3607,441),
 (3608,302),
 (3609,303),
 (3609,321),
 (3610,281),
 (3611,304),
 (3611,305),
 (3612,306),
 (3612,307),
 (3613,308),
 (3614,425),
 (3615,309),
 (3615,326),
 (3616,310),
 (3616,311),
 (3617,172),
 (3618,312),
 (3618,340),
 (3619,433),
 (3619,313),
 (3620,314),
 (3621,315),
 (3622,316),
 (3623,317),
 (3624,126),
 (3625,319),
 (3625,320),
 (3626,321),
 (3627,300),
 (3628,322),
 (3628,323),
 (3629,304),
 (3629,305),
 (3630,303),
 (3630,321),
 (3631,324),
 (3632,119),
 (3633,325),
 (3633,326),
 (3634,327),
 (3635,328),
 (3635,329),
 (3636,330),
 (3637,331),
 (3637,332),
 (3638,316),
 (3639,333),
 (3640,334),
 (3641,335),
 (3642,304),
 (3643,336),
 (3643,337),
 (3644,338),
 (3644,339),
 (3645,340),
 (3646,341),
 (3647,159),
 (3648,342),
 (3648,343),
 (3649,344),
 (3649,286),
 (3650,345),
 (3650,346),
 (3651,244),
 (3651,245),
 (3651,347),
 (3652,348),
 (3652,349),
 (3653,350),
 (3653,351),
 (3653,216),
 (3654,352),
 (3655,289),
 (3656,353),
 (3657,388),
 (3658,354),
 (3659,135),
 (3659,355),
 (3659,356),
 (3660,161),
 (3660,357),
 (3661,358),
 (3661,326),
 (3662,226),
 (3663,359),
 (3664,360),
 (3664,361),
 (3665,363),
 (3666,289),
 (3667,364),
 (3668,382),
 (3669,365),
 (3669,366),
 (3670,367),
 (3670,368),
 (3671,369),
 (3671,436),
 (3672,370),
 (3673,257),
 (3674,371),
 (3675,372),
 (3675,373),
 (3676,372),
 (3676,373),
 (3677,374),
 (3677,375),
 (3677,376),
 (3677,377),
 (3678,378),
 (3678,390),
 (3679,379),
 (3679,380),
 (3680,420),
 (3680,421),
 (3681,381),
 (3681,296),
 (3682,382),
 (3682,383),
 (3683,384),
 (3684,385),
 (3685,213),
 (3686,386),
 (3686,151),
 (3687,387),
 (3687,388),
 (3688,389),
 (3688,390),
 (3689,391),
 (3690,392),
 (3690,393),
 (3691,157),
 (3692,372),
 (3692,394),
 (3693,395),
 (3693,396),
 (3694,397),
 (3695,399),
 (3695,400),
 (3695,287),
 (3695,401),
 (3696,402),
 (3697,403),
 (3697,340),
 (3698,404),
 (3698,248),
 (3699,405),
 (3699,406),
 (3699,407),
 (3700,408),
 (3701,199),
 (3701,457),
 (3702,409),
 (3702,410),
 (3702,411),
 (3703,413),
 (3704,326),
 (3704,414),
 (3705,356),
 (3706,415),
 (3706,297),
 (3707,335),
 (3708,358),
 (3709,416),
 (3710,402),
 (3711,248),
 (3711,273),
 (3712,380),
 (3713,417),
 (3713,418),
 (3714,419),
 (3714,420),
 (3715,421),
 (3715,116),
 (3716,422),
 (3716,423),
 (3717,154),
 (3717,118),
 (3718,424),
 (3719,425),
 (3720,426),
 (3721,427),
 (3722,428),
 (3722,429),
 (3723,173),
 (3724,208),
 (3725,218),
 (3725,421),
 (3726,321),
 (3727,441),
 (3728,430),
 (3728,431),
 (3729,344),
 (3730,432),
 (3731,433),
 (3732,145),
 (3732,434),
 (3733,435),
 (3733,436),
 (3734,197),
 (3735,437),
 (3735,438),
 (3736,327),
 (3736,390),
 (3737,394),
 (3738,439),
 (3739,440),
 (3739,265),
 (3740,310),
 (3741,364),
 (3742,441),
 (3742,381),
 (3743,330),
 (3744,174),
 (3744,314),
 (3745,442),
 (3745,443),
 (3745,247),
 (3746,229),
 (3747,444),
 (3748,446),
 (3749,438),
 (3749,447),
 (3749,448),
 (3749,449),
 (3750,127),
 (3751,144),
 (3751,450),
 (3752,424),
 (3753,323),
 (3753,451),
 (3753,452),
 (3753,453),
 (3754,356),
 (3755,214),
 (3756,338),
 (3757,454),
 (3757,263),
 (3757,455),
 (3758,349),
 (3759,391),
 (3759,456),
 (3760,457),
 (3760,458),
 (3761,459),
 (3761,460),
 (3762,461),
 (3763,462),
 (3763,463),
 (3763,464),
 (3764,465),
 (3765,466),
 (3765,326),
 (3766,372),
 (3767,415),
 (3767,467),
 (3768,218),
 (3768,148),
 (3768,468),
 (3769,215),
 (3770,469),
 (3771,439),
 (3772,100),
 (3773,101),
 (3774,340),
 (3775,102),
 (3775,179),
 (3775,103),
 (3776,104),
 (3777,105),
 (3778,106),
 (3778,346),
 (3779,278),
 (3779,451),
 (3779,457),
 (3780,326),
 (3780,298),
 (3781,107),
 (3782,108),
 (3783,443),
 (3783,109),
 (3784,381),
 (3785,111),
 (3786,386),
 (3787,224),
 (3787,119),
 (3788,113),
 (3789,114),
 (3789,115),
 (3789,116),
 (3790,117),
 (3790,340),
 (3791,118),
 (3792,217),
 (3792,119),
 (3793,451),
 (3793,326),
 (3794,120),
 (3795,121),
 (3795,464),
 (3796,122),
 (3796,123),
 (3797,124),
 (3797,125),
 (3798,367),
 (3799,126),
 (3800,385),
 (3801,218),
 (3802,127),
 (3803,224),
 (3803,353),
 (3803,128),
 (3804,129),
 (3804,130),
 (3805,131),
 (3806,132),
 (3807,372),
 (3807,394),
 (3808,248),
 (3808,133),
 (3809,134),
 (3810,135),
 (3811,137),
 (3812,138),
 (3812,139),
 (3813,265),
 (3813,140),
 (3814,141),
 (3815,346),
 (3815,436),
 (3816,142),
 (3816,344),
 (3817,143),
 (3817,144),
 (3818,202),
 (3819,247),
 (3820,101),
 (3821,443),
 (3821,109),
 (3822,145),
 (3823,304),
 (3824,278),
 (3824,254),
 (3825,146),
 (3825,441),
 (3826,148),
 (3826,149),
 (3827,150),
 (3827,314),
 (3828,405),
 (3829,394),
 (3829,151),
 (3830,292),
 (3830,152),
 (3831,153),
 (3832,151),
 (3832,214),
 (3833,154),
 (3834,155),
 (3834,121),
 (3835,156),
 (3835,157),
 (3835,421),
 (3836,158),
 (3837,151),
 (3837,394),
 (3838,159),
 (3838,135),
 (3839,265),
 (3840,104),
 (3841,247),
 (3841,160),
 (3842,161),
 (3842,162),
 (3842,463),
 (3843,163),
 (3843,164),
 (3844,304),
 (3845,165),
 (3846,166),
 (3846,167),
 (3846,441),
 (3847,314),
 (3848,169),
 (3848,170),
 (3848,171),
 (3848,172),
 (3849,173),
 (3850,174),
 (3851,278),
 (3851,254),
 (3851,457),
 (3852,175),
 (3853,176),
 (3853,177),
 (3854,178),
 (3854,179),
 (3855,321),
 (3855,365),
 (3856,302),
 (3857,144),
 (3858,447),
 (3858,180),
 (3858,181),
 (3859,108),
 (3860,415),
 (3860,467),
 (3861,182),
 (3862,183),
 (3863,184),
 (3863,185),
 (3864,154),
 (3864,327),
 (3864,186),
 (3865,157),
 (3865,187),
 (3866,188),
 (3866,333),
 (3867,189),
 (3867,127),
 (3867,190),
 (3868,191),
 (3868,397),
 (3869,192),
 (3869,193),
 (3870,194),
 (3870,195),
 (3871,196),
 (3871,441),
 (3872,197),
 (3872,127),
 (3873,161),
 (3873,198),
 (3874,199),
 (3874,200),
 (3875,201),
 (3876,202),
 (3877,265),
 (3878,300),
 (3878,218),
 (3879,366),
 (3879,203),
 (3880,204),
 (3881,463),
 (3881,205),
 (3881,206),
 (3882,224),
 (3883,214),
 (3884,271),
 (3884,248),
 (3885,224),
 (3885,353),
 (3886,425),
 (3887,208),
 (3888,209),
 (3888,212),
 (3889,213),
 (3890,214),
 (3891,215),
 (3892,361),
 (3893,442),
 (3893,130),
 (3894,216),
 (3895,407),
 (3896,191),
 (3896,217),
 (3897,192),
 (3897,218),
 (3897,219),
 (3897,220),
 (3898,221),
 (3898,222),
 (3899,223),
 (3899,224),
 (3900,151),
 (3900,394),
 (3901,137),
 (3901,448),
 (3902,225),
 (3903,415),
 (3904,250),
 (3905,392),
 (3906,226),
 (3906,280),
 (3907,298),
 (3908,166),
 (3909,242),
 (3910,224),
 (3910,119),
 (3910,354),
 (3911,227),
 (3912,218),
 (3912,421),
 (3913,228),
 (3914,229),
 (3915,424),
 (3916,230),
 (3916,231),
 (3917,232),
 (3918,157),
 (3918,187),
 (3919,280),
 (3920,235),
 (3920,242),
 (3921,233),
 (3921,234),
 (3922,284),
 (3922,285),
 (3923,235),
 (3923,179),
 (3924,236),
 (3925,305),
 (3925,237),
 (3926,439),
 (3927,324),
 (3928,194),
 (3928,326),
 (3929,238),
 (3929,239),
 (3930,135),
 (3931,199),
 (3932,240),
 (3933,443),
 (3933,109),
 (3934,142),
 (3935,250),
 (3935,399),
 (3935,411),
 (3936,241),
 (3936,126),
 (3937,242),
 (3937,218),
 (3937,243),
 (3937,244),
 (3938,291),
 (3939,304),
 (3939,245),
 (3940,248),
 (3940,246),
 (3940,249),
 (3941,339),
 (3941,218),
 (3942,250),
 (3943,357),
 (3943,247),
 (3944,248),
 (3945,249),
 (3946,250),
 (3946,441),
 (3947,441),
 (3948,251),
 (3948,252),
 (3949,253),
 (3950,254),
 (3951,255),
 (3952,263),
 (3953,130),
 (3954,137),
 (3954,256),
 (3955,196),
 (3955,197),
 (3956,257),
 (3956,258),
 (3956,259),
 (3957,260),
 (3957,261),
 (3958,405),
 (3959,368),
 (3959,262),
 (3960,296),
 (3960,263),
 (3961,264),
 (3962,265),
 (3962,266),
 (3963,319),
 (3964,206),
 (3964,326),
 (3965,267),
 (3966,126),
 (3966,145),
 (3967,268),
 (3967,367),
 (3968,269),
 (3969,421),
 (3969,271),
 (3970,127),
 (3971,373),
 (3971,232),
 (3972,384),
 (3973,321),
 (3974,183),
 (3975,204),
 (3976,142),
 (3977,272),
 (3978,273),
 (3979,209),
 (3979,134),
 (3980,418),
 (3981,231),
 (3982,231),
 (3983,274),
 (3983,275),
 (3983,276),
 (3984,425),
 (3985,277),
 (3986,278),
 (3987,166),
 (3988,173),
 (3988,444),
 (3989,220),
 (3989,415),
 (3990,279),
 (3991,280),
 (3991,281),
 (3991,282),
 (3992,443),
 (3993,405),
 (3994,343),
 (3994,283),
 (3995,321),
 (3996,145),
 (3997,284),
 (3997,129),
 (3997,130),
 (3997,285),
 (3998,245),
 (3999,304),
 (3999,340),
 (3999,286),
 (3999,287),
 (4000,360),
 (4000,233),
 (4001,288),
 (4002,289),
 (4003,216),
 (4004,187),
 (4005,333),
 (4005,290),
 (4006,291),
 (4006,394),
 (4007,292),
 (4008,293),
 (4009,294),
 (4009,295),
 (4010,317),
 (4010,248),
 (4011,366),
 (4011,321),
 (4011,235),
 (4012,155),
 (4012,296),
 (4012,271),
 (4013,297),
 (4014,298),
 (4014,299),
 (4014,366),
 (4015,300),
 (4015,464),
 (4016,301),
 (4016,441),
 (4017,298),
 (4018,302),
 (4019,303),
 (4019,304),
 (4020,292),
 (4021,305),
 (4021,306),
 (4021,307),
 (4022,105),
 (4023,308),
 (4024,309),
 (4025,310),
 (4026,311),
 (4027,183),
 (4027,304),
 (4028,312),
 (4028,313),
 (4029,115),
 (4030,314),
 (4030,315),
 (4031,316),
 (4031,317),
 (4032,319),
 (4032,420),
 (4033,320),
 (4034,321),
 (4034,322),
 (4035,317),
 (4036,323),
 (4036,263),
 (4037,324),
 (4037,235),
 (4037,239),
 (4038,155),
 (4039,355),
 (4039,381),
 (4039,325),
 (4040,343),
 (4040,326),
 (4041,327),
 (4041,328),
 (4041,329),
 (4042,330),
 (4042,237),
 (4043,331),
 (4043,292),
 (4043,332),
 (4044,405),
 (4044,352),
 (4045,394),
 (4045,333),
 (4046,441),
 (4046,334),
 (4047,335),
 (4047,336),
 (4047,274),
 (4048,209),
 (4049,337),
 (4049,338),
 (4049,339),
 (4049,340),
 (4050,308),
 (4050,443),
 (4051,317),
 (4051,237),
 (4052,280),
 (4053,145),
 (4053,144),
 (4054,341),
 (4055,342),
 (4055,343),
 (4056,344),
 (4057,250),
 (4057,441),
 (4057,229),
 (4058,345),
 (4058,133),
 (4059,203),
 (4060,346),
 (4061,364),
 (4062,347),
 (4063,257),
 (4063,155),
 (4064,348),
 (4064,349),
 (4065,399),
 (4065,350),
 (4065,257),
 (4066,351),
 (4066,352),
 (4067,353),
 (4068,309),
 (4069,354),
 (4069,232),
 (4070,295),
 (4070,355),
 (4071,298),
 (4071,356),
 (4071,365),
 (4072,137),
 (4073,309),
 (4074,357),
 (4074,226),
 (4075,282),
 (4075,183),
 (4076,459),
 (4077,358),
 (4078,359),
 (4078,360),
 (4079,361),
 (4080,355),
 (4080,325),
 (4081,262),
 (4082,363),
 (4083,364),
 (4083,365),
 (4083,366),
 (4083,367),
 (4084,224),
 (4084,292),
 (4085,368),
 (4086,374),
 (4087,369),
 (4087,370),
 (4088,360),
 (4089,308),
 (4089,371),
 (4089,372),
 (4089,217),
 (4090,333),
 (4090,371),
 (4091,232),
 (4091,373),
 (4092,323),
 (4092,374),
 (4093,467),
 (4094,375),
 (4094,376),
 (4095,339),
 (4095,218),
 (4096,220),
 (4096,415),
 (4097,254),
 (4097,280),
 (4098,229),
 (4099,229),
 (4100,292),
 (4101,312),
 (4101,313),
 (4102,377),
 (4103,140),
 (4103,378),
 (4104,379),
 (4105,280),
 (4105,308),
 (4105,443),
 (4106,380),
 (4107,317),
 (4107,237),
 (4107,381),
 (4108,382),
 (4109,383),
 (4109,384),
 (4110,385),
 (4110,153),
 (4110,111),
 (4111,231),
 (4111,230),
 (4111,386),
 (4112,405),
 (4113,387),
 (4114,292),
 (4115,152),
 (4115,388),
 (4116,389),
 (4117,390),
 (4118,391),
 (4118,349),
 (4118,392),
 (4119,124),
 (4119,237),
 (4120,137),
 (4121,393),
 (4121,394),
 (4122,236),
 (4122,351),
 (4122,184),
 (4123,395),
 (4123,224),
 (4124,224),
 (4124,259),
 (4124,119),
 (4125,407),
 (4126,367),
 (4126,396),
 (4126,148),
 (4126,381),
 (4127,322),
 (4128,376),
 (4129,380),
 (4130,397),
 (4131,399),
 (4132,405),
 (4132,443),
 (4133,336),
 (4134,400),
 (4135,259),
 (4135,464),
 (4136,401),
 (4137,441),
 (4138,402),
 (4138,357),
 (4139,273),
 (4139,403),
 (4140,376),
 (4141,404),
 (4142,405),
 (4143,406),
 (4144,346),
 (4145,407),
 (4146,408),
 (4146,409),
 (4147,280),
 (4147,128),
 (4148,410),
 (4148,411),
 (4149,208),
 (4149,464),
 (4150,311),
 (4150,413),
 (4150,414),
 (4151,291),
 (4151,394),
 (4152,283),
 (4153,151),
 (4153,415),
 (4154,315),
 (4155,443),
 (4156,182),
 (4157,367),
 (4158,287),
 (4159,416),
 (4160,417),
 (4160,418),
 (4161,419),
 (4161,163),
 (4162,220),
 (4162,415),
 (4163,420),
 (4163,139),
 (4164,292),
 (4165,421),
 (4166,435),
 (4166,217),
 (4167,217),
 (4168,273),
 (4168,336),
 (4169,405),
 (4170,422),
 (4171,423),
 (4172,424),
 (4173,286),
 (4174,315),
 (4174,145),
 (4175,425),
 (4176,297),
 (4177,193),
 (4178,426),
 (4178,427),
 (4179,457),
 (4180,428),
 (4181,315),
 (4182,254),
 (4183,166),
 (4184,236),
 (4184,351),
 (4184,184),
 (4185,429),
 (4185,430),
 (4185,431),
 (4186,432),
 (4187,297),
 (4188,433),
 (4188,434),
 (4189,435),
 (4189,436),
 (4189,437),
 (4190,274),
 (4191,419),
 (4192,415),
 (4192,255),
 (4193,449),
 (4194,438),
 (4194,335),
 (4194,193),
 (4195,393),
 (4196,267),
 (4196,165),
 (4197,384),
 (4198,249),
 (4198,439),
 (4199,440),
 (4200,137),
 (4200,441),
 (4201,442),
 (4202,321),
 (4203,425),
 (4203,443),
 (4204,444),
 (4205,339),
 (4205,296),
 (4205,148),
 (4206,340),
 (4206,441),
 (4207,344),
 (4207,217),
 (4207,280),
 (4207,443),
 (4208,217),
 (4209,229),
 (4210,446),
 (4211,345),
 (4211,441),
 (4212,447),
 (4212,427),
 (4212,128),
 (4213,448),
 (4214,415),
 (4214,449),
 (4215,346),
 (4216,307),
 (4217,450),
 (4217,451),
 (4217,407),
 (4218,310),
 (4219,367),
 (4219,263),
 (4219,321),
 (4220,452),
 (4221,108),
 (4221,453),
 (4221,310),
 (4222,454),
 (4222,455),
 (4222,456),
 (4223,403),
 (4223,255),
 (4224,279),
 (4224,317),
 (4225,457),
 (4226,458),
 (4226,459),
 (4227,460),
 (4228,256),
 (4229,204),
 (4230,461),
 (4230,462),
 (4230,463),
 (4231,380),
 (4231,464),
 (4231,465),
 (4232,344),
 (4232,466),
 (4232,217),
 (4232,209),
 (4233,467),
 (4233,468),
 (4234,469),
 (4235,100),
 (4236,256),
 (4237,101),
 (4237,102),
 (4237,103),
 (4238,104),
 (4239,332),
 (4239,105),
 (4240,106),
 (4241,107),
 (4241,108),
 (4242,109),
 (4243,443),
 (4244,145),
 (4244,184),
 (4245,281),
 (4245,111),
 (4246,376),
 (4247,113),
 (4247,114),
 (4248,115),
 (4249,116),
 (4250,117),
 (4250,370),
 (4251,118),
 (4251,429),
 (4252,346),
 (4253,405),
 (4254,443),
 (4255,158),
 (4256,440),
 (4256,265),
 (4257,249),
 (4257,293),
 (4257,283),
 (4258,119),
 (4258,127),
 (4258,120),
 (4259,121),
 (4259,122),
 (4260,123),
 (4261,109),
 (4261,376),
 (4262,380),
 (4262,138),
 (4262,139),
 (4263,421),
 (4263,271),
 (4264,124),
 (4264,199),
 (4264,197),
 (4265,418),
 (4266,144),
 (4267,443),
 (4267,444),
 (4268,125),
 (4269,126),
 (4270,127),
 (4270,128),
 (4271,344),
 (4271,345),
 (4272,310),
 (4272,405),
 (4273,129),
 (4273,357),
 (4274,130),
 (4275,131),
 (4275,132),
 (4276,133),
 (4276,340),
 (4276,134),
 (4277,135),
 (4277,450),
 (4278,370),
 (4278,137),
 (4279,138),
 (4279,376),
 (4279,139),
 (4280,140),
 (4280,141),
 (4280,176),
 (4281,426),
 (4281,427),
 (4282,427),
 (4282,426),
 (4283,315),
 (4283,142),
 (4284,143),
 (4285,144),
 (4285,145),
 (4286,343),
 (4286,146),
 (4287,410),
 (4288,248),
 (4289,127),
 (4289,347),
 (4290,257),
 (4290,352),
 (4290,148),
 (4291,149),
 (4292,173),
 (4292,150),
 (4293,151),
 (4294,137),
 (4294,152),
 (4295,153),
 (4295,287),
 (4295,154),
 (4296,155),
 (4296,132),
 (4297,173),
 (4297,156),
 (4298,157),
 (4298,158),
 (4299,148),
 (4299,410),
 (4300,159),
 (4300,160),
 (4300,161),
 (4301,162),
 (4301,132),
 (4302,116),
 (4302,115),
 (4303,220),
 (4304,163),
 (4304,338),
 (4305,164),
 (4305,312),
 (4306,302),
 (4306,240),
 (4307,165),
 (4308,323),
 (4308,209),
 (4309,227),
 (4309,166),
 (4310,167),
 (4310,406),
 (4311,206),
 (4312,350),
 (4312,446),
 (4312,403),
 (4313,229),
 (4314,235),
 (4315,169),
 (4316,170),
 (4316,359),
 (4317,428),
 (4317,401),
 (4318,381),
 (4318,382),
 (4319,389),
 (4320,395),
 (4320,284),
 (4321,456),
 (4322,429),
 (4323,184),
 (4323,457),
 (4324,171),
 (4324,378),
 (4325,366),
 (4326,172),
 (4326,256),
 (4327,319),
 (4328,420),
 (4329,255),
 (4329,139),
 (4329,428),
 (4330,443),
 (4331,131),
 (4331,173),
 (4332,133),
 (4332,134),
 (4333,174),
 (4333,175),
 (4333,242),
 (4333,176),
 (4334,118),
 (4334,263),
 (4334,345),
 (4335,177),
 (4335,370),
 (4336,353),
 (4336,128),
 (4337,458),
 (4337,257),
 (4338,178),
 (4338,179),
 (4339,388),
 (4340,180),
 (4340,233),
 (4341,285),
 (4341,286),
 (4341,184),
 (4342,315),
 (4343,315),
 (4344,105),
 (4345,306),
 (4345,132),
 (4346,143),
 (4346,151),
 (4347,344),
 (4347,181),
 (4348,389),
 (4349,151),
 (4349,109),
 (4350,341),
 (4351,127),
 (4351,148),
 (4351,427),
 (4351,424),
 (4351,182),
 (4352,183),
 (4352,277),
 (4352,184),
 (4353,343),
 (4353,185),
 (4354,186),
 (4355,370),
 (4355,117),
 (4356,187),
 (4356,405),
 (4356,188),
 (4357,411),
 (4357,407),
 (4357,424),
 (4358,258),
 (4358,352),
 (4359,457),
 (4360,189),
 (4361,190),
 (4362,191),
 (4362,192),
 (4363,193),
 (1491,334),
 (1492,301),
 (1493,154),
 (1494,288),
 (1495,302),
 (1496,274),
 (1497,216),
 (1498,303),
 (1498,294),
 (1499,304),
 (1499,104),
 (1500,305),
 (1501,306),
 (1501,307),
 (1502,308),
 (1503,309),
 (1503,310),
 (1503,311),
 (1503,312),
 (1503,313),
 (1503,314),
 (1503,315),
 (1504,316),
 (1504,317),
 (1505,319),
 (1505,320),
 (1506,321),
 (1506,322),
 (1507,323),
 (1508,239),
 (1508,192),
 (1509,324),
 (1509,325),
 (1509,326),
 (1510,327),
 (1510,328),
 (1511,267),
 (1512,329),
 (1513,330);
INSERT INTO `author` (`PaNum`,`AcNum`) VALUES 
 (1513,331),
 (1514,332),
 (1514,333),
 (1515,334),
 (1515,335),
 (1515,336),
 (1516,337),
 (1517,338),
 (1517,339),
 (1518,340),
 (1518,341),
 (1519,342),
 (1519,343),
 (1520,344),
 (1520,345),
 (1521,346),
 (1521,347),
 (1522,348),
 (1522,349),
 (1522,350),
 (1523,267),
 (1523,351),
 (1523,268),
 (1524,352),
 (1525,353),
 (1526,334),
 (1526,335),
 (1526,336),
 (1527,354),
 (1527,355),
 (1527,321),
 (1527,322),
 (1528,356),
 (1528,357),
 (1528,358),
 (1528,359),
 (1528,360),
 (1529,361),
 (1530,363),
 (1530,364),
 (1530,326),
 (1531,367),
 (1531,365),
 (1532,366),
 (1532,367),
 (1532,368),
 (1533,369),
 (1533,370),
 (1533,371),
 (1534,372),
 (1534,292),
 (1535,342),
 (1535,373),
 (1536,374),
 (1537,375),
 (1537,376),
 (1538,377),
 (1539,378),
 (1539,379),
 (1540,380),
 (1541,381),
 (1541,382),
 (1542,383),
 (1542,384),
 (1543,385),
 (1544,386),
 (1544,387),
 (1544,388),
 (1545,389),
 (1545,390),
 (1546,391),
 (1546,392),
 (1546,393),
 (1547,394),
 (1547,395),
 (1548,396),
 (1549,397),
 (1549,399),
 (1550,400),
 (1551,401),
 (1552,402),
 (1552,403),
 (1553,404),
 (1553,405),
 (1554,406),
 (1554,407),
 (1555,408),
 (1556,409),
 (1557,410),
 (1558,411),
 (1558,413),
 (1558,414),
 (1559,415),
 (1560,416),
 (1560,337),
 (1561,417),
 (1561,418),
 (1561,419),
 (1561,420),
 (1562,421),
 (1563,422),
 (1563,423),
 (1563,424),
 (1563,425),
 (1564,426),
 (1564,427),
 (1564,428),
 (1564,429),
 (1565,430),
 (1566,431),
 (1567,432),
 (1567,433),
 (1568,434),
 (1568,435),
 (1569,436),
 (1569,437),
 (1570,438),
 (1570,439),
 (1571,440),
 (1571,441),
 (1572,442),
 (1572,433),
 (1573,443),
 (1573,444),
 (1573,446),
 (1574,447),
 (1575,386),
 (1575,387),
 (1576,379),
 (1576,448),
 (1577,449),
 (1577,450),
 (1577,451),
 (1578,452),
 (1578,453),
 (1579,454),
 (1580,455),
 (1580,456),
 (1580,457),
 (1580,458),
 (1581,459),
 (1581,460),
 (1581,461),
 (1582,462),
 (1582,463),
 (1582,464),
 (1583,465),
 (1583,466),
 (1584,467),
 (1584,134),
 (1585,468),
 (1586,469),
 (1587,100),
 (1587,101),
 (1588,102),
 (1588,103),
 (1589,104),
 (1589,105),
 (1590,106),
 (1591,107),
 (1591,108),
 (1592,109),
 (1593,108),
 (1593,107),
 (1594,111),
 (1594,113),
 (1595,114),
 (1596,115),
 (1597,177),
 (1597,116),
 (1598,117),
 (1598,118),
 (1599,119),
 (1600,120),
 (1601,160),
 (1601,121),
 (1601,122),
 (1602,123),
 (1602,124),
 (1603,125),
 (1604,126),
 (1605,127),
 (1606,128),
 (1607,311),
 (1607,129),
 (1608,130),
 (1609,131),
 (1609,132),
 (1610,133),
 (1610,134),
 (1611,135),
 (1612,137),
 (1613,138),
 (1613,139),
 (1614,140),
 (1615,141),
 (1616,142),
 (1617,143),
 (1618,144),
 (1619,145),
 (1620,120),
 (1621,146),
 (1622,148),
 (1622,149),
 (1623,150),
 (1623,151),
 (1623,152),
 (1623,153),
 (1624,193),
 (1625,308),
 (1626,372),
 (1627,154),
 (1628,155),
 (1628,156),
 (1629,157),
 (1629,158),
 (1630,159),
 (1631,160),
 (1631,161),
 (1632,162),
 (1633,163),
 (1634,164),
 (1635,165),
 (1636,155),
 (1636,166),
 (1637,167),
 (1638,169),
 (1639,170),
 (1639,171),
 (1640,172),
 (1641,155),
 (1642,237),
 (1643,130),
 (1644,173),
 (1645,174),
 (1645,175),
 (1645,176),
 (1645,177),
 (1645,178),
 (1645,179),
 (1645,180),
 (1646,145),
 (1647,119),
 (1648,380),
 (1649,340),
 (1649,181),
 (1650,182),
 (1651,154),
 (1651,183),
 (1652,184),
 (1653,111),
 (1654,340),
 (1654,236),
 (1654,185),
 (1655,186),
 (1655,162),
 (1656,187),
 (1657,124),
 (1657,123),
 (1658,188),
 (1659,189),
 (1660,190),
 (1660,191),
 (1660,192),
 (1661,193),
 (1662,194),
 (1662,326),
 (1663,317),
 (1663,237),
 (1664,195),
 (1664,196),
 (1664,197),
 (1665,198),
 (1666,199),
 (1667,155),
 (1667,200),
 (1668,441),
 (1669,201),
 (1670,208),
 (1671,202),
 (1672,203),
 (1672,204),
 (1673,205),
 (1674,206),
 (1675,155),
 (1676,208),
 (1676,209),
 (1677,212),
 (1678,213),
 (1679,214),
 (1680,215),
 (1681,439),
 (1681,216),
 (1682,217),
 (1683,218),
 (1684,219),
 (1684,155),
 (1685,157),
 (1685,220),
 (1686,138),
 (1687,221),
 (1688,222),
 (1689,199),
 (1690,223),
 (1691,224),
 (1692,225),
 (1692,343),
 (1693,226),
 (1693,237),
 (1694,274),
 (1694,227),
 (1695,228),
 (1696,229),
 (1697,230),
 (1697,231),
 (1697,232),
 (1697,233),
 (1698,358),
 (1698,297),
 (1699,415),
 (1700,234),
 (1701,235),
 (1702,236),
 (1703,237),
 (1704,238),
 (1705,239),
 (1706,240),
 (1707,229),
 (1708,241),
 (1709,242),
 (1710,366),
 (1710,243),
 (1711,244),
 (1712,245),
 (1713,343),
 (1713,246),
 (1714,247),
 (1715,248),
 (1715,249),
 (1716,250),
 (1716,251),
 (1717,252),
 (1717,157),
 (1718,253),
 (1718,254),
 (1718,255),
 (1718,256),
 (1718,257),
 (1719,258),
 (1720,259),
 (1720,260),
 (1721,208),
 (1722,261),
 (1723,262),
 (1724,263),
 (1724,264),
 (1725,265),
 (1726,266),
 (1726,267),
 (1727,380),
 (1728,268),
 (1729,269),
 (1730,271),
 (1731,134),
 (1731,272),
 (1732,273),
 (1732,274),
 (1733,275),
 (1734,276),
 (1735,277),
 (1736,278),
 (1736,279),
 (1737,280),
 (1738,281),
 (1739,282),
 (1740,283),
 (1741,284),
 (1742,285),
 (1742,286),
 (1743,287),
 (1744,288),
 (1745,289),
 (1746,289),
 (1747,290),
 (1747,291),
 (1748,292),
 (1749,278),
 (1749,221),
 (1750,293),
 (1751,294),
 (1751,295),
 (1752,296),
 (1753,297),
 (1753,298),
 (1753,299),
 (1754,300),
 (1754,301),
 (1755,164),
 (1755,302),
 (1756,303),
 (1757,304),
 (1758,305),
 (1759,306),
 (1760,307),
 (1760,308),
 (1761,309),
 (1761,310),
 (1762,311),
 (1763,312),
 (1764,313),
 (1764,314),
 (1765,137),
 (1766,315),
 (1767,316),
 (1768,317),
 (1768,319),
 (1769,320),
 (1769,321),
 (1770,322),
 (1770,323),
 (1771,324),
 (1772,325),
 (1773,326),
 (1774,327),
 (1774,328),
 (1775,329),
 (1776,237),
 (1777,278),
 (1777,330),
 (1778,266),
 (1778,267),
 (1779,331),
 (1780,332),
 (1781,333),
 (1781,271),
 (1782,202),
 (1783,155),
 (1783,334),
 (1784,237),
 (1784,184),
 (1785,335),
 (1785,336),
 (1786,337),
 (1786,308),
 (1787,338),
 (1788,339),
 (1789,236),
 (1789,340),
 (1789,341),
 (1790,342),
 (1790,242),
 (1791,343),
 (1792,344),
 (1793,345),
 (1794,346),
 (1794,347),
 (1794,348),
 (1795,349),
 (1795,350),
 (1796,194),
 (1796,351),
 (1797,352),
 (1797,353),
 (1797,354),
 (1798,355),
 (1799,356),
 (1800,224),
 (1801,249),
 (1802,202),
 (1803,357),
 (1804,148),
 (1804,134),
 (1805,327),
 (1806,358),
 (1807,359),
 (1808,143),
 (1809,278),
 (1809,292),
 (1810,360),
 (1811,361),
 (1811,363),
 (1812,364),
 (1813,224),
 (1813,365),
 (1814,237),
 (1815,366),
 (1816,367),
 (1817,250),
 (1818,150),
 (1818,368),
 (1819,369),
 (1819,370),
 (1820,371),
 (1820,372),
 (1820,373),
 (1821,249),
 (1821,205),
 (1822,374),
 (1822,242),
 (1823,375),
 (1824,376),
 (1824,377),
 (1824,378),
 (1825,379),
 (1825,380),
 (1826,379),
 (1826,380),
 (1827,367),
 (1828,263),
 (1829,381),
 (1830,382),
 (1830,383),
 (1831,157),
 (1832,202),
 (1833,350),
 (1833,384),
 (1833,385),
 (1834,386),
 (1834,387),
 (1834,388),
 (1835,389),
 (1835,390),
 (1836,391),
 (1837,293),
 (1838,114),
 (1839,392),
 (1839,393),
 (1840,394),
 (1841,395),
 (1842,396),
 (1842,397),
 (1843,349),
 (1843,350),
 (1844,399),
 (1845,400),
 (1846,308),
 (1846,401),
 (1847,402),
 (1847,350),
 (1848,403),
 (1848,404),
 (1848,405),
 (1849,269),
 (1850,406),
 (1851,407),
 (1852,408),
 (1853,323),
 (1854,224),
 (1855,409),
 (1855,410),
 (1856,411),
 (1857,413),
 (1858,157),
 (1859,414),
 (1860,415),
 (1861,416),
 (1862,417),
 (1862,418),
 (1863,419),
 (1863,224),
 (1864,262),
 (1865,420),
 (1865,421),
 (1866,422),
 (1867,423),
 (1867,424),
 (1868,273),
 (1869,425),
 (1870,426),
 (1871,427),
 (1872,428),
 (1873,429),
 (1874,430),
 (1875,427),
 (1876,431),
 (1876,432),
 (1877,433),
 (1878,434),
 (1879,435),
 (1879,236),
 (1880,439),
 (1881,261),
 (1882,436),
 (1882,437),
 (1883,365),
 (1883,279),
 (1883,438),
 (1884,439),
 (1885,440),
 (1885,441),
 (1886,442),
 (1887,443),
 (1888,127),
 (1888,444),
 (1889,250),
 (1890,446),
 (1890,447),
 (1891,363),
 (1892,448),
 (1892,449),
 (1893,450),
 (1893,350),
 (1894,281),
 (1895,408),
 (1896,451),
 (1897,452),
 (1898,453),
 (1899,267),
 (1899,268),
 (1899,180),
 (1900,454),
 (1901,455),
 (1901,456),
 (1902,457),
 (1903,458),
 (1904,331),
 (1904,459),
 (1904,460),
 (1904,332),
 (1905,461),
 (1905,308),
 (1905,462),
 (1906,417),
 (1906,463),
 (1906,464),
 (1907,432),
 (1908,278),
 (1908,465),
 (1909,363),
 (1909,130),
 (1910,466),
 (1911,467),
 (1912,303),
 (1913,150),
 (1913,368),
 (1914,160),
 (1914,159),
 (1915,468),
 (1916,432),
 (1916,308),
 (1917,469),
 (1918,100),
 (1918,101),
 (1919,102),
 (1920,103),
 (1921,203),
 (1922,134),
 (1922,104),
 (1923,105),
 (1924,106),
 (1925,107),
 (1925,108),
 (1926,109),
 (1927,262),
 (1928,155),
 (1929,111),
 (1930,113),
 (1930,114),
 (1930,314),
 (1930,145),
 (1931,115),
 (1932,116),
 (1932,148),
 (1933,366),
 (1933,117),
 (1934,209),
 (1934,134),
 (1935,118),
 (1935,366),
 (1936,119),
 (1937,120),
 (1938,121),
 (1939,122),
 (1940,287),
 (1941,123),
 (1942,432),
 (1942,124),
 (1943,125),
 (1944,126),
 (1945,100),
 (1945,101),
 (1946,228),
 (1946,127),
 (1946,128),
 (1947,129),
 (1948,114),
 (1949,130),
 (1949,131),
 (1949,132),
 (1950,133),
 (1950,134),
 (1951,135),
 (1952,137),
 (1952,138),
 (1952,139),
 (1953,113),
 (1953,145),
 (1954,140),
 (1954,141),
 (1954,142),
 (1955,143),
 (1955,272),
 (1956,262),
 (1957,144),
 (1957,145),
 (1958,129),
 (1959,146),
 (1960,148),
 (1961,148),
 (1962,149),
 (1963,306),
 (1963,150),
 (1964,405),
 (1965,183),
 (1966,151),
 (1967,152),
 (1968,267),
 (1968,268),
 (1969,182),
 (1970,153),
 (1970,154),
 (1971,155),
 (1972,243),
 (1973,156),
 (1974,267),
 (1974,268),
 (1975,157),
 (1976,379),
 (1976,380),
 (1977,158),
 (1978,159),
 (1978,160),
 (1978,161),
 (1979,162),
 (1980,426),
 (1981,209),
 (1981,163),
 (1982,164),
 (1982,165),
 (1983,166),
 (1984,167),
 (1985,278),
 (1986,169),
 (1987,130),
 (1988,169),
 (1989,333),
 (1989,366),
 (1989,170),
 (1990,171),
 (1990,172),
 (1991,466),
 (1992,296),
 (1993,432),
 (1994,173),
 (1994,174),
 (1995,175),
 (1995,176),
 (1996,177),
 (1997,178),
 (1997,179),
 (1997,229),
 (1998,401),
 (1999,180),
 (2000,278),
 (2000,181),
 (2001,182),
 (2001,183),
 (2002,224),
 (2003,155),
 (2004,184),
 (2005,126),
 (2006,432),
 (2006,308),
 (2007,185),
 (2007,186),
 (2008,129),
 (2009,187),
 (2009,188),
 (2010,443),
 (2011,189),
 (2012,190),
 (2012,228),
 (2013,191),
 (2014,242),
 (2014,192),
 (2015,183),
 (2015,236),
 (2016,193),
 (2017,385),
 (2017,209),
 (2018,388),
 (2019,194),
 (2020,195),
 (2020,196),
 (2021,197),
 (2021,198),
 (2021,199),
 (2021,200),
 (2022,201),
 (2023,202),
 (2024,203),
 (2025,204),
 (2025,205),
 (2025,206),
 (2025,269),
 (2026,245),
 (2027,208),
 (2027,209),
 (2027,212),
 (2027,213),
 (2028,155),
 (2029,214),
 (2030,215),
 (2030,216),
 (2031,278),
 (2032,447),
 (2033,287),
 (2034,217),
 (2034,218),
 (2034,219),
 (2035,220),
 (2035,415),
 (2036,321),
 (2037,221),
 (2038,222),
 (2038,223),
 (2039,224),
 (2040,296),
 (2040,225),
 (2040,226),
 (2041,227),
 (2041,228),
 (2042,229),
 (2043,146),
 (2044,230),
 (2045,231),
 (2045,232),
 (2046,233),
 (2046,117),
 (2047,234),
 (2048,208),
 (2048,209),
 (2049,235),
 (2050,236),
 (2051,126),
 (2052,237),
 (2053,238),
 (2054,239),
 (2055,240),
 (2056,228),
 (2057,353),
 (2058,241),
 (2058,394),
 (2059,241),
 (2059,394),
 (2060,242),
 (2060,308),
 (2061,243),
 (2061,244),
 (2061,294),
 (2062,273),
 (2063,245),
 (2063,246),
 (2063,105),
 (2064,247),
 (2065,189),
 (2065,248),
 (2066,104),
 (2067,249),
 (2067,240),
 (2068,109),
 (2068,413),
 (2069,250),
 (2070,400),
 (2070,251),
 (2071,252),
 (2071,249),
 (2072,360),
 (2073,253),
 (2074,254),
 (2074,255),
 (2075,256),
 (2076,257),
 (2076,258),
 (2076,259),
 (2077,260),
 (2078,261),
 (2079,262),
 (2079,263),
 (2079,264),
 (2080,265),
 (2081,266),
 (2082,267),
 (2082,268),
 (2083,209),
 (2083,385),
 (2084,269),
 (2085,167),
 (2086,271),
 (2086,272),
 (2087,273),
 (2088,274),
 (2089,275),
 (2090,380),
 (2091,276),
 (2092,277),
 (2093,278),
 (2094,279),
 (2095,280),
 (2096,281),
 (2096,282),
 (2097,283),
 (2097,364),
 (2097,443),
 (2098,284),
 (2099,285),
 (2100,286),
 (2101,287),
 (2102,288),
 (2103,289),
 (2104,290),
 (2105,291),
 (2106,292),
 (2107,271),
 (2107,323),
 (2108,293),
 (2109,294),
 (2110,295),
 (2111,296),
 (2112,297),
 (2112,298),
 (2112,299),
 (2113,244),
 (2114,327),
 (2115,467),
 (2115,300),
 (2116,301),
 (2117,302),
 (2117,303),
 (2118,243),
 (2119,304),
 (2120,109),
 (2120,413),
 (2121,305),
 (2122,306),
 (2122,307),
 (2123,308),
 (2124,309),
 (2125,345),
 (2126,219),
 (2127,177),
 (2127,310),
 (2128,311),
 (2129,129),
 (2130,164),
 (2131,166),
 (2132,312),
 (2132,140),
 (2133,313),
 (2134,151),
 (2134,149),
 (2135,148),
 (2135,314),
 (2136,315),
 (2136,145),
 (2137,316),
 (2138,204),
 (2138,205),
 (2139,268),
 (2140,317),
 (2141,319),
 (2141,320),
 (2142,321),
 (2142,184),
 (2143,365),
 (2143,432),
 (2144,180),
 (2144,267),
 (2145,317),
 (2145,237),
 (2146,322),
 (2146,148),
 (2146,326),
 (2147,323),
 (2147,324),
 (2147,325),
 (2148,129),
 (2149,326),
 (2150,327),
 (2150,328),
 (2151,267),
 (2151,268),
 (2152,159),
 (2152,329),
 (2153,330),
 (2154,331),
 (2154,332),
 (2155,295),
 (2156,333),
 (2157,237),
 (2158,333),
 (2159,334),
 (2160,334),
 (2161,335),
 (2162,336),
 (2163,337),
 (2164,338),
 (2165,339),
 (2165,218),
 (2166,340),
 (2167,341),
 (2168,342),
 (2169,343),
 (2170,140),
 (2170,344),
 (2171,345),
 (2171,346),
 (2172,314),
 (2172,347),
 (2173,322),
 (2173,148),
 (2173,326),
 (2174,235),
 (2175,204),
 (2176,348),
 (2177,349),
 (2177,350),
 (2178,104),
 (2178,351),
 (2179,352),
 (2180,353),
 (2180,354),
 (2181,355),
 (2182,261),
 (2182,356),
 (2183,380),
 (2184,272),
 (2185,357),
 (2186,358),
 (2186,396),
 (2187,212),
 (2188,130),
 (2189,274),
 (2190,359),
 (2191,360),
 (2192,303),
 (2192,361),
 (2193,166),
 (2194,415),
 (2194,255),
 (2194,417),
 (2195,325),
 (2196,363),
 (2197,364),
 (2198,400),
 (2199,400),
 (2200,365),
 (2201,366),
 (2201,367),
 (2202,109),
 (2202,413),
 (2203,368),
 (2204,369),
 (2205,370),
 (2205,371),
 (2206,372),
 (2207,373),
 (2207,374),
 (2208,375),
 (2208,376),
 (2209,377),
 (2209,378),
 (2210,379),
 (2210,380),
 (2211,381),
 (2212,382),
 (2213,367),
 (2214,383),
 (2214,384),
 (2215,385),
 (2216,386),
 (2217,387),
 (2217,388),
 (2218,389),
 (2219,390),
 (2220,254),
 (2220,312),
 (2221,321),
 (2221,184),
 (2222,385),
 (2222,333),
 (2223,391),
 (2224,392),
 (2224,326),
 (2225,393),
 (2226,311),
 (2226,394),
 (2226,161),
 (2226,395),
 (2227,392),
 (2228,396),
 (2229,397),
 (2229,399),
 (2230,155),
 (2231,263),
 (2231,321),
 (2232,321),
 (2233,400),
 (2234,401),
 (2235,402),
 (2236,403),
 (2237,404),
 (2237,332),
 (2237,405),
 (2237,333),
 (2237,406),
 (2238,407),
 (2239,408),
 (2240,272),
 (2241,409),
 (2241,410),
 (2241,411),
 (2242,413),
 (2243,159),
 (2243,160),
 (2244,414),
 (2244,415),
 (2245,149),
 (2245,150),
 (2246,314),
 (2246,416),
 (2247,450),
 (2248,321),
 (2248,184),
 (2249,417),
 (2250,365),
 (2251,418),
 (2252,340),
 (2252,351),
 (2252,184),
 (2253,419),
 (2254,420),
 (2255,385),
 (2255,143),
 (2256,280),
 (2256,421),
 (2257,405),
 (2257,443),
 (2258,422),
 (2258,423),
 (2258,424),
 (2259,425),
 (2259,217),
 (2260,426),
 (2260,151),
 (2261,427),
 (2262,391),
 (2263,415),
 (2263,255),
 (2263,417),
 (2264,393),
 (2265,145),
 (2266,428),
 (2267,429),
 (2268,430),
 (2269,431),
 (2270,432),
 (2271,305),
 (2272,433),
 (2272,434),
 (2272,268),
 (2273,435),
 (2274,415),
 (2274,255),
 (2275,436),
 (2276,447),
 (2276,109),
 (2277,141),
 (2277,140),
 (2278,437),
 (2279,438),
 (2279,391),
 (2280,173),
 (2280,439),
 (2281,440),
 (2281,441),
 (2282,442),
 (2282,312),
 (2283,443),
 (2283,444),
 (2284,145),
 (2285,446),
 (2286,447),
 (2287,448),
 (2288,407),
 (2289,449),
 (2290,180),
 (2291,255),
 (2292,212),
 (2293,415),
 (2293,417),
 (2294,450),
 (2295,451),
 (2296,452),
 (2296,176),
 (2296,453),
 (2297,454),
 (2298,428),
 (2299,455),
 (2300,456),
 (2300,457),
 (2301,383),
 (2301,365),
 (2301,384),
 (2302,458),
 (2303,405),
 (2303,443),
 (2304,459),
 (2305,460),
 (2305,461),
 (2305,462),
 (2306,145),
 (2307,145),
 (2308,293),
 (2309,403),
 (2309,255),
 (2310,313),
 (2311,463),
 (2312,464),
 (2312,248),
 (2312,465),
 (2312,466),
 (2312,467),
 (2313,468),
 (2314,469),
 (2314,100),
 (2315,101),
 (2315,236),
 (2316,180),
 (2316,199),
 (2317,400),
 (2318,102),
 (2319,103),
 (2320,109),
 (2320,118),
 (2321,249),
 (2321,205),
 (2322,213),
 (2322,104),
 (2322,105),
 (2323,106),
 (2323,107),
 (2324,108),
 (2325,109),
 (2326,111),
 (2326,142),
 (2327,113),
 (2327,219),
 (2328,114),
 (2329,127),
 (2329,167),
 (2330,222),
 (2331,221),
 (2332,229),
 (2333,184),
 (2333,115),
 (2334,165),
 (2335,256),
 (2336,116),
 (2337,117),
 (2338,118),
 (2338,263),
 (2339,173),
 (2339,119),
 (2340,120),
 (2341,101),
 (2341,236),
 (2341,388),
 (2342,239),
 (2342,121),
 (2343,122),
 (2344,123),
 (2345,124),
 (2345,323),
 (2345,125),
 (2346,126),
 (2347,127),
 (2347,128),
 (2348,129),
 (2348,130),
 (2349,131),
 (2349,132),
 (2349,133),
 (2350,452),
 (2350,176),
 (2350,453),
 (2351,134),
 (2352,135),
 (2352,321),
 (2353,137),
 (2353,138),
 (2353,139),
 (2354,140),
 (2354,396),
 (2355,436),
 (2356,141),
 (2357,148),
 (2358,142),
 (2359,143),
 (2360,144),
 (2361,145),
 (2362,146),
 (2363,348),
 (2364,148),
 (2365,149),
 (2365,150),
 (2366,274),
 (2366,151),
 (2367,152),
 (2368,268),
 (2369,268),
 (2370,153),
 (2371,154),
 (2371,155),
 (2371,156),
 (2372,157),
 (2373,179),
 (2374,175),
 (2374,158),
 (2375,159),
 (2375,283),
 (2376,317),
 (2377,148),
 (2377,280),
 (2378,145),
 (2379,160),
 (2379,161),
 (2379,162),
 (2380,365),
 (2380,163),
 (2381,144),
 (2381,164),
 (2381,165),
 (2382,164),
 (2383,243),
 (2384,166),
 (2384,364),
 (2384,410),
 (2384,137),
 (2385,167),
 (2386,281),
 (2386,323),
 (2387,169),
 (2388,231),
 (2389,450),
 (2389,169),
 (2390,170),
 (2390,171),
 (2391,172),
 (2392,448),
 (2393,173),
 (2393,397),
 (2393,174),
 (2394,175),
 (2395,368),
 (2396,176),
 (2396,177),
 (2397,178),
 (2398,179),
 (2399,153),
 (2400,145),
 (2401,154),
 (2401,180),
 (2401,156),
 (2402,181),
 (2402,413),
 (2403,182),
 (2404,183),
 (2404,304),
 (2405,184),
 (2406,185),
 (2406,186),
 (2407,192),
 (2407,187),
 (2407,188),
 (2407,189),
 (2407,190),
 (2407,191),
 (2407,133),
 (2407,435),
 (2407,192),
 (2407,193),
 (2408,194),
 (2409,239),
 (2409,240),
 (2410,195),
 (2410,196),
 (2411,197),
 (2412,267),
 (2412,268),
 (2412,269),
 (2413,198),
 (2413,199),
 (2414,254),
 (2414,312),
 (2415,200),
 (2415,176),
 (2416,201),
 (2417,202),
 (2418,245),
 (2419,203),
 (2420,204),
 (2421,205),
 (2422,206),
 (2423,208),
 (2424,250),
 (2424,209),
 (2425,212),
 (2426,213),
 (2427,214),
 (2428,316),
 (2428,187),
 (2429,420),
 (2430,313),
 (2430,215),
 (2431,317),
 (2431,237),
 (2432,216),
 (2433,217),
 (2433,345),
 (2434,218),
 (2435,219),
 (2436,220),
 (2437,221),
 (2438,390),
 (2439,368),
 (2440,222),
 (2441,223),
 (2442,224),
 (2443,103),
 (2444,225),
 (2445,226),
 (2446,227),
 (2447,228),
 (2447,384),
 (2448,144),
 (2449,229),
 (2450,172),
 (2451,230),
 (2451,231),
 (2452,232),
 (2452,319),
 (2452,317),
 (2453,233),
 (2454,234),
 (2455,335),
 (2456,145),
 (2457,213),
 (2458,199),
 (2458,235),
 (2458,236),
 (2459,322),
 (2459,237),
 (2460,238),
 (2461,299),
 (2462,239),
 (2463,240),
 (2464,241),
 (2465,287),
 (2466,430),
 (2466,242),
 (2466,243),
 (2467,376),
 (2468,244),
 (2468,245),
 (2468,246),
 (2469,247),
 (2470,227),
 (2471,145),
 (2472,248),
 (2472,249),
 (2472,250),
 (2473,424),
 (2474,159),
 (2474,251),
 (2474,186),
 (2475,252),
 (2476,253),
 (2477,254),
 (2478,255),
 (2479,208),
 (2480,460),
 (2480,256),
 (2480,257),
 (2481,229),
 (2482,258),
 (2482,259),
 (2483,260),
 (2484,326),
 (2485,261),
 (2486,105),
 (2486,106),
 (2487,262),
 (2488,263),
 (2489,355),
 (2490,145),
 (2491,413),
 (2492,400),
 (2493,264),
 (2493,265),
 (2494,266),
 (2495,267),
 (2496,268),
 (2497,269),
 (2498,271),
 (2498,357),
 (2499,243),
 (2500,208),
 (2501,416),
 (2502,272),
 (2502,273),
 (2503,313),
 (2504,274),
 (2505,275),
 (2506,276),
 (2507,277),
 (2507,278),
 (2508,317),
 (2508,237),
 (2509,334),
 (2510,349),
 (2511,124),
 (2511,279),
 (2512,280),
 (2512,281),
 (2513,381),
 (2513,183),
 (2514,282),
 (2515,283),
 (2516,284),
 (2517,400),
 (2518,406),
 (2519,285),
 (2519,286),
 (2520,287),
 (2521,255),
 (2522,334),
 (2522,335),
 (2523,288),
 (2523,411),
 (2524,403),
 (2525,443),
 (2526,289),
 (2527,290),
 (2528,291),
 (2528,292),
 (2529,402),
 (2530,293),
 (2531,294),
 (2531,439),
 (2532,295),
 (2533,296),
 (2533,410),
 (2534,297),
 (2534,298),
 (2535,277),
 (2536,384),
 (2537,299),
 (2538,300),
 (2538,232),
 (2539,301),
 (2540,206),
 (2541,260),
 (2542,302),
 (2543,303),
 (2543,394),
 (2544,304),
 (2545,305),
 (2546,443),
 (2547,389),
 (2547,306),
 (2548,307),
 (2549,308),
 (2550,309),
 (2551,310),
 (2551,311),
 (2552,312),
 (2553,313),
 (2554,314),
 (2554,315),
 (2555,316),
 (2556,317),
 (2557,319),
 (2557,368),
 (2558,320),
 (2558,321),
 (2559,322),
 (2560,323),
 (2560,209),
 (2561,324),
 (2562,325),
 (2563,450),
 (2563,451),
 (2564,326),
 (2565,267),
 (2565,351),
 (2565,268),
 (2566,327),
 (2567,328),
 (2568,329),
 (2568,330),
 (2569,331),
 (2569,332),
 (2570,333),
 (2571,334),
 (2572,335),
 (2572,336),
 (2573,337),
 (2573,236),
 (2574,338),
 (2574,332),
 (2575,339),
 (2576,340),
 (2576,193),
 (2577,315),
 (2577,341),
 (2577,342),
 (2577,343),
 (2578,344),
 (2579,277),
 (2580,345),
 (2580,422),
 (2580,346),
 (2581,421),
 (2581,422),
 (2582,347),
 (2583,348),
 (2583,349),
 (2584,459),
 (2585,345),
 (2586,403),
 (2586,350),
 (2587,351),
 (2587,352),
 (2587,353),
 (2588,354),
 (2589,402),
 (2590,355),
 (2591,356),
 (2591,357),
 (2592,358),
 (2592,332),
 (2593,359),
 (2594,360),
 (2594,297),
 (2594,361),
 (2595,363),
 (2596,364),
 (2596,365),
 (2597,366),
 (2597,367),
 (2598,368),
 (2598,244),
 (2599,313),
 (2600,330),
 (2600,369),
 (2601,370),
 (2602,428),
 (2603,371),
 (2603,376),
 (2604,372),
 (2604,263),
 (2604,371),
 (2605,373),
 (2605,374),
 (2606,375),
 (2606,281),
 (2607,274),
 (2607,376),
 (2608,353),
 (2608,354),
 (2609,377),
 (2610,213),
 (2611,357),
 (2612,186),
 (2613,378),
 (2613,392),
 (2614,379),
 (2614,312),
 (2615,272),
 (2616,380),
 (2616,381),
 (2617,382),
 (2617,383),
 (2618,384),
 (2618,385),
 (2619,386),
 (2619,387),
 (2620,388),
 (2621,164),
 (2621,165),
 (2621,166),
 (2622,145),
 (2623,389),
 (2623,390),
 (2624,391),
 (2624,392),
 (2625,393),
 (2626,394),
 (2627,253),
 (2628,395),
 (2629,396),
 (2630,397),
 (2631,172),
 (2632,425),
 (2632,458),
 (2632,399),
 (2632,400),
 (2633,214),
 (2633,401),
 (2634,166),
 (2635,287),
 (2636,323),
 (2637,402),
 (2638,403),
 (2639,269),
 (2640,404),
 (2641,405),
 (2641,350),
 (2642,406),
 (2643,407),
 (2643,378),
 (2644,407),
 (2644,408),
 (2645,287),
 (2646,375),
 (2647,409),
 (2647,410),
 (2648,294),
 (2648,411),
 (2649,413),
 (2650,414),
 (2651,394),
 (2652,415),
 (2652,134),
 (2653,416),
 (2654,417),
 (2655,418),
 (2656,228),
 (2657,419),
 (2657,326),
 (2658,420),
 (2659,388),
 (2659,160),
 (2660,421),
 (2660,359),
 (2661,422),
 (2661,423),
 (2662,193),
 (2663,448),
 (2664,307),
 (2665,424),
 (2666,425),
 (2667,426),
 (2668,373),
 (2669,427),
 (2669,148),
 (2670,375),
 (2670,376),
 (2671,287),
 (2672,428),
 (2673,429),
 (2674,430),
 (2674,243),
 (2675,431),
 (2676,432),
 (2676,433),
 (2677,434),
 (2678,435),
 (2679,327),
 (2679,436),
 (2680,437),
 (2680,438),
 (2681,309),
 (2682,380),
 (2683,439),
 (2684,440),
 (2685,441),
 (2686,360),
 (2687,442),
 (2688,443),
 (2689,283),
 (2690,224),
 (2691,444),
 (2692,341),
 (2693,405),
 (2694,467),
 (2695,446),
 (2696,152),
 (2696,312),
 (2697,447),
 (2697,448),
 (2697,449),
 (2698,355),
 (2699,450),
 (2699,451),
 (2700,452),
 (2700,453),
 (2701,454),
 (2702,101),
 (2702,236),
 (2703,368),
 (2704,455),
 (2705,456),
 (2705,457),
 (2706,458),
 (2707,446),
 (2708,459),
 (2708,460),
 (2709,208),
 (2709,461),
 (2710,127),
 (2711,244),
 (2712,462),
 (2713,373),
 (2713,463),
 (2714,464),
 (2714,420),
 (2715,465),
 (2716,466),
 (2716,233),
 (2717,209),
 (2717,467),
 (2718,468),
 (2718,469),
 (2719,100),
 (2719,277),
 (2720,156),
 (2721,312),
 (2722,244),
 (2723,101),
 (2724,386),
 (2724,387),
 (2724,388),
 (2725,390),
 (2726,102),
 (2727,228),
 (2727,384),
 (2728,455),
 (2729,103),
 (2729,104),
 (2730,105),
 (2730,106),
 (2731,107),
 (2731,108),
 (2732,109),
 (2732,111),
 (2733,113),
 (2734,260),
 (2735,114),
 (2736,330),
 (2737,135),
 (2737,115),
 (2737,116),
 (2737,465),
 (2738,416),
 (2739,117),
 (2740,118),
 (2741,340),
 (2741,263),
 (2742,119),
 (2743,120),
 (2744,121),
 (2745,122),
 (2745,123),
 (2746,219),
 (2747,124),
 (2748,417),
 (2749,125),
 (2750,126),
 (2750,219),
 (2751,127),
 (2752,128),
 (2752,335),
 (2753,129),
 (2753,130),
 (2754,131),
 (2755,132),
 (2755,133),
 (2756,129),
 (2756,134),
 (2757,380),
 (2758,135),
 (2759,137),
 (2759,138),
 (2760,139),
 (2761,140),
 (2761,141),
 (2762,142),
 (2762,143),
 (2763,144),
 (2764,145),
 (2765,253),
 (2765,420),
 (2766,146),
 (2767,148),
 (2768,148),
 (2769,149),
 (2770,150),
 (2771,262),
 (2771,151),
 (2772,152),
 (2773,396),
 (2774,153),
 (2774,154),
 (2775,439),
 (2776,155),
 (2777,156),
 (2778,333),
 (2778,157),
 (2778,158),
 (2779,159),
 (2780,386),
 (2780,388),
 (2781,160),
 (2781,145),
 (2782,161),
 (2783,162),
 (2783,163),
 (2784,203),
 (2785,164),
 (2785,165),
 (2786,148),
 (2786,149),
 (2787,166),
 (2788,167),
 (2788,242),
 (2789,402),
 (2790,169),
 (2791,170),
 (2792,171),
 (2793,361),
 (2793,172),
 (2794,145),
 (2795,173),
 (2795,174),
 (2796,175),
 (2796,176),
 (2797,322),
 (2798,411),
 (2799,281),
 (2799,177),
 (2800,178),
 (2800,314),
 (2800,179),
 (2801,180),
 (2801,181),
 (2802,182),
 (2802,183),
 (2803,184),
 (2803,185),
 (2804,186),
 (2805,187),
 (2806,188),
 (2807,145),
 (2808,189),
 (2809,190),
 (2809,191),
 (2809,192),
 (2810,193),
 (2811,194),
 (2812,195),
 (2812,213),
 (2813,196),
 (2813,213),
 (2814,197),
 (2815,198),
 (2815,199),
 (2816,293),
 (2816,432),
 (2817,200),
 (2818,313),
 (2819,201),
 (2820,202),
 (2821,203),
 (2821,204),
 (2822,205),
 (2823,206),
 (2824,208),
 (2825,144),
 (2825,208),
 (2826,228),
 (2826,209),
 (2826,384),
 (2827,212),
 (2827,213),
 (2828,214),
 (2829,313),
 (2829,215),
 (2830,315),
 (2830,342),
 (2831,216),
 (2832,217),
 (2832,218),
 (2833,219),
 (2833,220),
 (2834,144),
 (2835,417),
 (2835,206),
 (2836,221),
 (2836,222),
 (2837,223),
 (2837,400),
 (2838,355),
 (2839,224),
 (2840,225),
 (2841,287),
 (2842,226),
 (2843,227),
 (2843,228),
 (2844,135),
 (2844,434),
 (2845,373),
 (2846,316),
 (2847,103),
 (2847,229),
 (2848,230),
 (2848,231),
 (2849,232),
 (2849,202),
 (2850,233),
 (2851,234),
 (2851,349),
 (2852,235),
 (2852,236),
 (2853,290),
 (2853,237),
 (2853,427),
 (2854,251),
 (2854,186),
 (2854,140),
 (2855,238),
 (2855,239),
 (2856,240),
 (2857,241),
 (2857,242),
 (2858,349),
 (2858,243),
 (2858,234),
 (2859,452),
 (2860,428),
 (2860,244),
 (2861,199),
 (2861,198),
 (2862,245),
 (2862,390),
 (2863,442),
 (2864,353),
 (2865,246),
 (2866,247),
 (2867,248),
 (2868,249),
 (2868,250),
 (2869,251),
 (2870,252),
 (2871,349),
 (2871,234),
 (2872,253),
 (2872,254),
 (2873,199),
 (2873,255),
 (2874,443),
 (2874,261),
 (2875,256),
 (2876,257),
 (2877,258),
 (2878,259),
 (2878,260),
 (2879,261),
 (2879,262),
 (2880,289),
 (2881,394),
 (2882,263),
 (2882,264),
 (2882,265),
 (2883,266),
 (2883,267),
 (2884,268),
 (2885,269),
 (2886,217),
 (2887,176),
 (2887,271),
 (2888,272),
 (2889,273),
 (2889,274),
 (2889,165),
 (2890,266),
 (2891,275),
 (2891,276),
 (2892,208),
 (2892,121),
 (2893,277),
 (2894,278),
 (2895,159),
 (2896,279),
 (2897,280),
 (2898,351),
 (2898,281),
 (2899,332),
 (2899,282),
 (2900,283),
 (2901,269),
 (2902,284),
 (2902,378),
 (2903,285),
 (2903,286),
 (2903,184),
 (2904,455),
 (2904,287),
 (2905,288),
 (2905,289),
 (2906,290),
 (2907,451),
 (2907,291),
 (2908,292),
 (2908,262),
 (2908,305),
 (2909,293),
 (2909,294),
 (2910,393),
 (2910,145),
 (2911,295),
 (2912,336),
 (2912,323),
 (2913,296),
 (2914,191),
 (2914,193),
 (2915,297),
 (2916,252),
 (2917,204),
 (2918,298),
 (2919,467),
 (2919,299),
 (2919,300),
 (2920,301),
 (2920,241),
 (2920,302),
 (2920,303),
 (2921,304),
 (2921,305),
 (2922,306),
 (2922,325),
 (2923,307),
 (2923,355),
 (2924,308),
 (2925,240),
 (2926,135),
 (2926,321),
 (2927,309),
 (2927,415),
 (2927,310),
 (2927,311),
 (2928,312),
 (2929,313),
 (2929,125),
 (2930,304),
 (2931,314),
 (2931,417),
 (2931,315),
 (2932,316),
 (2932,317),
 (2932,319),
 (2933,102),
 (2934,320),
 (2935,306),
 (2935,300),
 (2936,321),
 (2936,322),
 (2937,443),
 (2938,199),
 (2938,323),
 (2938,324),
 (2939,325),
 (2939,326),
 (2939,149),
 (2940,327),
 (2940,328),
 (2941,355),
 (2942,329),
 (2942,330),
 (2942,331),
 (2943,332),
 (2944,333),
 (2945,281),
 (2946,334),
 (2946,335),
 (2946,235),
 (4363,194),
 (4364,195),
 (4364,196),
 (4365,428),
 (4365,197),
 (4366,198),
 (4366,138),
 (4367,199),
 (4367,200),
 (4367,400),
 (4368,201),
 (4368,161),
 (4369,282),
 (4369,202),
 (4370,203),
 (4370,204),
 (4371,205),
 (4372,443),
 (4372,344),
 (4373,127),
 (4373,206),
 (4373,293),
 (4374,166),
 (4374,148),
 (4375,123),
 (4376,336),
 (4377,343),
 (4377,208),
 (4378,347),
 (4379,209),
 (4379,212),
 (4380,375),
 (4381,213),
 (4382,214),
 (4382,215),
 (4383,216),
 (4384,167),
 (4384,306),
 (4384,364),
 (4385,416),
 (4385,415),
 (4386,262),
 (4386,263),
 (4387,217),
 (4388,218),
 (4388,219),
 (4389,220),
 (4389,153),
 (4390,160),
 (4391,309),
 (4392,319),
 (4393,137),
 (4393,124),
 (4393,221),
 (4393,222),
 (4393,223),
 (4394,224),
 (4394,225),
 (4394,229),
 (4395,344),
 (4395,181),
 (4396,226),
 (4396,227),
 (4396,228),
 (4396,229),
 (4396,317),
 (4397,380),
 (4397,229),
 (4398,451),
 (4398,230),
 (4399,231),
 (4399,457),
 (4400,232),
 (4400,233),
 (4401,114),
 (4402,446),
 (4403,407),
 (4403,234),
 (4404,359),
 (4405,235),
 (4405,236),
 (4405,237),
 (4406,370),
 (4406,238),
 (4407,449),
 (4408,208),
 (4409,239),
 (4409,240),
 (4409,241),
 (4410,184),
 (4411,242),
 (4412,243),
 (4413,304),
 (4414,244),
 (4415,245),
 (4416,137),
 (4416,249),
 (4417,246),
 (4418,247),
 (4418,195),
 (4418,443),
 (4418,109),
 (4418,466),
 (4419,416),
 (4419,415),
 (4420,143),
 (4420,205),
 (4421,248),
 (4422,249),
 (4423,262),
 (4423,457),
 (4424,273),
 (4425,109),
 (4425,108),
 (4426,250),
 (4427,251),
 (4427,201),
 (4428,206),
 (4428,214),
 (4428,293),
 (4429,396),
 (4429,377),
 (4429,378),
 (4430,464),
 (4430,252),
 (4431,137),
 (4431,253),
 (4432,254),
 (4432,460),
 (4433,255),
 (4434,133),
 (4434,340),
 (4434,256),
 (4435,372),
 (4436,368),
 (4437,178),
 (4437,257),
 (4438,292),
 (4439,278),
 (4440,166),
 (4441,258),
 (4442,178),
 (4443,259),
 (4444,260),
 (4444,261),
 (4444,308),
 (4445,173),
 (4446,262),
 (4447,263),
 (4448,357),
 (4448,314),
 (4449,264),
 (4449,202),
 (4450,385),
 (4450,265),
 (4450,266),
 (4451,448),
 (4452,278),
 (4452,267),
 (4453,268),
 (4454,395),
 (4454,229),
 (4455,352),
 (4456,269),
 (4457,255),
 (4457,348),
 (4458,271),
 (4459,272),
 (4459,273),
 (4460,274),
 (4461,357),
 (4461,314),
 (4462,275),
 (4463,155),
 (4463,283),
 (4464,155),
 (4465,466),
 (4465,276),
 (4466,277),
 (4467,278),
 (4468,312),
 (4469,247),
 (4470,279),
 (4470,280),
 (4471,281),
 (4471,247),
 (4472,324),
 (4473,357),
 (4473,405),
 (4474,103),
 (4475,321),
 (4476,282),
 (4477,271),
 (4477,323),
 (4478,278),
 (4479,247),
 (4479,283),
 (4480,284),
 (4480,285),
 (4480,286),
 (4481,287),
 (4482,209),
 (4482,326),
 (4483,173),
 (4483,336),
 (4483,288),
 (4484,380),
 (4484,162),
 (4485,289),
 (4486,114),
 (4487,290),
 (4487,235),
 (4488,432),
 (4488,365),
 (4489,127),
 (4490,291),
 (4491,292),
 (4492,415),
 (4492,255),
 (4492,293),
 (4493,155),
 (4493,283),
 (4494,294),
 (4494,295),
 (4495,296),
 (4496,114),
 (4497,392),
 (4498,155),
 (4498,283),
 (4499,297),
 (4500,441),
 (4501,298),
 (4501,184),
 (4502,114),
 (4503,299),
 (4504,321),
 (4505,209),
 (4505,134),
 (4506,300),
 (4507,127),
 (4507,301),
 (4507,399),
 (4508,449),
 (4509,302),
 (4510,114),
 (4511,303),
 (4511,340),
 (4512,391),
 (4512,304),
 (4513,305),
 (4513,123),
 (4514,114),
 (4515,448),
 (4516,306),
 (4516,137),
 (4517,283),
 (4518,307),
 (4518,209),
 (4518,326),
 (4519,166),
 (4519,308),
 (4520,282),
 (4521,114),
 (4522,309),
 (4522,348),
 (4523,310),
 (4523,308),
 (4524,282),
 (4525,311),
 (4525,151),
 (4526,312),
 (4527,114),
 (4528,313),
 (4528,324),
 (4529,314),
 (4530,432),
 (4531,466),
 (4531,276),
 (4532,287),
 (4533,315),
 (4534,464),
 (4535,114),
 (4536,316),
 (4536,317),
 (4537,184),
 (4537,285),
 (4538,324),
 (4538,239),
 (4539,319),
 (4540,320),
 (4540,321),
 (4541,198),
 (4541,394),
 (4542,322),
 (4543,114),
 (4544,229),
 (4545,302),
 (4546,323),
 (4547,457),
 (4548,127),
 (4548,303),
 (4549,324),
 (4549,325),
 (4550,353),
 (4550,326),
 (4551,367),
 (4551,145),
 (4552,326),
 (4552,327),
 (4552,433),
 (4553,114),
 (4554,416),
 (4555,137),
 (4556,328),
 (4556,220),
 (4557,335),
 (4557,323),
 (4558,329),
 (4558,330),
 (4559,405),
 (4559,331),
 (4560,332),
 (4561,419),
 (4562,114),
 (4563,390),
 (4564,333),
 (4564,288),
 (4565,334),
 (4565,335),
 (4566,338),
 (4567,348),
 (4568,336),
 (4568,145),
 (4569,184),
 (4569,337),
 (4569,229),
 (4570,434),
 (4571,448),
 (4571,338),
 (4572,114),
 (4573,339),
 (4573,371),
 (4574,340),
 (4574,341),
 (4575,342),
 (4575,123),
 (4576,343),
 (4576,109),
 (4576,392),
 (4576,344),
 (4577,123),
 (4577,345),
 (4578,220),
 (4578,346),
 (4579,144),
 (4580,347),
 (4580,342),
 (4581,114),
 (4582,341),
 (4583,348),
 (4583,349),
 (4584,350),
 (4585,173),
 (4586,351),
 (4587,352),
 (4587,353),
 (4588,354),
 (4588,376),
 (4589,329),
 (4590,193),
 (4591,213),
 (4592,114),
 (4593,157),
 (4594,157),
 (4595,263),
 (4596,355),
 (4597,187),
 (4597,125),
 (4598,261),
 (4598,356),
 (4599,235),
 (4600,454),
 (4600,256),
 (4601,357),
 (4601,324),
 (4602,114),
 (4603,330),
 (4603,439),
 (4604,217),
 (4605,372),
 (4605,371),
 (4606,326),
 (4607,358),
 (4608,359),
 (4608,309),
 (4609,360),
 (4609,285),
 (4609,286),
 (4610,228),
 (4611,250),
 (4611,361),
 (4612,256),
 (4613,114),
 (4614,359),
 (4614,371),
 (4615,363),
 (4615,364),
 (4616,365),
 (4617,135),
 (4617,321),
 (4618,366),
 (4618,367),
 (4619,426),
 (4619,368),
 (4620,224),
 (4621,369),
 (4622,356),
 (4622,357),
 (4623,420),
 (4624,242),
 (4625,370),
 (4625,371),
 (4625,372),
 (4626,373),
 (4626,405),
 (4627,247),
 (4628,395),
 (4629,310),
 (4629,332),
 (4630,139),
 (4631,375),
 (4632,374),
 (4632,286),
 (4632,375),
 (4633,376),
 (4633,377),
 (4633,394),
 (4634,360),
 (4634,378),
 (4634,379),
 (4634,380),
 (4635,381),
 (4636,382),
 (4636,383),
 (4636,384),
 (4636,385),
 (4637,443),
 (4638,114),
 (4639,386),
 (4639,387),
 (4640,388),
 (4640,433),
 (4640,389),
 (4641,390),
 (4642,391),
 (4642,392),
 (4642,425),
 (4643,256),
 (4643,325),
 (4644,378),
 (4644,393),
 (4645,161),
 (4646,394),
 (4647,395),
 (4647,451),
 (4647,396),
 (4647,326),
 (4648,380),
 (4649,410),
 (4649,239),
 (4650,165),
 (4650,397),
 (4651,399),
 (4651,400),
 (4652,144),
 (4652,401),
 (4653,402),
 (4653,263),
 (4654,303),
 (4654,403),
 (4654,404),
 (4655,405),
 (4656,406),
 (4656,400),
 (4656,250),
 (4657,114),
 (4658,184),
 (4658,285),
 (4659,375),
 (4659,376),
 (4660,407),
 (4660,208),
 (4661,408),
 (4662,409),
 (4662,410),
 (4663,411),
 (4664,413),
 (4665,414),
 (4665,415),
 (4666,416),
 (4666,405),
 (4667,417),
 (4668,353),
 (4669,455),
 (4670,173),
 (4670,150),
 (4671,306),
 (4671,201),
 (4672,418),
 (4672,357),
 (4672,419),
 (4673,420),
 (4674,421),
 (4674,422),
 (4675,434),
 (4676,114),
 (4677,343),
 (4677,146),
 (4678,423),
 (4679,424),
 (4679,425),
 (4679,426),
 (4680,359),
 (4680,135),
 (4681,449),
 (4682,427),
 (4682,199),
 (4683,113),
 (4683,404),
 (4684,428),
 (4685,416),
 (4685,383),
 (4686,114),
 (4687,429),
 (4688,430),
 (4688,407),
 (4689,443),
 (4689,414),
 (4690,431),
 (4691,247),
 (4692,432),
 (4692,433),
 (4693,368),
 (4694,383),
 (4695,261),
 (4696,434),
 (4696,435),
 (4697,436),
 (4697,437),
 (4698,392),
 (4699,438),
 (4700,439),
 (4700,320),
 (4701,176),
 (4701,149),
 (4702,175),
 (4702,267),
 (4703,440),
 (4704,244),
 (4705,441),
 (4706,125),
 (4707,332),
 (4708,442),
 (4709,201),
 (4710,395),
 (4710,451),
 (4710,230),
 (4711,321),
 (4712,442),
 (4713,386),
 (4713,427),
 (4713,443),
 (4714,429),
 (4714,444),
 (4714,446),
 (4714,440),
 (4714,265),
 (4714,333),
 (4714,272),
 (4714,447),
 (4714,448),
 (4714,449),
 (4715,450),
 (4716,451),
 (4716,452),
 (4717,453),
 (4717,454),
 (4718,455),
 (4719,456),
 (4719,140),
 (4719,141),
 (4720,457),
 (4721,151),
 (4721,321),
 (4722,189),
 (4723,458),
 (4724,459),
 (4725,460),
 (4725,461),
 (4725,462),
 (4726,350),
 (4727,463),
 (4728,460),
 (4728,464),
 (4728,462),
 (4729,465),
 (4730,224),
 (4730,466),
 (4731,456),
 (4731,457),
 (4732,467),
 (4733,300),
 (4733,468),
 (4734,469),
 (4735,469),
 (4736,459),
 (4737,100),
 (4738,323),
 (4738,101),
 (4739,321),
 (4740,170),
 (4741,102),
 (4742,103),
 (4742,104),
 (4743,189),
 (4744,350),
 (4745,278),
 (4746,463),
 (4746,105),
 (4747,456),
 (4747,457),
 (4748,106),
 (4749,107),
 (4750,150),
 (4750,321),
 (4751,463),
 (4752,410),
 (4753,150),
 (4754,108),
 (4755,178),
 (4756,109),
 (4757,111),
 (4758,174),
 (4758,113),
 (4759,151),
 (4759,281),
 (4760,114),
 (4761,115),
 (4761,116),
 (4762,117),
 (4762,118),
 (4763,113),
 (4764,119),
 (4765,120),
 (4766,121),
 (4766,461),
 (4766,122),
 (4766,123),
 (4767,124),
 (4768,125),
 (4768,126),
 (4769,127),
 (4770,128),
 (4771,376),
 (4772,129),
 (4773,278),
 (4773,457),
 (4774,130),
 (4775,131),
 (4776,131),
 (4777,132),
 (4778,395),
 (4778,117),
 (4779,276),
 (4780,133),
 (4780,134),
 (4781,135),
 (4782,276),
 (4782,154),
 (4783,350),
 (4784,137),
 (4785,278),
 (4785,457),
 (4786,132),
 (4786,459),
 (4787,435),
 (4788,138),
 (4789,195),
 (4789,196),
 (4789,197),
 (4790,139),
 (4790,140),
 (4791,141),
 (4792,265),
 (4793,274),
 (4794,142),
 (4795,134),
 (4795,143),
 (4796,144),
 (4797,150),
 (4797,280),
 (4797,321),
 (4798,145),
 (4799,146),
 (4800,314),
 (4800,174),
 (4801,107),
 (4802,278),
 (4802,457),
 (4802,456),
 (4803,148),
 (4803,149),
 (4804,368),
 (4805,108),
 (4806,150),
 (4807,151),
 (4807,152),
 (4807,262),
 (4808,153),
 (4809,154),
 (4809,379),
 (4810,154),
 (4811,155),
 (4811,156),
 (4812,151),
 (4812,276),
 (4813,157),
 (4814,410),
 (4814,456),
 (4815,158),
 (4816,159),
 (4817,160),
 (4818,161),
 (4819,340),
 (4820,162),
 (4821,163),
 (4822,164),
 (4823,278),
 (4823,457),
 (4824,165),
 (4824,185),
 (4825,166),
 (4826,167),
 (4827,407),
 (4827,151),
 (4827,265),
 (4828,407),
 (4828,151),
 (4828,415),
 (4828,265),
 (4829,154),
 (4829,379),
 (4830,453),
 (4831,169),
 (4831,278),
 (4832,379),
 (4832,183),
 (4832,170),
 (4833,410),
 (4833,246),
 (4834,171),
 (4835,134),
 (4835,172),
 (4835,173),
 (4836,415),
 (4837,454),
 (4838,114),
 (4839,463),
 (4840,321),
 (4841,174),
 (4842,175),
 (4843,246),
 (4844,176),
 (4845,233),
 (4846,177),
 (4847,178),
 (4848,151),
 (4848,281),
 (4849,407),
 (4850,458),
 (4851,179),
 (4851,180),
 (4852,127),
 (4853,296),
 (4854,123),
 (4855,181),
 (4855,182),
 (4855,247),
 (4855,216),
 (4856,183),
 (4857,410),
 (4858,184),
 (4859,281),
 (4860,185),
 (4860,447),
 (4861,186),
 (4862,187),
 (4863,252),
 (4864,188),
 (4865,151),
 (4866,290),
 (4867,189),
 (4867,190),
 (4868,191),
 (4868,395),
 (4869,410),
 (4870,278),
 (4870,457),
 (4871,192),
 (4872,203),
 (4873,193),
 (4874,194),
 (4875,279),
 (4876,240),
 (4877,195),
 (4878,196),
 (4878,197),
 (4879,198),
 (4880,199),
 (4881,200),
 (4882,201),
 (4882,208),
 (4883,240),
 (4884,202),
 (4885,203),
 (4886,204),
 (4887,205),
 (4888,134),
 (4888,287),
 (4889,272),
 (4889,206),
 (4890,149),
 (4891,208),
 (4892,209),
 (4892,212),
 (4893,380),
 (4894,278),
 (4894,457),
 (4895,213),
 (4896,126),
 (4896,214),
 (4897,215),
 (4898,151),
 (4898,151),
 (4899,415),
 (4900,216),
 (4900,195),
 (4900,217),
 (4900,197),
 (4901,281),
 (4901,125),
 (4902,218),
 (4902,193),
 (4903,219),
 (4903,220),
 (4904,425),
 (4905,410),
 (4905,221),
 (4906,126),
 (4906,222),
 (4907,223),
 (4907,224),
 (4908,321),
 (4908,423),
 (4909,410),
 (4910,225),
 (4910,226),
 (4911,227),
 (4911,461),
 (4911,228),
 (4912,229),
 (4913,456),
 (4913,160),
 (4914,218),
 (4915,113),
 (4916,113),
 (4916,230),
 (4917,392),
 (4918,368),
 (4919,231),
 (4919,274),
 (4920,297),
 (4920,208),
 (4920,390),
 (4920,242),
 (4920,145),
 (4921,232),
 (4922,372),
 (4923,233),
 (4924,234),
 (4925,248),
 (4925,273),
 (4926,235),
 (4927,176),
 (4928,236),
 (4928,323),
 (4929,215),
 (4930,237),
 (4931,240),
 (4932,238),
 (4933,239),
 (4934,240),
 (4935,241),
 (4936,242),
 (4936,243),
 (4937,250),
 (4938,108),
 (4939,244),
 (4940,245),
 (4941,340),
 (4941,185),
 (4942,246),
 (4942,224),
 (4943,150),
 (4943,247),
 (4944,350),
 (4944,248),
 (4945,177),
 (4946,151),
 (4946,108),
 (4947,114),
 (4948,173),
 (4948,407),
 (4949,249),
 (4950,311),
 (4950,250),
 (4951,114),
 (4952,193),
 (4953,247),
 (4953,201),
 (4954,251),
 (4955,252),
 (4955,253),
 (4956,254),
 (4957,162),
 (4958,151),
 (4958,281),
 (4959,252),
 (4960,255),
 (4960,256),
 (4961,214),
 (4962,257),
 (4963,444),
 (4964,430),
 (4965,391),
 (4966,407),
 (4967,444),
 (4968,114),
 (4969,258),
 (4969,139),
 (4969,355),
 (4970,113),
 (4971,365),
 (4972,133),
 (4973,221),
 (4974,169),
 (4975,259),
 (4976,439),
 (4977,179),
 (4977,180),
 (4977,260),
 (4978,261),
 (4979,262),
 (4980,263),
 (4981,279),
 (4981,264),
 (4982,151),
 (4982,188),
 (4982,276),
 (4983,213),
 (4984,138),
 (4985,265),
 (4985,266),
 (4985,267),
 (4986,145),
 (4987,268),
 (4987,269),
 (4988,180),
 (4989,276),
 (4990,344),
 (4991,271),
 (4992,344),
 (4992,410),
 (4993,188),
 (4994,285),
 (4994,286),
 (4995,457),
 (4996,272),
 (4997,273),
 (4998,415),
 (4998,118),
 (4999,157),
 (5000,274),
 (5000,275);
/*!40000 ALTER TABLE `author` ENABLE KEYS */;


--
-- Definition of table `department`
--

DROP TABLE IF EXISTS `department`;
CREATE TABLE `department` (
  `DeptNum` int(11) default NULL,
  `Descrip` varchar(255) default NULL,
  `Instname` varchar(255) default NULL,
  `DeptName` varchar(255) default NULL,
  `State` varchar(255) default NULL,
  `Postcode` int(11) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `department`
--

/*!40000 ALTER TABLE `department` DISABLE KEYS */;
INSERT INTO `department` (`DeptNum`,`Descrip`,`Instname`,`DeptName`,`State`,`Postcode`) VALUES 
 (100,'GU CIT','Griffith University','School of Computing and Information Technology','Qld',4111),
 (101,'JCU CS','James Cook University of North Queensland','Computer Science','Qld',4811),
 (102,'LTU CSCE','La Trobe University','Computer Science and Computer Engineering','VIC',3083),
 (103,'MQU MPCE','Macquarie University','Computing','NSW',2109),
 (104,'MQU RCASE','Macquarie University','JRCASE','NSW',2109),
 (105,'MNU CS','Monash University (Clayton)','Computer Science','Vic',3168),
 (106,'MRU CS','Murdoch University','Computer Science','WA',6150),
 (107,'NUS ISCS','National University of Singapore','Information Systems and Computer Science',NULL,0),
 (108,'QUT CS','Queensland University of Technology','Computing Science','QLD',4000),
 (109,'SUT IT','Swinburne University of Technology','School of Information Technology','Vic',3122),
 (110,'ANU CSL','Australian National University','Computer Science Laboratory','ACT',200),
 (111,'ADFA CS','University College - ADFA - UNSW','Computer Science','ACT',2600),
 (112,'UA CS','University of Adelaide','Computer Science','SA',5005),
 (113,'UC ISE','University of Canberra','Information Sciences and Engineering','ACT',2616),
 (114,'UNE MSCS','University of New England','Mathematics - Statistics and Computing Science','NSW',2351),
 (115,'UNC CS','University of Newcastle','Computer Science','NSW',2308),
 (116,'UQ IT','University of Queensland','School of Information Technology','Qld',4072),
 (118,'FU CS','Flinders University','Department of Computer Science','SA',5001),
 (119,'USA CIS','University of South Australia','School of Computer and Information Science','SA',5095),
 (120,'UTH CS','University of Tasmania - Hobart','Department of Computer Science','TAS',7001),
 (121,'UTL ACM','University of Tasmania at Launceston','Applied Computing and Mathematics','Tas',7250),
 (122,'UTS CS','University of Technology - Sydney','School of Computing Sciences','NSW',2007),
 (123,'UWSN DC','University of Western Sydney - Nepean','Department of Computing','NSW',2747),
 (124,'UB MC','University of Ballarat','School of Mathematics and Computing','Vic',3353),
 (125,'UM CS','University of Melbourne','Computer Science','Vic',3052),
 (126,'RMIT CS','Royal Melbourne Institute of Technology','Computer Science','Vic',3001),
 (127,'CSIRO DIT','Commonwealth Scientific and Industrial Research Org','Division of Information Technology','ACT',2601),
 (128,'SU CS','University of Sydney','Basser Department of Computer Science','NSW',2006),
 (129,'DSTO ITD','Defence Science and Technology Organisation','Information Technology Division',NULL,0),
 (130,'UQ CITR','University of Queensland','Centre for Information Technology Research','Qld',4072),
 (131,'UQ CRCDST','University of Queensland','CRC for Distributed Systems Technology','Qld',4072),
 (132,'BU IT','Bond University','School of Information Technology','Qld',4229),
 (133,'CUT CS','Curtin University of Technology','Computer Science','WA',6001),
 (134,'QUT ISRC','Queensland University of Technology','Information Security Research Centre','Qld',4001),
 (135,'ECU CS','Edith Cowan University','Computer Science','WA',6050),
 (136,'MIAST NLP','Microsoft Institute of Adv Software Technology','NLP Research Unit','NSW',2113),
 (137,'UNSW CSE','University of New South Wales','School of Computer Science and Engineering','NSW',2052),
 (138,'UWA CS','University of Western Australia','Computer Science','WA',6907),
 (139,'USQ MC','University of Southern Queensland','Department of Mathematics and Computing','Qld',4350),
 (140,'QUT DSTC','Queensland University of Technology','CRC for Distributed Systems Technology','Qld',4000),
 (141,'ANU CS','Australian National University','Department of Computer Science','ACT',200),
 (142,'UM DIS','University of Melbourne','Department of Information Systems','vic',3052),
 (143,'MNU GSCIT','Monash University','Gippsland School of Computing and I.T.','vic',3842),
 (144,'CQUMC','Central Queensland University','Department Mathematics and Computing','QLD',4702),
 (145,'MNU SD','Monash University','Department of Software Development','Vic',3145),
 (147,'NONE','No longer working in Australia',NULL,NULL,0),
 (146,'UNKNOWN','Has moved. Old address no longer valid.',NULL,NULL,0);
/*!40000 ALTER TABLE `department` ENABLE KEYS */;


--
-- Definition of table `field`
--

DROP TABLE IF EXISTS `field`;
CREATE TABLE `field` (
  `FieldNum` int(11) default NULL,
  `ID` varchar(255) default NULL,
  `Title` varchar(255) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `field`
--

/*!40000 ALTER TABLE `field` DISABLE KEYS */;
INSERT INTO `field` (`FieldNum`,`ID`,`Title`) VALUES 
 (505,'B.3.4','Reliability - Testing and Fault-Tolerance'),
 (506,'B.3.0','General'),
 (507,'B.2.3','Reliability - Testing and Fault-Tolerance'),
 (508,'B.2.2','Performance Analysis and Design Aids'),
 (509,'B.2.1','Design Styles'),
 (510,'B.2.0','General'),
 (511,'B.1.6','Miscellaneous'),
 (512,'B.1.4','Microprogram Design Aids'),
 (513,'B.1.2','Control Structure Performance Analysis and Design Aids'),
 (514,'B.1.1','Control Design Styles'),
 (515,'B.1.0','General'),
 (516,'B.8','Miscellaneous'),
 (517,'C.0','General'),
 (518,'C.1.0','General'),
 (519,'C.1.4','Miscellaneous'),
 (520,'C.5.0','General'),
 (521,'C.5.1','Large and Medium (Mainframe) Computers'),
 (522,'C.5.2','Minicomputers'),
 (523,'C.5.3','Microcomputers'),
 (524,'C.5.5','Miscellaneous'),
 (525,'C.6','Miscellaneous'),
 (526,'D.2.3','Coding'),
 (527,'D.3.5','Miscellaneous'),
 (528,'D.4.3','File Systems Management'),
 (529,'D.4.5','Reliability'),
 (530,'D.4.10','Miscellaneous'),
 (531,'D.5','Miscellaneous'),
 (532,'E.','Data'),
 (533,'E.0','General'),
 (534,'E.3','Data Encryption'),
 (535,'E.4','Coding and Information Theory'),
 (536,'F.','Theory of Computation'),
 (537,'F.0','General'),
 (538,'F.1.2','Modes of Computation'),
 (539,'F.1.4','Miscellaneous'),
 (540,'F.2.0','General'),
 (541,'F.2.4','Miscellaneous'),
 (542,'F.3.0','General'),
 (543,'F.3.4','Miscellaneous'),
 (544,'F.4.0','General'),
 (545,'F.4.4','Miscellaneous'),
 (546,'F.5','Miscellaneous'),
 (547,'G.','Mathematics of Computing'),
 (548,'G.0','General'),
 (549,'G.1','Numerical Analysis'),
 (550,'G.1.1','Interpolation'),
 (551,'G.1.2','Approximation'),
 (552,'G.1.4','Quadrature and Numerical Differentiation'),
 (553,'G.1.5','Roots of Nonlinear Equations'),
 (554,'G.1.7','Ordinary Differential Equations'),
 (555,'G.1.8','Partial Differential Equations'),
 (556,'G.1.9','Integral Equations'),
 (557,'G.1.10','Miscellaneous'),
 (558,'G.2','Discrete Mathematics'),
 (559,'G.2.0','General'),
 (560,'G.5','Miscellaneous'),
 (561,'H.1.3','Miscellaneous'),
 (562,'H.2.2','Physical Design'),
 (563,'H.2.3','Languages'),
 (564,'H.2.4','Systems'),
 (565,'H.2.7','Database Administration'),
 (566,'H.3','Information Storage and Retrieval'),
 (567,'H.3.0','General'),
 (568,'H.3.1','Content Analysis and Indexing'),
 (569,'H.3.4','Systems and Software'),
 (570,'H.3.5','Online Information Systems'),
 (571,'H.3.6','Library Automation'),
 (572,'H.3.7','Miscellaneous'),
 (573,'H.4.2','Types of Systems'),
 (574,'H.4.3','Communications Applications'),
 (575,'H.5.4','Miscellaneous'),
 (576,'I.','Computing Methodologies'),
 (577,'I.0','General'),
 (578,'I.1','Algebraic Manipulation'),
 (579,'I.1.0','General'),
 (580,'I.1.5','Miscellaneous'),
 (581,'I.2.5','Programming Languages and Software'),
 (582,'I.3.0','General'),
 (583,'I.3.1','Hardware Architecture'),
 (584,'I.3.2','Graphics Systems'),
 (585,'I.3.6','Methodology and Techniques'),
 (586,'I.4.0','General'),
 (587,'I.4.1','Digitization'),
 (588,'I.4.3','Enhancement'),
 (589,'I.4.4','Restoration'),
 (590,'I.4.5','Reconstruction'),
 (591,'I.4.6','Segmentation'),
 (592,'I.4.11','Miscellaneous'),
 (593,'I.5.0','General'),
 (594,'I.5.1','Models'),
 (595,'I.5.2','Design Methodology'),
 (596,'I.5.5','Implementation'),
 (597,'I.6.1','Simulation Theory'),
 (598,'I.6.6','Simulation Output Analysis'),
 (599,'I.6.7','Simulation Support Systems'),
 (600,'I.6.8','Types of Simulation'),
 (601,'I.6.9','Miscellaneous'),
 (602,'I.7.3','Index Generation'),
 (603,'I.7.4','Miscellaneous'),
 (604,'J.','Computer Applications'),
 (605,'J.1','Administrative Data Processing'),
 (606,'J.7','Computers in Other Systems'),
 (607,'J.8','Miscellaneous'),
 (608,'K.','Computing Milieux'),
 (609,'K.0','General'),
 (610,'K.1','The Computer Industry'),
 (611,'K.3.3','Miscellaneous'),
 (612,'K.4.4','Miscellaneous'),
 (613,'K.5','Legal Aspects of Computing'),
 (614,'K.5.0','General'),
 (615,'K.5.1','Software Protection'),
 (616,'K.5.2','Governmental Issues'),
 (617,'K.5.3','Miscellaneous'),
 (618,'K.6.2','Installation Management'),
 (619,'K.6.3','Software Management'),
 (620,'K.6.5','Security and Protection'),
 (621,'K.6.6','Miscellaneous'),
 (622,'K.7','The Computing Profession'),
 (623,'K.7.0','General'),
 (624,'K.7.1','Occupations'),
 (625,'K.7.3','Testing - Certification and Licensing'),
 (626,'K.8.0','General'),
 (627,'K.8.1','Application Packages'),
 (628,'K.8.2','Hardware'),
 (629,'K.8.3','Management/Maintenance'),
 (630,'K.9','Miscellaneous'),
 (292,'B.','Hardware'),
 (293,'B.0','General'),
 (294,'B.1','Control Structures and Microprogramming'),
 (295,'B.1.3','Control Structure Reliability - Testing and Fault-Tolerance'),
 (296,'B.1.5','Microcode Applications'),
 (297,'B.2','Arithmetic and Logic Structures'),
 (298,'B.2.4','Miscellaneous'),
 (299,'B.3','Memory Structures'),
 (300,'B.3.2','Design Styles'),
 (301,'B.3.3','Performance Analysis and Design Aids'),
 (302,'B.4.2','Input/output Devices'),
 (303,'B.4.3','Interconnections (subsystems)'),
 (304,'B.4.5','Reliability - Testing and Fault-Tolerance'),
 (305,'B.5','Register Transfer Level Implementation'),
 (306,'B.6','Logic Design'),
 (307,'B.7','Integrated Circuits'),
 (308,'C.','Computer Systems Organization'),
 (309,'C.1','Processor Architectures'),
 (310,'C.1.1','Single Data Stream Architectures'),
 (311,'C.1.2','Multiple Data Stream Architectures'),
 (312,'C.1.3','Other Architecture Styles'),
 (313,'C.2','Computer Communication Networks'),
 (314,'C.2.0','General'),
 (315,'C.2.1','Network Architecture and Design'),
 (316,'C.2.2','Network Protocols'),
 (317,'C.2.3','Network Operations'),
 (318,'C.2.4','Distributed Systems'),
 (319,'C.2.5','Local Networks'),
 (320,'C.2.6','Miscellaneous'),
 (321,'C.3','Special Purpose and Application Based Systems'),
 (322,'C.4','Performance of Systems'),
 (323,'C.5','Computer System Implementation'),
 (324,'C.5.4','VLSI Systems'),
 (325,'D.','Software'),
 (326,'D.0','General'),
 (327,'D.1','Programming Techniques'),
 (328,'D.1.0','General'),
 (329,'D.1.1','Applicative (Functional) Programming'),
 (330,'D.1.2','Automatic Programming'),
 (331,'D.1.3','Concurrent Programming'),
 (332,'D.1.4','Sequential Programming'),
 (333,'D.1.5','Object-oriented Programming'),
 (334,'D.1.6','Logic Programming'),
 (335,'D.1.7','Visual Programming'),
 (336,'D.1.8','Miscellaneous'),
 (337,'D.2','Software Engineering'),
 (338,'D.2.0','General'),
 (339,'D.2.1','Requirements/Specifications'),
 (340,'D.2.10','Design'),
 (341,'D.2.11','Miscellaneous'),
 (342,'D.2.2','Tools and Techniques'),
 (343,'D.2.4','Program Verification'),
 (344,'D.2.5','Testing and Debugging'),
 (345,'D.2.6','Programming Environments'),
 (346,'D.2.7','Distribution and Maintenance'),
 (347,'D.2.8','Metrics'),
 (348,'D.2.9','Management'),
 (349,'D.3','Programming Languages'),
 (350,'D.3.0','General'),
 (351,'D.3.1','Formal Definitions and Theory'),
 (352,'D.3.2','Language Classifications'),
 (353,'D.3.3','Language Constructs and Features'),
 (354,'D.3.4','Processors'),
 (355,'D.4','Operating Systems'),
 (356,'D.4.0','General'),
 (357,'D.4.1','Process Management'),
 (358,'D.4.2','Storage Management'),
 (359,'D.4.4','Communications Management'),
 (360,'D.4.6','Security and Protection'),
 (361,'D.4.7','Organization and Design'),
 (362,'D.4.8','Performance'),
 (363,'D.4.9','Systems programs and Utilities'),
 (364,'E.1','Data Structures'),
 (365,'E.2','Data Storage Representations'),
 (366,'E.5','Files'),
 (367,'E.6','Miscellaneous'),
 (368,'F.1','Computation by Abstract Devices'),
 (369,'F.1.0','General'),
 (370,'F.1.1','Models of Computation'),
 (371,'F.1.3','Complexity Classes'),
 (372,'F.2','Analysis of Algorithms and problem Complexity'),
 (373,'F.2.1','Numerical Algorithms and Problems'),
 (374,'F.2.2','Nonnumerical Algorithms and Problems'),
 (375,'F.2.3','Tradeoffs among Complexity Measures'),
 (376,'F.3','Logics and Meaning of Programs'),
 (377,'F.3.1','Specifying and Verifying and Reasoning about Programs'),
 (378,'F.3.2','Semantics of Programming Languages'),
 (379,'F.3.3','Studies of Program Constructs'),
 (380,'F.4','Mathematical Logic and Formal Languages'),
 (381,'F.4.1','Mathematical Logic'),
 (382,'F.4.2','Grammars and Other Rewriting Systems'),
 (383,'F.4.3','Formal Languages'),
 (384,'G.1.0','General'),
 (385,'G.1.3','Numerical Linear Algebra'),
 (386,'G.1.6','Optimization'),
 (387,'G.2.1','Combinatorics'),
 (388,'G.2.2','Graph Theory'),
 (389,'G.2.3','Miscellaneous'),
 (390,'G.3','Probability and Statistics'),
 (391,'G.4','Mathematical Software'),
 (392,'H.','Information Systems'),
 (393,'H.0','General'),
 (394,'H.1','Models and Principles'),
 (395,'H.1.0','General'),
 (396,'H.1.1','Systems and Information Theory'),
 (397,'H.1.2','User/Machine Systems'),
 (398,'H.2','Database Management'),
 (399,'H.2.0','General'),
 (400,'H.2.1','Logical Design'),
 (401,'H.2.5','Heterogeneous Databases'),
 (402,'H.2.6','Database Machines'),
 (403,'H.2.8','Database Applications'),
 (404,'H.2.9','Miscellaneous'),
 (405,'H.3.2','Information Storage'),
 (406,'H.3.3','Information Search and Retrieval'),
 (407,'H.4','Information Systems and Applications'),
 (408,'H.4.0','General'),
 (409,'H.4.1','Office Automation'),
 (410,'H.4.4','Miscellaneous'),
 (411,'H.5','Information Interfaces and Presentation'),
 (412,'H.5.0','General'),
 (413,'H.5.1','Multimedia Information Systems'),
 (414,'H.5.2','User Interfaces'),
 (415,'H.5.3','Group and Organization Interfaces'),
 (416,'I.1.1','Expressions and their Representations'),
 (417,'I.1.2','Algorithms'),
 (418,'I.1.3','Languages and Systems'),
 (419,'I.1.4','Applications'),
 (420,'I.2','Artificial Intelligence'),
 (421,'I.2.0','General'),
 (422,'I.2.1','Applications and Expert Systems'),
 (423,'I.2.10','Vision and Scene Understanding'),
 (424,'I.2.11','Distributed Artificial Intelligence'),
 (425,'I.2.12','Miscellaneous'),
 (426,'I.2.2','Automatic Programming'),
 (427,'I.2.3','Deduction and Theorem Proving'),
 (428,'I.2.4','Knowledge Representation Formalisms and Methods'),
 (429,'I.2.6','Learning'),
 (430,'I.2.7','Natural Language Processing'),
 (431,'I.2.8','Problem Solving - Control Methods - and Search'),
 (432,'I.2.9','Robotics'),
 (433,'I.3','Computer Graphics'),
 (434,'I.3.3','Picture/Image Generation'),
 (435,'I.3.4','Graphics Utilities'),
 (436,'I.3.5','Computational Geometry and Object Modelling'),
 (437,'I.3.7','Three-Dimensional Graphics and Realism'),
 (438,'I.3.8','Applications'),
 (439,'I.3.9','Miscellaneous'),
 (440,'I.4','Image Processing'),
 (441,'I.4.10','Image Representation'),
 (442,'I.4.2','Compression (Coding)'),
 (443,'I.4.7','Feature Measurement'),
 (444,'I.4.8','Scene Analysis'),
 (445,'I.4.9','Applications'),
 (446,'I.5','Pattern Recognition'),
 (447,'I.5.3','Clustering'),
 (448,'I.5.4','Applications'),
 (449,'I.5.6','Miscellaneous'),
 (450,'I.6','Simulation and Modelling'),
 (451,'I.6.0','General'),
 (452,'I.6.2','Simulation Languages'),
 (453,'I.6.3','Applications'),
 (454,'I.6.4','Model Validation and Analysis'),
 (455,'I.6.5','Model Development'),
 (456,'I.7','Text Processing'),
 (457,'I.7.0','General'),
 (458,'I.7.1','Text Editing'),
 (459,'I.7.2','Document Preparation'),
 (460,'I.8','Miscellaneous'),
 (461,'J.0','General'),
 (462,'J.2','Physical Sciences and Engineering'),
 (463,'J.3','Life and Medical Sciences'),
 (464,'J.4','Social and Behavioral Sciences'),
 (465,'J.5','Arts and Humanities'),
 (466,'J.6','Computer Aided Engineering'),
 (467,'K.2','History of Computing'),
 (468,'K.3','Computers and Education'),
 (469,'K.3.0','General'),
 (470,'K.3.1','Computer Uses in Education'),
 (471,'K.3.2','Computer and Information Science Education'),
 (472,'K.4','Computers and Society'),
 (473,'K.4.0','General'),
 (474,'K.4.1','Public Policy Issues'),
 (475,'K.4.2','Social Issues'),
 (476,'K.4.3','Organizational Impacts'),
 (477,'K.6','Management of Computing and Information Systems'),
 (478,'K.6.0','General'),
 (479,'K.6.1','Project and People Management'),
 (480,'K.6.4','System Management'),
 (481,'K.7.2','Organizations'),
 (482,'K.7.4','Miscellaneous'),
 (483,'K.8','Personal Computing'),
 (484,'B.7.4','Miscellaneous'),
 (485,'B.7.3','Reliability and Testing'),
 (486,'B.7.2','Design Aids'),
 (487,'B.7.1','Types and Design Styles'),
 (488,'B.7.0','General'),
 (489,'B.6.4','Miscellaneous'),
 (490,'B.6.3','Design Aids'),
 (491,'B.6.2','Reliability and Testing'),
 (492,'B.6.1','Design Styles'),
 (493,'B.6.0','General'),
 (494,'B.5.4','Miscellaneous'),
 (495,'B.5.3','Reliability and Testing'),
 (496,'B.5.2','Design Aids'),
 (497,'B.5.1','Design'),
 (498,'B.5.0','General'),
 (499,'B.4.6','Miscellaneous'),
 (500,'B.4.4','Performance Analysis and Design Aids'),
 (501,'B.4.1','Data Communication Devices'),
 (502,'B.4.0','General'),
 (503,'B.4','Input/output and Data communications'),
 (504,'B.3.5','Miscellaneous');
/*!40000 ALTER TABLE `field` ENABLE KEYS */;


--
-- Definition of table `interest`
--

DROP TABLE IF EXISTS `interest`;
CREATE TABLE `interest` (
  `FieldNum` int(11) default NULL,
  `AcNum` int(11) default NULL,
  `Descrip` varchar(255) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `interest`
--

/*!40000 ALTER TABLE `interest` DISABLE KEYS */;
INSERT INTO `interest` (`FieldNum`,`AcNum`,`Descrip`) VALUES 
 (334,114,'Automated Theorem Proving - Linear Input - Semantics - Clash'),
 (334,117,'Logic Programming'),
 (334,121,'Logic Programming'),
 (334,133,'Temporal - Modal Logic Programming - Temporal Resolution - Declarat'),
 (334,140,'Logic programming - constraint programming'),
 (334,166,'Higher Order; Lambda Prolog'),
 (334,184,'Logic Programming'),
 (334,251,NULL),
 (334,274,'Semantics'),
 (334,275,'Static analysis'),
 (334,276,'Multi-paradigm - logic programming - OOP'),
 (334,281,'Deductive databases - Semantics - Negation - Implementation'),
 (334,288,NULL),
 (334,289,'Logic Programming - Constraint Logic Programming'),
 (334,292,'Logic Programming - Constraint Logic Programming'),
 (334,322,'Semantics - negation - relation to non-monotonic logic'),
 (334,326,'ATP - Prolog - meta-programming - higher-order extensions - CLP'),
 (334,345,'Logic Programming'),
 (334,352,'Logic Programming using Conceptual Graphs'),
 (334,363,'Concurrent logic programming'),
 (334,402,'Logic Programming'),
 (334,410,'Logic Programming with Conceptual Graphs'),
 (334,430,'Logic Programming'),
 (334,433,'Logic Programming - Prolog'),
 (334,435,NULL),
 (334,444,'Higher-order programming - unification theory'),
 (334,455,'Logic Programming Techniques'),
 (334,465,'Constraint Programming - Logic Programming'),
 (335,190,'Animation of execution'),
 (335,202,'software engineering tools for visual programming'),
 (335,213,'VISUAL PROGRAMMING DIAGRAMMING SYSTEMS'),
 (335,219,NULL),
 (335,229,'Parallel program visualisation - transputers'),
 (335,232,NULL),
 (335,234,NULL),
 (335,352,'Visual Programming using Conceptual Graphs'),
 (335,359,'Textual and graphical mechanisms for recording doc info'),
 (335,361,'Visual programming languages - mechanisms in S/W dev environs'),
 (335,433,'Visual Programming'),
 (336,120,'Genetic programming'),
 (336,133,'Dataflow Computation - Lucid Language'),
 (336,149,'Domain Construction'),
 (336,323,'Persistent Programming'),
 (337,146,'Software engineering - Object-oriented - Tools'),
 (337,170,'Software Engineering'),
 (337,174,'formal methods;specification;refinement;testing'),
 (337,175,NULL),
 (337,190,'SE Standard'),
 (337,191,'Formal Specification - Programming Style'),
 (337,193,'Software Engineering'),
 (337,197,'Correctness of hardware and software'),
 (337,213,'SWE DISCIPLINE DEVELOPMENT SW ARCHITECTURE RE-USE'),
 (337,274,'Debugging - Testing and Verification'),
 (337,275,'Formal methods'),
 (337,303,NULL),
 (337,304,NULL),
 (337,346,'Software reuse'),
 (337,402,'Software Engineering'),
 (337,420,'Testing of GUI applications - distributed testing'),
 (337,422,'Software Engineering; Usability Engineering'),
 (337,454,'SE - OO Analysis and Design Methodologies'),
 (338,107,'SE Standards - Software Quality - Process Modelling'),
 (338,143,'Specifications and techniques'),
 (338,160,NULL),
 (338,190,'General (SWE)'),
 (338,209,NULL),
 (338,227,'Information Systems'),
 (338,229,'Parallel System Development - transputers'),
 (338,317,'Re-Engineering'),
 (338,397,'ISERN Membership'),
 (338,401,NULL),
 (338,416,'Software Engineering - Object-Orientation'),
 (338,432,'Real-Time Systems Design and Verification'),
 (338,446,NULL),
 (338,469,'Software Engineering'),
 (339,102,'Analysis - Specifications'),
 (339,104,'Formal specification of object-oriented programs'),
 (339,115,'Formal specification in Z'),
 (339,122,'Requirements Engineering'),
 (339,138,'Requirements/Specifications'),
 (339,145,'Formal specification'),
 (339,147,'Formal Specs'),
 (339,161,'Requirements/Specifications Methodologies - Soft Systems Approach'),
 (339,169,'Requirements/Specifications'),
 (339,177,'formal specifications - Z - real-time specifications'),
 (339,180,'software verification'),
 (339,184,'Specification'),
 (339,185,'Formal Specification - Object-oriented specification'),
 (339,188,'Requirements/Specifications'),
 (339,190,'High-level Petri nets'),
 (339,200,NULL),
 (339,202,'data transformations - models - languages for specifications'),
 (339,227,'Information Analysis - ER approach - Category Theory technique'),
 (339,317,'Rapid Prototyping'),
 (339,320,'Requirements/Specifications'),
 (339,322,'Executable specifications; specification evolution'),
 (339,335,'Formal methods Object oriented analysis and design'),
 (339,348,'Requirements Engineering'),
 (339,397,'Elicitation - Modelling - Volatility - Engineering - Management'),
 (339,402,'Requirements/Specifications'),
 (339,404,'Formal specification languages - Testing specifications'),
 (339,410,'Program Specification Using Conceptual Graphs'),
 (339,416,'Requirements elicitation - requirements modelling - BPR'),
 (339,421,'User requirements specifications - ooa - ood'),
 (339,422,'Requirements/Specifications; Task Analysis'),
 (339,452,'Transaction Processing'),
 (339,461,NULL),
 (340,102,'Techniques'),
 (340,132,'Design methodology - real-time'),
 (340,138,'Design'),
 (340,180,'formal specification'),
 (340,188,'Safety - trustworthiness'),
 (340,190,'Reachability'),
 (340,230,'OO lifecycle methodologies (analysis and design)'),
 (340,323,'Design Models and Inter-model consistency'),
 (340,370,'Usability and Design Processes'),
 (340,397,'Methods - Meta-tools - Animation - Empirical studies'),
 (340,424,'Real-Time Software Design'),
 (340,443,'Design - Safe and Reliable Software'),
 (340,452,'Batch Transaction processing Systems'),
 (340,455,'Software Design'),
 (340,461,NULL),
 (341,179,'Transformational development.'),
 (341,186,'Reengineering software.'),
 (341,319,'Software Quality Assurance'),
 (341,397,'Socio-technical issues - Technology transfer - BPR'),
 (342,102,'CASE'),
 (342,133,'Reverse Engineering Tools and Techniques - Program Understanding'),
 (342,137,'Documentation tools - Interface tools'),
 (342,138,'Tools and Techniques'),
 (342,152,'Compilers - code optimisation'),
 (342,165,'Software engineering tools and techniques'),
 (342,167,'Automatic tool generation'),
 (342,177,'specification tools - refinement tools'),
 (342,179,'Language sensitive tools. Prototyping.'),
 (342,180,'refinement techniques'),
 (342,184,'Verification tools'),
 (342,188,'Formal methods tools'),
 (342,193,'Integrated Software Engineering Environments - Tool Integration'),
 (342,200,NULL),
 (342,202,'relation between models'),
 (342,230,'CASE tools for supporting OO developments'),
 (342,306,NULL),
 (342,315,'Automated theorem provers'),
 (342,317,'Program Transformation'),
 (342,319,'Analysis and Design Tools'),
 (342,320,'Tools and Techniques'),
 (342,323,'Analysis - Design - Implementation Tools'),
 (342,326,'Tool support for formal methods'),
 (342,335,'Object-Z'),
 (342,348,'Object-Oriented Analysis and Design'),
 (342,350,'User interface builder tools and languages'),
 (342,359,'Support and integrate docs into development process.'),
 (342,361,'Software engineering tools and tool integration'),
 (342,397,'Graph-theory - Models - CASE - Design - Co-design - Animation'),
 (342,404,'Reasoning tools - Theorem provers'),
 (342,406,'Modelling'),
 (342,417,'Compilers - data flow - control flow - decompilers'),
 (342,421,'User driven tools and techniques'),
 (342,447,'Design and analysis tools for concurrency'),
 (342,452,'Dataflow analysis'),
 (342,454,'CASE tools for database applications design'),
 (342,459,NULL),
 (343,104,'Formal verification and derivation of object-oriented programs.'),
 (343,138,'Program Verification'),
 (343,147,'Refinement Calculus'),
 (343,177,'program refinement - real-time refinement'),
 (343,179,NULL),
 (343,184,'Interactive verification'),
 (343,185,'Object-oriented Verification - Refinement'),
 (343,188,'Formal methods'),
 (343,302,NULL),
 (292,100,'Multiprocessor and Special purpose computer design'),
 (293,100,'General (HW)'),
 (293,197,'Computer architecture'),
 (293,365,'Computer Design'),
 (293,425,'Parallel Computer Architecture'),
 (293,443,'Performance Analysis - Reliability and Fault Tolerance'),
 (294,100,'Control Structures and Microprogramming'),
 (295,130,'Networks'),
 (296,168,'Microcode - Numerical Analysis'),
 (296,213,'TAILORED MICRO-ENGINES - PROGRAMMABLE MICROENGINES'),
 (296,440,'Microcode - Numerical Analysis'),
 (297,100,'Arithmetic and Logic Structures'),
 (297,356,NULL),
 (297,357,NULL),
 (297,464,'Arithmetic and Logic Structures'),
 (299,100,'Memory Structures'),
 (299,313,'Memory structures - persistent systems - VM architectures'),
 (300,128,'Distributed Shared Memory - memory consistency.'),
 (300,213,'VIRTUAL MEMORY ADDRESSING SCHEMES'),
 (301,128,'Performance of memory systems for DSM.'),
 (301,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (302,209,'Disc Drive Systems and Interfaces'),
 (303,119,'Multistage and Multiple Bus interconnection networks'),
 (303,128,'Multiprocessor interconnection networks - design - evaluation.'),
 (303,130,'Performance'),
 (303,287,'Optical interconnection networks'),
 (304,130,'Interconnections'),
 (305,100,'Register Transfer Level Implementation'),
 (306,100,'Logic Design'),
 (306,302,NULL),
 (306,356,NULL),
 (306,357,NULL),
 (306,464,'Logic Design'),
 (307,100,'Integrated Circuits'),
 (307,356,NULL),
 (307,357,NULL),
 (307,464,'Integrated Circuits'),
 (308,100,'Computer Systems Organization'),
 (308,257,'Computer Systems Organization'),
 (309,100,'Processor Architectures - Parallel Computing'),
 (309,162,'High-Performance Computers'),
 (309,171,NULL),
 (309,197,'Self-timed system'),
 (309,203,'Computer architectures and performance'),
 (309,357,'Systolic Array'),
 (309,425,'Parallel Computer Architecture'),
 (310,119,'Pyramid architectures - mesh architectures'),
 (310,130,'Performance - fault tolerance'),
 (310,138,'Single Data Stream Architectures'),
 (310,233,NULL),
 (310,332,'SIMD architectures and algorithms'),
 (310,345,'SIMD computers - Maspar programming'),
 (311,128,'MIMD architectures and programming.'),
 (311,130,'Performance - fault tolerance'),
 (311,135,'MIMD Parallel Processing'),
 (311,158,'Transputers - Concurrent Sequential Processes (CSP)'),
 (311,229,'Multiple instruction machines - transputers'),
 (311,233,NULL),
 (311,235,'Multiple Data Stream Architectures - parallel processing'),
 (311,287,'Massively parallel MIMD'),
 (311,345,'Transputer Arrays'),
 (311,363,'Nondeterministic CRCW PRAM'),
 (311,365,'Scalable data-parallel computations'),
 (311,369,'MIMD - Interconnection networks'),
 (311,408,'Transputer Applications - Massively Parallel Processors'),
 (311,419,'Parallel processing'),
 (311,425,'Parallel Computer Architecture'),
 (312,130,'Performance - fault tolerance'),
 (312,158,'Analog Neural Networks'),
 (312,170,'Systolic Arrays'),
 (312,233,NULL),
 (312,238,NULL),
 (312,302,NULL),
 (312,353,'Other Architecture Styles'),
 (312,356,NULL),
 (312,462,'MIMD - multiprocessors - heterogeneous systems'),
 (313,178,'Network protocols - LAN - WAN - high-speed networks - distrib system'),
 (313,190,'X.25'),
 (313,309,NULL),
 (313,320,'Computer Communication Networks'),
 (313,426,'Computer Communication Networks'),
 (313,441,'Computer Communication Networks'),
 (313,450,'OSI protocols'),
 (314,145,'Interconnection networks'),
 (314,190,'OSI Protocols'),
 (314,220,NULL),
 (314,221,NULL),
 (314,239,NULL),
 (314,287,'Optical communication'),
 (314,331,'X.400 and X.500'),
 (314,335,'Overview'),
 (315,128,'Network designs for efficient MIMD execution.'),
 (315,130,'Hypercube - Mins'),
 (315,190,'Telecommunications Signalling Systems'),
 (315,236,NULL),
 (315,256,'Network Management - Quality of Service'),
 (315,312,NULL),
 (315,396,'Networking - programming environments - Distributed systems'),
 (316,123,'Lower layer protocols'),
 (316,124,'Test sequence generation - conformance - protocol design - validati'),
 (316,128,'Cache and invalidation protocols for DSM.'),
 (316,164,'High-speed networks - Transport protocols - Network protocols'),
 (316,190,'CCITT No. 7'),
 (316,235,'Network Protocols - Networks Security'),
 (316,236,NULL),
 (316,254,'Application Layer Protocols - X.500'),
 (316,264,NULL),
 (316,302,NULL),
 (316,342,'Reliable Group Communication'),
 (316,396,'Networking - programming environments - Distributed systems'),
 (316,432,'Asynchronous Transfer Mode (ATM) Networks'),
 (316,446,NULL),
 (317,190,'TINA'),
 (317,236,NULL),
 (318,123,'Real-time distributed systems'),
 (318,156,NULL),
 (318,181,'Distributed systems - architectures - environments - ODP'),
 (318,182,'Distributed Systems - Network Management'),
 (318,190,'ODP'),
 (318,195,'Distributed Programming - Distributed Applications - Distributed O'),
 (318,252,'Operating Systems - Database Systems'),
 (318,256,'Network Management - Quality of Service'),
 (318,312,NULL),
 (318,316,'Distributed Systems'),
 (318,329,'Distributed systems - architectures - environs - Open Distributed'),
 (318,330,'Distributed Systems - ODP - Architectures - Environments'),
 (318,331,'Distributed User Interfaces'),
 (318,333,'Distributed systems - architectures - environments - ODP'),
 (318,338,'Distributed Systems'),
 (318,342,'Distributed Tuple Spaces'),
 (318,350,'Distributed user interface infrastructures'),
 (318,356,NULL),
 (318,369,'Architecture - protocols - naming - protection - service.'),
 (318,396,'Networking - programming environments - Distributed systems'),
 (318,442,NULL),
 (318,443,'Distributed Systems - Security - Fault Tolerance - Real-Time Comput'),
 (318,446,NULL),
 (318,450,'Open Distributed Processing'),
 (318,462,'Distributed systems - distributed software engineering'),
 (319,123,NULL),
 (319,190,'Intelligent Networks'),
 (319,221,NULL),
 (319,450,'Local Area Networks - Broadband Networks'),
 (320,164,'Network simulation'),
 (321,100,'High Performance Application Specific Architectures'),
 (321,145,'Systolic systems'),
 (321,233,NULL),
 (321,244,'VLSI Architectures'),
 (321,313,'Persistent architectures'),
 (321,365,'Computer architectures for video compression'),
 (321,375,NULL),
 (322,100,'Performance Tools.'),
 (322,119,'Performance modelling'),
 (322,130,'Interconnection networks'),
 (322,202,'CISC vs. RISC'),
 (322,203,'Modelling and Analysis of systems performance'),
 (322,309,NULL),
 (322,399,'Vector supercomputing - parallel supercomputing'),
 (322,441,'Performance of Systems'),
 (322,443,'Performance of Systems - Modelling - Simulation'),
 (322,450,'Network performance evaluation'),
 (323,162,NULL),
 (324,145,'VLSI computations'),
 (324,233,NULL),
 (324,302,NULL),
 (324,345,'Systolic Arrays'),
 (324,357,NULL),
 (324,365,'VLSI-based parallel computer architecture'),
 (324,464,'VLSI Systems'),
 (325,100,'Software'),
 (325,257,'Software'),
 (326,146,NULL),
 (327,127,NULL),
 (327,135,'Concurrent - Visual and Logic Programming'),
 (327,177,'program refinement - real-time refinement'),
 (327,188,'Formal methods - formal development - refinement - verification'),
 (327,191,'Formal Specification - Programming Style'),
 (327,346,'Multi-paradigm programming'),
 (327,368,'Programming Techniques'),
 (327,426,'Programming Techniques'),
 (328,154,NULL),
 (328,179,NULL),
 (328,217,NULL),
 (328,303,NULL),
 (328,401,NULL),
 (328,411,'Persistent Programming'),
 (328,444,'Design - semantics -implementation'),
 (328,446,NULL),
 (329,120,'Invertible geometric transforms - coordinates systems -first-class'),
 (329,124,'Functional languages (ML)'),
 (329,144,'Functional Programming'),
 (329,157,NULL),
 (329,169,'Applicative (Functional) Programming'),
 (329,179,NULL),
 (329,186,'Debugging - Prototyping - lazy evaluation'),
 (329,251,NULL),
 (329,286,'Logic programming'),
 (329,289,'Applicative (Functional) Programming'),
 (329,317,'Tracing; Types; Extensibility; Higher-order Functions'),
 (329,364,NULL),
 (329,376,'Functional programming'),
 (329,400,'Functional Programming'),
 (329,405,'Applicative Programming'),
 (329,419,'Functional programming'),
 (329,444,'Applicative (Functional) Programming'),
 (329,462,'Parallel functional programming - compilation'),
 (330,158,'Adaptive Programs - Machine Learning'),
 (330,212,'Genetic Programming - Genetic Logic Programming'),
 (330,213,'AUTOMATIC CODE GENERATION'),
 (330,352,'Application of AI techniques to Automated Programming'),
 (330,430,'Automatic programming'),
 (330,452,'Decision Table Translation - Program Transformation'),
 (331,106,'parallel computing'),
 (331,115,'Parallel Programming Paradigms'),
 (331,117,'Concurrent Programming'),
 (331,128,'MIMD programming models - program specification - verification.'),
 (331,132,NULL),
 (331,145,'General purpose parallel programming language'),
 (331,156,NULL),
 (331,157,NULL),
 (331,167,'Concurrent object-oriented systems'),
 (331,171,NULL),
 (331,190,'Petri nets - High-level nets'),
 (331,195,'Distributed Programming - Parallel Programming'),
 (331,202,'Performance - Transputers - algorithms'),
 (331,209,'Parallel Programming'),
 (331,229,'parallel programming - transputers'),
 (331,276,'Multi-paradigm - logic programming - OOP'),
 (331,286,'Logic programming'),
 (331,288,'Parallel logic programming languages'),
 (331,302,NULL),
 (331,320,'Concurrent programming'),
 (331,321,'Language mechanisms - message passing'),
 (331,332,'Synchronization problems'),
 (331,342,'Linda'),
 (331,345,'Concurrent Programming'),
 (331,361,'Parallel programming language design - semantics and implemen'),
 (331,363,'Concurrent logic programming parallel sorting'),
 (331,365,'Programming data-parallel computations'),
 (331,411,'Distribution and Persistence'),
 (331,424,'Concurrent Programming - Real-Time Programming'),
 (331,446,NULL),
 (331,462,'Partitioning and mapping of parallel programs'),
 (331,465,'Concurrent Constraint Programming'),
 (332,115,NULL),
 (332,401,NULL),
 (333,104,'Object-oriented Programming'),
 (333,115,'Object oriented analysis - design and programming'),
 (333,124,'OO languages and applications (Smalltalk - Actor)'),
 (333,132,'Object-oriented - concurrency'),
 (333,137,'C++'),
 (333,138,'Object-oriented Programming'),
 (333,140,'Constraints - object-oriented programming'),
 (333,143,'Object-oriented Programming - C++'),
 (333,147,'Oberon-2'),
 (333,156,NULL),
 (333,160,'Eiffel - C++'),
 (333,167,'Concurrent object-oriented systems'),
 (333,206,'Eiffel - CLOS'),
 (333,218,NULL),
 (333,219,NULL),
 (333,221,NULL),
 (333,226,'Object Models'),
 (333,230,'OO programming'),
 (333,232,NULL),
 (333,234,NULL),
 (333,241,NULL),
 (333,251,NULL),
 (333,252,'Multiple Tool Integration'),
 (333,267,NULL),
 (333,276,'Multi-paradigm - logic programming - OOP'),
 (333,281,'Deductive object-oriented databases'),
 (333,320,'Object-oriented programming'),
 (333,322,'Simula - smalltalk - logic of object inheritance'),
 (333,328,'Reusable software components - toolkits'),
 (333,330,'Object-oriented Programming - C++'),
 (333,331,'C++'),
 (333,348,'Smalltalk'),
 (333,352,'Object-Oriented Design of Conceptual Graph Knowledge Base'),
 (333,361,'Inheritance mechanisms - Simula'),
 (333,367,'Reusable software components - toolkits'),
 (333,371,'Persistence'),
 (333,404,'Semantics - Language design - Object-oriented refinement'),
 (333,410,'Graphical Object Oriented Logic Programming'),
 (333,430,'Object-oriented Programming'),
 (333,444,'Semantics - types - sheaf theory - information systems'),
 (333,446,NULL),
 (333,462,'Object-oriented design and technology'),
 (334,108,'Logic Programming'),
 (388,325,'Shortest Path Problems - Flows'),
 (388,417,'Graph structuring'),
 (388,448,'Graph Theory'),
 (388,452,'Applications to Systems Design - Graph Theoretic Prog. Lang.'),
 (388,462,'Sequential and parallel graph algorithms'),
 (389,176,'Group Theory - Abstract Algebra'),
 (389,237,NULL),
 (389,325,'Combinatorial Optimization - Computational Geometry'),
 (390,139,'Foundations of Statistics; Bayesian Theory'),
 (390,265,NULL),
 (390,441,'Probability and Statistics'),
 (391,176,'Mathematical Software'),
 (391,245,NULL),
 (391,265,NULL),
 (391,372,'Mathematical Software'),
 (392,168,NULL),
 (393,146,'Database management - Information systems - User Interfaces - Multi'),
 (393,182,'General - Database Design - Conceptual Schemas'),
 (393,395,'Information Systems General'),
 (393,457,'Advanced information systems'),
 (394,161,'Soft Systems Approaches to Strategic IS Planning'),
 (394,190,'Business Process Modelling'),
 (394,261,NULL),
 (394,418,'Object-oriented modelling - object-based petri nets'),
 (394,422,'Information Systems'),
 (394,454,'Relational and OO Data Models'),
 (395,190,'General (Models and Principles)'),
 (395,395,'Models and Principles General'),
 (395,435,'Organisational impacts'),
 (396,102,'Systems - Modelling - Theory'),
 (396,139,'Information-theoretic induction'),
 (396,168,'GST - Soft Systems Methodologies'),
 (396,182,'Systems and Information Theory - Relational Theory'),
 (396,322,'General systems - system simplification - homomorphism'),
 (396,395,'Systems and Information Theory'),
 (396,416,'Socio-organisational analysis'),
 (396,461,NULL),
 (397,201,'Human-Computer Interaction'),
 (397,328,'Graphical user interface tools'),
 (397,331,'Human-Computer Interaction'),
 (397,350,'Human-computer interaction'),
 (397,367,'Graphical user interface tools'),
 (397,395,'User/Machine Systems'),
 (397,397,'Multimedia - Mental models - Adaptive interfaces - Meta-models'),
 (397,422,'User/Machine Systems; HCI'),
 (397,423,'Human Computer Interaction - Visualisation'),
 (397,459,NULL),
 (397,461,NULL),
 (398,146,NULL),
 (398,191,'Formal Specification - Database Languages'),
 (398,194,'Schema Versioning - Schema Evolution - Temporal Databases'),
 (398,209,'Parallel / High Performance Database Systems'),
 (398,277,'Database management - systems - theory - query optimization.'),
 (398,298,'Database management'),
 (398,303,NULL),
 (398,368,'Database Management'),
 (398,456,'Database management'),
 (399,111,'Database Management - Distributed databases - Main Memory database'),
 (399,216,NULL),
 (399,240,NULL),
 (399,273,NULL),
 (399,286,'Logic programming'),
 (399,395,'Database Management General'),
 (399,457,'Database design and evolution'),
 (399,461,NULL),
 (399,465,'Constraint Databases - Deductive Databases'),
 (400,155,'Evolution of the Object-Oriented Databases'),
 (400,182,'Logical Design - Performance'),
 (400,196,'database design - database theory - nested relational databases'),
 (400,240,NULL),
 (400,252,'Distributed DB Design - Fragment Allocation - Query Optimisation'),
 (400,266,NULL),
 (400,268,NULL),
 (400,337,'GIS - data distribution design - partitioning'),
 (400,352,'Design techniques'),
 (400,395,'DB Logical Design'),
 (400,406,'Data modelling'),
 (400,421,'Logical design - conceptual design - oo modelling and design'),
 (400,431,'Distributed database'),
 (400,454,'Data modelling for traditional and distributed databases'),
 (400,461,NULL),
 (401,182,'Heterogeneous Databases - Interoperability - Schema Evolution - Sch'),
 (401,263,NULL),
 (401,269,NULL),
 (401,296,'Distributed Heterogeneous Databases - OO Heterogeneous DB'),
 (401,332,'Distributed transaction processing'),
 (401,352,'Modelling techniques and tools'),
 (401,369,'Distributed database systems - concurrency control - transactions'),
 (401,421,'Clients server computing - distributed oodb'),
 (401,431,'Multidatabase - transaction management'),
 (401,461,NULL),
 (402,182,'Database Machines - Join Computation'),
 (403,182,'Database Applications - Integration'),
 (403,295,'text databases'),
 (403,343,'Database - GUI - Application Development'),
 (403,421,'Business process re-engineering'),
 (403,454,'Database applications design and development'),
 (404,133,'Temporal Databases - Deductive Databases'),
 (404,366,'Visual database querying'),
 (404,443,'Database Security'),
 (404,447,'Logical databases - incomplete information'),
 (404,452,'Parallel Batch Transaction Processing'),
 (404,453,'Temporal Databases - Incomplete Databases'),
 (405,194,'Temporal Semantics - Temporal Databases'),
 (405,295,'record structures - record storage - space management'),
 (405,410,'Storing Information in Hierarchies for Compression'),
 (406,121,'Information Search and Retrieval'),
 (406,138,'Information Search and Retrieval'),
 (406,182,'Information Search and Retrieval - Knowledge Discovery'),
 (406,202,'parallel full text'),
 (406,264,NULL),
 (406,275,'Approximate string matching'),
 (406,295,'index structures - index design - string algs - string indexing'),
 (406,351,'Information retrieval'),
 (406,352,'Efficient storage and retrieval tech for partial order sets'),
 (406,393,'Electronic Data Exchange - STAR File Format'),
 (406,394,'Information Retrieval and NL Query Systems'),
 (406,410,'Infor Retrieval using Order and Lattice Theoretic Properties'),
 (406,416,'EDI - Inter-organisational Information Systems'),
 (406,449,'Information Retrieval'),
 (407,146,NULL),
 (407,168,'Human aspects of IS - Computer controls and security'),
 (407,222,'Information Systems and Applications'),
 (407,260,NULL),
 (407,261,NULL),
 (408,129,'Qualitative data'),
 (408,306,NULL),
 (408,395,'Information Systems and Applications General'),
 (408,452,'Batch Transaction Processing'),
 (409,190,'Process engineering'),
 (409,335,'Overview'),
 (409,427,'Office Automation - User Centred Design - Usability Testing - HCI'),
 (410,166,'Geographic Information Systems; Geospatial Reasoning'),
 (410,366,'Hypermedia - instructional technology'),
 (411,145,'Multimedia and graphical user interfaces'),
 (411,146,NULL),
 (411,222,'Information Interfaces and Presentation'),
 (411,260,NULL),
 (411,371,'WWW - Courseware'),
 (411,403,'Learning - exploration'),
 (411,422,'Information Interfaces and Presentation; HCI'),
 (411,440,'Imformation Interfaces and Presentation'),
 (412,198,'Multimedia'),
 (412,433,'HCI (Visualisation - Usability Engineering)'),
 (413,122,'Multimedia Information Systems'),
 (413,182,'Multimedia Information Systems - Interfacing - Integration'),
 (413,213,'MULTIMEDIA AND CASE'),
 (413,214,NULL),
 (413,297,'Hypertext'),
 (413,312,NULL),
 (413,327,'Human-computer interaction - user modelling - info filtering'),
 (413,328,'Sound and animation in graphical interfaces'),
 (413,338,'Multimedia Information systems'),
 (413,351,'Multimodal representation'),
 (413,366,'Multimedia indexing and linking'),
 (413,367,'Sound in graphical interfaces'),
 (413,370,'Instructional Computer Games'),
 (413,373,'Learning - documentation'),
 (413,375,NULL),
 (413,415,NULL),
 (413,423,'Multimedia system design'),
 (413,427,'Multimedia - mm development tools - Human-computer interface'),
 (413,451,'Multimedia databases - storage of high dimensional feature spaces'),
 (413,456,'Multimedia information systems'),
 (413,459,NULL),
 (413,461,NULL),
 (414,137,'Ergonomics - automated creation'),
 (414,144,'User Interfaces'),
 (414,163,'Interface construction and design'),
 (414,198,'User interfaces'),
 (414,201,'Usability aspects'),
 (414,232,NULL),
 (414,234,NULL),
 (414,253,'User Interface Design - Distributed User Interfaces'),
 (414,297,'Animation InterViews'),
 (414,327,'Human-computer interaction - user modelling - info filtering'),
 (414,328,'User interface techniques - prosody in interfaces'),
 (414,331,'Graphical User Interface Design and Evaluation'),
 (414,349,'Human computer interface'),
 (414,350,'User interface design and evaluation'),
 (414,351,'User interface issues and design'),
 (414,355,NULL),
 (414,363,'Natural Language - Speech - OCR'),
 (414,367,'User interface techniques - prosody in interfaces'),
 (414,370,'Beyond Direct Manipulation'),
 (414,373,'Architectural visualisation interfaces'),
 (414,394,'Human-Computer Interaction'),
 (414,395,'User Interface'),
 (414,409,'User interfaces for s/w development tools - Experimental studies'),
 (414,423,'Graphical User Interfaces - Presentation Techniques - Data Vizuali'),
 (414,427,'HCI - Virtual Reality Systems - Gestural Interfaces - Data Visualis'),
 (414,433,'User interfaces'),
 (414,459,NULL),
 (414,461,NULL),
 (415,122,'Cooperative Design Systems'),
 (415,253,'Groupware - Distributed Teamwork'),
 (415,328,'Multi-user graphical interfaces'),
 (415,350,'Synchronous cooperation interfaces for groupware'),
 (415,423,'Groupware - CSCW'),
 (416,120,'Geometric transformations'),
 (417,105,'Parallel algorithms'),
 (417,176,'Algebraic Algorithms'),
 (417,232,NULL),
 (417,233,NULL),
 (417,234,NULL),
 (417,237,NULL),
 (417,240,NULL),
 (417,243,'Polynomial matrix computations'),
 (417,244,'Parallel Algorithms'),
 (417,292,'Algorithms - Constraints - Constraint Satisfaction Algorithms'),
 (417,376,'Algorithm design'),
 (417,431,'Analysis and design - parallel computing'),
 (418,120,'Symbolic algebra - group theory'),
 (418,176,'Algebraic Languages and Systems'),
 (418,465,'Constraint Programming Languages and Systems'),
 (419,120,'Geometric constraints'),
 (419,176,'Algebraic Applications'),
 (420,194,'Inductive Inference - Inductive Learning'),
 (420,303,NULL),
 (420,332,'Temporal and spatial knowledge rep. and reasoning'),
 (420,358,NULL),
 (420,363,'Natural lang learning - automatic classification'),
 (421,108,'Knowledge representation - nonmonotonic reasoning -'),
 (421,117,'General'),
 (421,129,NULL),
 (421,131,NULL),
 (421,205,'connectionist AI - sub-symbolic AI'),
 (421,322,'Logics of Action'),
 (421,377,'Visualization - AI - Robotics - Machine Vision - Genetic Algs'),
 (421,430,'Fuzzy Logic and Neural Networks'),
 (421,432,'Fuzzy Logic - Soft Computing - Intelligent Control'),
 (422,101,'Applications of Nom-monotonic Logics.'),
 (422,108,NULL),
 (422,118,'Applications and Expert Systems'),
 (422,122,'Applications and Expert Systems'),
 (422,126,NULL),
 (422,144,'Expert Systems - Decision Support Systems'),
 (422,148,'Applications of Knowledge-based Systems to Law'),
 (422,155,'Rule Based Systems - Expert Database Systems'),
 (422,172,'Applications and Expert Systems'),
 (422,200,NULL),
 (422,218,NULL),
 (422,248,'monitoring - diagnosis'),
 (422,301,NULL),
 (422,306,NULL),
 (422,307,NULL),
 (422,323,'Integration of ES and Conventional Systems'),
 (422,344,'Knowledge Based Systems'),
 (422,348,'Analysis of goal seeking problems'),
 (422,352,'Course Advising - Financial Planning - Education'),
 (422,393,'Medical Diagnosis'),
 (422,394,'Expert Systems'),
 (422,403,'Intelligent interfaces - adaptivity'),
 (422,430,'Expert systems'),
 (422,444,'Medical informatics'),
 (422,455,'Artificial Intelligence Applications'),
 (422,467,'Applications and Expert Systems'),
 (423,109,'Vision and Scene Understanding'),
 (423,145,'Computer vision'),
 (423,168,'Homomorphisms'),
 (423,187,'Image analysis'),
 (423,225,'Computer vision'),
 (423,334,'Vision and Scene Understanding'),
 (423,338,'Vision and Scene Understanding'),
 (423,341,'Dynamic Scene Understanding'),
 (423,353,'Vision and Scene Understanding'),
 (423,363,'Multimodal ontological learning - simulated robot world'),
 (423,377,'Visualization - AI - Robotics - Machine Vision - Genetic Algs'),
 (423,391,'Feature detection - Motion perception - Wavelet analysis'),
 (423,392,'Vision and Scene Analysis'),
 (423,403,'Cursive script recognition - character recognition - kanji'),
 (423,413,'Perceptual organisation'),
 (423,415,NULL),
 (423,440,'Homomorphisms'),
 (424,100,'Distributed Artificial Intelligence'),
 (424,117,'Distributed Artificial Intelligence'),
 (424,172,'Distributed Artificial Intelligence'),
 (424,199,NULL),
 (424,224,'Neural networks - models of associative memory'),
 (424,225,'Artificial neural networks'),
 (424,255,'Random Neural Netwks - Recruitment Learning - Biologically Pla'),
 (424,298,'Distributed Problem Solving'),
 (424,324,'Rational Agency - Multiagent Planning'),
 (424,338,'Distributed AI'),
 (424,352,'Autonomous Communicating Agents'),
 (424,363,'Multimodal ontological learning - multiple actors - CLP'),
 (424,447,'Mutual epistemic states'),
 (424,450,'Neural Networks'),
 (425,183,'Intelligent tutoring systems'),
 (425,187,'Connectionism - neural networks'),
 (425,370,'Intelligent Microworlds'),
 (425,374,'Music'),
 (425,450,'Vision'),
 (426,125,'Double_Defined_Logic_Programming'),
 (426,158,'Adaptive Programs - Machine Learning'),
 (426,199,'Neural Network'),
 (426,206,'Human program design'),
 (426,352,'Executable Conceptual Structures'),
 (426,375,NULL),
 (426,429,'Epistemic logics'),
 (427,101,NULL),
 (427,103,'Epistemology - Dialogue'),
 (427,108,'belief revision - hypothetical reasoning - truth maintenance'),
 (427,114,'Automated Theorem Proving - Linear Input - Semantics - Clash'),
 (427,117,'Deduction and Theorem Proving'),
 (427,121,'Deduction and Theorem Proving'),
 (427,184,'Interactive theorem proving + tactics + heuristics'),
 (427,188,'Formal software development - software verification'),
 (427,242,NULL),
 (427,322,'Tableau - semantic methods'),
 (427,326,'Automated theorem proving'),
 (427,352,'Theorem Prover using Peirce Logic and Conceptual Graphs'),
 (427,354,'Nonmonotonic reasoning - scientific theory formation'),
 (427,363,'Concurrent logic programming - parallel PROLOG engines'),
 (427,429,'Epistemic logics'),
 (427,444,'Deduction and Theorem Proving'),
 (427,447,'Algorithms for problems in logic'),
 (428,101,NULL),
 (428,103,'Epistemology'),
 (428,108,NULL),
 (428,118,'Knowledge Representation Formalisms and Methods'),
 (428,121,'Knowledge Representation Formalisms and Methods'),
 (428,126,NULL),
 (428,131,NULL),
 (428,139,'Artificial Epistemology'),
 (428,155,'Knowledge Models'),
 (428,183,'Schematic representations'),
 (428,192,'Knowledge Representation - Semantic Nets - Knowledge Normalization'),
 (428,200,'Knowledge Systems Design'),
 (428,205,'memory - neural - neurobiology - representation - cortical'),
 (428,242,NULL),
 (428,290,'non classical logics - inference'),
 (428,298,'Object-Oriented Representations'),
 (428,301,NULL),
 (428,322,'Conceptual graphs - belief revision - ontology revision'),
 (428,324,'Nonmonotonic Reasoning - Belief Revision'),
 (428,335,'Application of formal methods to knowledge representation'),
 (428,338,'Knowledge Representation'),
 (428,351,'KR for NLP'),
 (428,352,'Executable Conceptual Structures - Actor Graphs -Semantic Netw'),
 (428,358,NULL),
 (428,368,'Knowledge Representation Formalisms and Methods'),
 (428,394,'Knowledge Representation Methods'),
 (428,429,'Epistemic logics'),
 (428,438,'Belief Change - Reasoning about Action - Nonmonotonic Reasoning'),
 (428,447,'Epistemic logic - KR formalisms'),
 (428,461,NULL),
 (428,465,'Constraint-based Reasoning'),
 (429,108,NULL),
 (429,109,'Learning'),
 (429,118,'Learning'),
 (429,126,NULL),
 (429,139,'Machine Induction - Bayesian Inference'),
 (429,151,'neural -reinforcement learning - unsupervised learning - credit ass'),
 (429,155,'Knowledge Induction'),
 (429,158,'Unsupervised learning in dynamic systems'),
 (429,166,'Relational Learning; Geospatial Concepts'),
 (429,199,'Machine Learning'),
 (429,205,'adaptive systems - neural networks - Long Term Potentiation'),
 (429,206,'Schema formation and retrieval'),
 (429,212,'Genetic Learning - Neural Networks performance'),
 (429,217,NULL),
 (429,248,'inductive - neural networks - empirical comparison'),
 (429,255,'Random Neural Netwks - Recruitment Learning - Biologically Pla'),
 (429,266,NULL),
 (429,269,NULL),
 (429,298,'Conceptual Clustering'),
 (429,307,NULL),
 (429,310,'Induction - ILP - Hybrid Methods - Applications'),
 (429,311,'Classification - Neural Networks'),
 (429,322,'Induction - hypothesis generation'),
 (429,327,'Machine learning for user modelling'),
 (343,326,'Refinement calculus'),
 (343,376,'Program transformation and verification'),
 (343,402,'Program Verification'),
 (343,404,'Refinement calculi - Tool support'),
 (343,430,'Program verification'),
 (344,107,'Testing Tools'),
 (344,152,'Debuggers'),
 (344,286,'Logic programming'),
 (344,317,'Tracing Functional Programs'),
 (344,359,'Integration of docs and recording of info into test process'),
 (344,402,'Testing and Debugging'),
 (345,122,'Computer-Aided Software Engineering'),
 (345,127,NULL),
 (345,137,'Graphical techniques'),
 (345,138,'Programming Environments'),
 (345,149,NULL),
 (345,167,'software engineering environments'),
 (345,188,'Integration of formal methods'),
 (345,193,'tool - data - control and process integration'),
 (345,202,'parallel programming'),
 (345,226,'Object Oriented Support'),
 (345,232,NULL),
 (345,253,'Language-based Environments - Process-centred Environments'),
 (345,286,'Logic programming'),
 (345,287,'Parallel programming environments'),
 (345,288,'Environments for logic programming languages'),
 (345,317,'Re-engineering Environments'),
 (345,319,'Development Environments and Model Consistency'),
 (345,323,'Architecture of PEs'),
 (345,327,'Environments'),
 (345,328,'Program editing and development tools'),
 (345,359,'Software development environs; integrate docs into process'),
 (345,361,'Software development environments - language-oriented editors'),
 (345,371,'Hyperprogramming - Integrated Environments'),
 (345,397,'Process models - Process modelling - Integration'),
 (345,401,NULL),
 (345,409,'Language-based environments'),
 (345,411,'Programming Environments'),
 (345,446,NULL),
 (345,454,'CASE - Client-Server environments'),
 (346,178,'Open Distributed Processing (ODP)'),
 (346,200,NULL),
 (346,317,'Design Recovery'),
 (347,107,'Software Process Assessment - Reliability - Metric Models'),
 (347,165,'Software Metrics'),
 (347,203,'Software Metrics'),
 (347,215,NULL),
 (347,230,'OO metrics'),
 (347,273,NULL),
 (347,397,'Methods (M3P)'),
 (347,467,'Metrics'),
 (348,107,'Project Management - Quality Management - Quality Improvement - Sof'),
 (348,190,'Design/CPN'),
 (348,200,NULL),
 (348,208,'Software Engineering Management'),
 (348,230,'Management of OO developments and migration paths'),
 (348,259,'Effectiveness of systems development'),
 (348,375,NULL),
 (348,416,'Systems Development Methods'),
 (348,435,NULL),
 (348,461,NULL),
 (348,462,'Distributed software project management tool'),
 (349,159,'Most languages'),
 (349,162,NULL),
 (349,188,'Verifiability - very-high-level prototyping'),
 (349,191,'Language Design - Parsing'),
 (349,204,'type - classes'),
 (349,313,'Persistent programming languages - object-based languages'),
 (349,346,'Programming language implementation - compiler generation'),
 (349,364,NULL),
 (349,368,'Programming Languages'),
 (349,376,'Programming languages'),
 (349,425,'Parallel Computer Architecture'),
 (349,426,'Programming Languages'),
 (350,138,'General (PL)'),
 (350,153,NULL),
 (350,154,NULL),
 (350,155,'Compiler'),
 (350,167,'Programming language constructs'),
 (350,213,'APPLICATION SPECIFIC'),
 (350,287,'Dataflow languages'),
 (350,303,NULL),
 (350,401,NULL),
 (350,411,'Persistence - Type Checking - Binding Mechanisms'),
 (350,417,'Imperative languages'),
 (350,446,NULL),
 (350,462,'Parallel declarative language implementation'),
 (351,120,'Syntax for algebra of geometric transforms'),
 (351,138,'Formal Definitions and Theory'),
 (351,149,NULL),
 (351,157,NULL),
 (351,179,NULL),
 (351,243,'Parallel Programming paradigms'),
 (351,251,NULL),
 (351,289,'Formal Definitions and Theory'),
 (351,292,'Formal Definitions and Theory'),
 (351,295,'type theory - type checking - dataflow analysis'),
 (351,302,NULL),
 (351,317,'Extensibility'),
 (351,361,'Operational semantic definition of programming languages'),
 (351,444,'Formal Definitions and Theory'),
 (351,446,NULL),
 (352,149,NULL),
 (352,289,'Modes of Computation - Alternation and Nondeterminism'),
 (353,115,NULL),
 (353,128,'Constructs for implicit and explicit control of parallelism.'),
 (353,129,'LISP/CLOS'),
 (353,132,'Ada - generics - concurrency - modules'),
 (353,137,'Object-oriented - Multi-paradigm'),
 (353,138,'Language Constructs and Features'),
 (353,149,NULL),
 (353,152,'Object oriented languages'),
 (353,153,NULL),
 (353,157,NULL),
 (353,160,'Object Oriented Extensions'),
 (353,164,'Programming Language Design'),
 (353,179,NULL),
 (353,184,'Design of Prolog extensions'),
 (353,251,NULL),
 (353,276,'Multi-paradigm - logic programming - OOP'),
 (353,281,'Deductive database language features'),
 (353,287,'Parallel constructs'),
 (353,289,'Language Constructs and Features'),
 (353,292,'Language Constructs and Features'),
 (353,317,'Expressive Completeness; types'),
 (353,321,'Language design (particularly for parallelism)'),
 (353,323,'Language Design esp. for Persistence'),
 (353,342,'Linda'),
 (353,345,'Programming Languages Design and Implementation'),
 (353,353,'Language Constructs and Features'),
 (353,361,'Coroutines - parallel processes - message-passing comm constru'),
 (353,363,'Concurrent logic programming'),
 (353,365,'Compilation for data-parallel computation'),
 (353,401,NULL),
 (353,446,NULL),
 (353,452,'Relational Programming'),
 (353,462,'Concurrency - parallelism - polymorphism'),
 (353,465,'Logic- and Constraint-based Languages'),
 (354,127,NULL),
 (354,138,'Processors'),
 (354,154,'Compiler - Modula-2'),
 (354,155,'Assembly'),
 (354,160,'Preprocessors - Compilers'),
 (354,179,NULL),
 (354,253,'Compilers - Language-based Editors'),
 (354,288,'Implementation of logic programming languages'),
 (354,289,'Processors - Compilers - Optimization'),
 (354,317,'Preprocessing; Parsing'),
 (354,330,'Compilers'),
 (354,361,'Compilers and interpreters'),
 (354,363,'Concurrent logic programming parallel PROLOG engines'),
 (354,369,'Parallel implementation of declarative and OO languages'),
 (354,401,NULL),
 (354,409,'Language-based editors'),
 (355,100,'Operating Systems'),
 (355,162,'Compilers and Languages - Parallel Computing - Restructuring Compi'),
 (355,203,'Operating systems and their performance'),
 (355,309,NULL),
 (355,313,'Operating system support for persistence'),
 (355,426,'Operating Systems'),
 (356,138,'General (OS)'),
 (356,181,'Operating systems'),
 (356,219,NULL),
 (356,226,'Persistent Systems'),
 (356,369,'Parallel/distributed operating systems'),
 (356,401,NULL),
 (356,432,'Real-Time Operating Systems'),
 (356,442,NULL),
 (356,446,NULL),
 (357,100,'Distributed computation'),
 (357,195,'Load Balancing - Process Migration'),
 (357,267,NULL),
 (357,369,'Threads - scheduling'),
 (357,442,NULL),
 (358,100,'Persistent storage.'),
 (358,238,NULL),
 (358,323,'Persistent Stores'),
 (358,411,'Persistence - Object Caches - Object Storage - Stability'),
 (359,178,'Distributed operating systems - communication protocols'),
 (359,195,'Distributed OS - Message Passing - Remote Procedure Call'),
 (359,369,'Mutual exclusion - message passing - remote procedure call'),
 (360,153,NULL),
 (360,156,'OS security - distributed systems'),
 (360,243,'Multimodal input security in transaction processing'),
 (360,264,NULL),
 (360,442,NULL),
 (360,443,'Software Security and Protection'),
 (361,121,'Operating Systems Organization and Design'),
 (361,123,'Distributed operating systems'),
 (361,138,'Organization and Design'),
 (361,156,'OS design - concurrency - OOP'),
 (361,164,'Distributed Operating Systems'),
 (361,195,'Distributed OS'),
 (361,238,NULL),
 (361,312,NULL),
 (361,396,'Networking - programming environments - Distributed systems'),
 (361,442,NULL),
 (361,446,NULL),
 (362,128,'Parallel systems - multiuser performance.'),
 (362,238,NULL),
 (362,411,'Code Generation - Efficent Object Manipulation'),
 (362,443,'Performance of Software Systems'),
 (363,138,'Systems programs and Utilities'),
 (363,396,'Networking - programming environments - Distributed systems'),
 (364,111,'Data structures'),
 (364,132,NULL),
 (364,176,'Data Structures'),
 (364,179,'Algebraic Abstract Data Types'),
 (364,232,NULL),
 (364,233,NULL),
 (364,234,NULL),
 (364,237,NULL),
 (364,278,'Self-adjusting data structures'),
 (364,285,'data compression - index compression - image compression'),
 (364,314,'Data Structures'),
 (364,375,NULL),
 (364,448,'Data Structures'),
 (364,451,'Data structures - hash file'),
 (364,456,'Data storage representations'),
 (365,132,'arrays - strings - lists - trees'),
 (365,235,'Data Storage representations'),
 (365,255,'Data Compression'),
 (365,337,'Spatial data - raster - vector'),
 (365,359,'Storing docs and defining relationships between elements.'),
 (365,408,'Geographic Information Systems (GIS)'),
 (365,411,'Code and Data as Objects'),
 (366,132,'B-trees - multikey - inverted'),
 (366,138,'Files'),
 (366,285,'file structures'),
 (366,295,'database file structures'),
 (366,408,'Geographic Information Systems (GIS)'),
 (366,451,'File structures - perfect hashing'),
 (367,190,'Miscellaneous (Abstract Data Types - Algebraic Nets)'),
 (367,363,'Natural language learning - corpus analysis'),
 (368,190,'FSA'),
 (369,190,'General (Computational Theory)'),
 (370,113,'Models of Computation'),
 (370,145,'PRAM model'),
 (370,149,NULL),
 (370,158,'Neural Networks - Computation by Dynamic Systems'),
 (370,190,'Petri nets - concurrency'),
 (370,199,'Genetic Algorithms'),
 (370,302,NULL),
 (370,320,'Models of Computation - petri nets'),
 (370,342,'Linda Operators'),
 (371,113,'Complexity Classes'),
 (371,436,'Complexity Classes'),
 (372,145,'Sequential and parallel algorithms'),
 (372,212,'Approximation and VC dimension'),
 (372,436,'Algorithms - Complexity'),
 (372,448,'Analysis of Algorithms and Problem Complexity'),
 (372,464,'Analysis of Algorithms and problem Complexity'),
 (373,176,'Numerical Algorithms and Problems'),
 (373,243,'Parallel numerical computation-complexity'),
 (373,271,NULL),
 (374,106,'constraint satisfaction - number-theoretic algorithms'),
 (374,113,'Nonnumerical Algorithms and Problems'),
 (374,132,'Sorting - searching'),
 (374,176,'Nonnumerical Algorithms and Problems'),
 (374,232,NULL),
 (374,233,NULL),
 (374,234,NULL),
 (374,235,'Non-numerical algorithms and problems'),
 (374,237,NULL),
 (374,278,'Sorting and searching - adaptive sorting'),
 (374,285,'sorting and searching algorithms - adaptive sorting'),
 (374,400,'Computational Geometry'),
 (374,444,'Unifiability - equational unification and matching'),
 (374,447,'Algorithms and complexity of problems in logic'),
 (374,448,'Nonnumerical Algorithms and Problems'),
 (375,113,'Tradeoffs among Complexity Measures'),
 (376,204,NULL),
 (376,346,'Attribute grammars - denotational semantics'),
 (376,364,NULL),
 (376,368,'Logics and Meaning of Programs'),
 (376,465,'Logic- and Constraint-based Languages'),
 (377,147,'Weakest preconditions - Refinement'),
 (377,157,NULL),
 (377,169,'Specifying and Verifying and Reasoning about Programs'),
 (377,177,'program refinement - real-time refinement'),
 (377,180,'logical foundations of software engineering'),
 (377,184,'Specification/verification'),
 (377,197,'Integrated circuit design'),
 (377,286,'Logic programming'),
 (377,289,'Specification - Verification'),
 (377,302,NULL),
 (377,316,'Reasoning about Distributed Systems'),
 (377,322,'Correctness'),
 (377,326,'Reasoning about imperative and logic languages'),
 (377,404,'Refinement calculi - Tool support'),
 (377,419,'Automated program analysis'),
 (377,447,'Reasoning about knowledge in distributed systems'),
 (378,115,'Programming language semantics'),
 (378,140,'Semantics based program analysis'),
 (378,147,'Denotational Semantics'),
 (378,149,NULL),
 (378,167,'Programming language semantics'),
 (378,169,'Semantics of Programming Languages'),
 (378,177,'specification languages'),
 (378,184,'Semantics'),
 (378,185,'Denotational - Axiomatic - Operational'),
 (378,204,'categories'),
 (378,251,NULL),
 (378,274,'Fixpoint Theory'),
 (378,281,'Semantics of logic programs'),
 (378,289,'Semantics of Programming Languages'),
 (378,292,'Semantics of Programming Languages'),
 (378,302,NULL),
 (378,317,'Denotational Semantics'),
 (378,361,'Operational semantic definition of programming languages'),
 (378,437,'Markovian'),
 (378,444,'Declarative languages'),
 (378,446,NULL),
 (378,462,'Language design - interpreters'),
 (379,115,'Design of Programming Languages - Persistent Languages'),
 (379,177,'specification constructs'),
 (379,317,'Expressivness'),
 (379,446,NULL),
 (380,191,'Grammars - Formal Languages - Parsing - Error Handling'),
 (380,440,'Mathematical Logic and Formal Languages'),
 (381,101,'Non-monotonic Logics.'),
 (381,103,'Classical Logic - Non-classical Logic'),
 (381,108,'Logic'),
 (381,114,NULL),
 (381,117,'Mathematical Logic'),
 (381,129,NULL),
 (381,133,'Temporal and Modal Logics and Their Applications'),
 (381,169,'Mathematical Logic'),
 (381,242,NULL),
 (381,251,NULL),
 (381,322,'non-monotonic logic - modal logic - deviant logic'),
 (381,324,'Situation Semantics - Conditional Logic'),
 (381,352,'Peirce Logic - Predicate calculus'),
 (381,363,'Concurrent logic programming parallel PROLOG engines'),
 (381,438,'Logic and Computation'),
 (381,444,'Mathematical Logic'),
 (381,447,'Modal logic'),
 (381,465,'First-order logic - Non-Monotonic Logics'),
 (382,120,'Symbolic algebra - group theory'),
 (382,137,'Specification techniques - Parsing techniques'),
 (382,141,'L-Systems'),
 (382,149,NULL),
 (382,169,'Grammars and Other Rewriting Systems'),
 (382,192,'Grammars - Language Understanding'),
 (382,204,'lambda-calculus'),
 (382,250,'Programming languages - natural languages'),
 (382,276,'Parsing - logic programming'),
 (382,295,'tree grammars'),
 (382,317,'Multiple Context-free'),
 (382,352,'Syntax and Compilers'),
 (382,363,'Concurrent logic programming - natural language learning'),
 (382,444,'Higher-Order Term Rewriting Systems'),
 (383,113,'Formal Languages'),
 (383,190,'High-level Petri nets - analysis - facts - tools - Design/CPN'),
 (383,192,'Formal Languages - Automata - also Formal Semantics'),
 (383,302,NULL),
 (383,320,'Formal Languages - High-level Petri Nets'),
 (383,395,'Formal Languages and Automata'),
 (383,416,'Z - Object-Z'),
 (384,120,'Surface modelling - solids modelling'),
 (384,255,NULL),
 (384,372,'General'),
 (384,414,'Fourier Methods - Wavelets'),
 (385,176,'Numerical Linear Algebra'),
 (385,231,'parallel algorithms for linear algebra and optimization'),
 (385,243,'G-inverse computations'),
 (385,244,'Numerical Linear Algebra'),
 (385,372,'Numerical Linear Algebra'),
 (386,199,'Genetic Programming'),
 (386,231,'parallel algorithms for linear algebra and optimization'),
 (386,414,'Non-linear Optimisation'),
 (386,415,NULL),
 (387,113,'Combinatorics'),
 (387,176,'Combinatorics'),
 (387,232,NULL),
 (387,240,NULL),
 (388,120,'Surface and polyhdron modelling'),
 (388,176,'Graph Theory'),
 (388,191,'Algorithmic Graph Theory'),
 (388,232,NULL),
 (388,240,NULL),
 (388,255,'Random Networks'),
 (460,337,'Geographic Information Systems (GIS)'),
 (461,201,'Stability in systems development'),
 (462,106,'computational science'),
 (462,224,'Monte Carlo and Molecular Dynamics simulations'),
 (462,272,NULL),
 (462,414,'Optical Diagnostics - Interferogram Analysis - Tomography'),
 (462,434,'Urban Climatology'),
 (462,461,NULL),
 (463,141,'Botanical Models.'),
 (463,145,'Protein structure prediction'),
 (463,228,'Kinematics'),
 (463,255,'Random Neural Netwks - Recruitment Learning - Biologically Pla'),
 (463,311,'Molecular Biology'),
 (463,321,'Bioinformatics - Computational Molecular Biology'),
 (463,340,'Modelling - Simulation - Image Processing - Pattern Recognition'),
 (463,375,NULL),
 (463,391,'Confocal microscopy - 3D surface detection'),
 (463,392,'Biological Applications - Image processing'),
 (463,400,'Medical Imaging'),
 (464,129,'Qualitative data'),
 (464,131,NULL),
 (464,363,'Natural lang learning - corpus analysis - Cognitive Linguistic'),
 (464,407,'Social and Behavioural Sciences'),
 (464,435,'Formal models of organisation theories'),
 (464,466,'Computer Applications - Social and Behavioural sciences'),
 (465,141,'Computer based art - interactive and electronic art.'),
 (465,226,'Computing in Archaeology'),
 (465,373,'Product design and presentation'),
 (466,186,'Language extension.'),
 (466,190,'Protocol Engineering - Process Engineering'),
 (466,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (466,296,'Intelligent Manufacturing - Automated Manufacturing'),
 (466,373,'Photorealistic rendering'),
 (466,442,NULL),
 (466,461,NULL),
 (467,159,'History of Computing'),
 (467,213,'EVOLUTION OF REGIONAL INDUSTRIES'),
 (467,276,'History of computing - logic programming'),
 (467,375,NULL),
 (467,401,NULL),
 (468,198,'Education'),
 (468,218,NULL),
 (468,373,'Distance learning multimedia'),
 (468,405,'Computers and Examinations'),
 (469,129,'Intelligent CAL'),
 (469,201,'Education at secondary and tertiary levels'),
 (470,101,'Computer aided teaching of Discrete Mathematics.'),
 (470,103,'Dialogue'),
 (470,137,'Computer-mediated presentation - hypertext'),
 (470,183,'Graphical educational systems'),
 (470,202,'teaching parallel programming - Computer Mediated Conferencing'),
 (470,273,NULL),
 (470,281,'Air Traffic Control simulation and student evaluation'),
 (470,327,'Intelligent learning environments'),
 (470,370,'Computer-Aided Learning'),
 (470,371,'Courseware - Multimedia - WWW'),
 (470,375,NULL),
 (470,394,'Intelligent Tutoring and Help Systems'),
 (470,453,'WWW'),
 (471,137,'Computer-mediated presentation - hypertext'),
 (471,169,'Computer and Information Science Education'),
 (471,213,'SOFTWARE ENGINEERING EDUCATION'),
 (471,272,NULL),
 (471,307,NULL),
 (471,319,'Software Engineering Education'),
 (471,323,'Software Engineering Education'),
 (471,327,'Computer Science Education - Learning programming'),
 (471,375,NULL),
 (471,401,NULL),
 (471,462,'First course in programming - programming paradigms'),
 (472,168,'Social and organisational impacts of computing'),
 (472,456,'Computers and society'),
 (473,201,'Public policy and social issues'),
 (473,335,'Overview'),
 (473,395,'Management of Computing and Information Systems'),
 (474,111,'Public Policy Issues'),
 (474,188,'Safety of computer-based systems'),
 (474,213,'Industry policy - regulation - computer pornography - violence'),
 (475,111,'Social Issues'),
 (475,231,'parallel algorithms for linear algebra and optimization'),
 (475,239,NULL),
 (475,395,'Computer and Society - Social Issues'),
 (475,428,'Privacy - Productivity'),
 (476,102,'Organization - Impacts'),
 (476,261,NULL),
 (476,349,'Strategic planning - Impact of IT on job/task organisation'),
 (476,407,'Social Issues - Organisational Impacts'),
 (476,428,'IT Change management'),
 (477,168,'- Computer Management in organisations.'),
 (477,175,NULL),
 (477,227,'Information System Management Strategy'),
 (477,259,'Info management - commercialization of s/w and computer service'),
 (477,261,NULL),
 (477,303,NULL),
 (477,418,'Organisational change - management of innovation'),
 (477,421,'Information technology productivity issues'),
 (477,464,'Management of Computing and Information Systems'),
 (478,407,'General (Management of Computing and IS)'),
 (479,190,'Process Engineering'),
 (479,208,'Project Management'),
 (479,259,'Systems design and development'),
 (479,268,NULL),
 (479,407,'Project and People Management'),
 (479,428,'User/Develper Relations - Support Management'),
 (479,461,NULL),
 (479,464,'Project and People Management'),
 (480,102,'Management'),
 (480,239,NULL),
 (480,259,'Quality management systems'),
 (481,159,'DECUS'),
 (482,208,'Software Quality Assurance'),
 (483,159,'Getting the most from the PC'),
 (485,444,'Verification principles'),
 (486,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (487,357,'FPGA'),
 (487,365,'VLSI Design'),
 (490,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (492,357,'Asynchronous Logic'),
 (496,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (500,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (501,336,'Networking'),
 (504,360,'Molecular memories - polyacetylene soliton'),
 (508,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (510,213,'DESIGN ALU ARITHMETIC INSTRUCTION PROCESSING UNITS'),
 (513,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (515,213,'GENERAL DESIGN STRUCTURE MICROCODE'),
 (516,223,'Computer Control Systems - Embedded control systems'),
 (516,360,'Molecular electronic devices - polyacetylene soliton'),
 (518,213,'RISC CISC APPLICATION DEPENDANT'),
 (518,220,NULL),
 (518,335,'Overview of architectural styles'),
 (520,213,'Mainframed architectured PC\"s'),
 (520,215,NULL),
 (520,220,NULL),
 (520,397,'Co-design'),
 (526,359,'Integration of docs into coding process; tools and environ.'),
 (527,350,'User interface definition languages'),
 (527,437,'Categorical'),
 (527,443,'Real-Time Systems'),
 (528,369,'Parallel and distributed file systems'),
 (529,342,'Fault-Tolerance'),
 (529,369,'Stable storage'),
 (529,443,'Software System Reliability'),
 (530,327,'CPU scheduling - Fairshare scheduling'),
 (534,240,NULL),
 (534,264,NULL),
 (535,212,'Information theory - NLU - representational complexity'),
 (535,255,'Data Compression'),
 (535,295,'data compression - index compression'),
 (535,363,'Natural language learning - corpus analysis'),
 (535,436,'Algebraic Coding Theory'),
 (535,464,'Coding and Information Theory'),
 (537,458,'Theoretical Computer Science'),
 (538,314,'Complexity'),
 (539,224,'Complexity issues in neural networks'),
 (540,314,'Algorithms'),
 (544,290,'non classical logics - inference'),
 (544,315,'Nonclassical logics'),
 (547,372,'Mathematics of Computing'),
 (549,245,NULL),
 (549,271,NULL),
 (549,352,'General'),
 (549,372,'Numerical Analysis'),
 (549,399,'Low-dimensional simulation - discrete approximation'),
 (549,436,'Interpolation - Approximation - Linear Algebra - Quadrature'),
 (550,414,'Fractal Interpolation - Splines - Adaptive Interp - Neural Networks'),
 (552,372,'Quadrature and Numerical Differentiation'),
 (555,266,NULL),
 (555,442,NULL),
 (557,231,'parallel algorithms for linear algebra and optimization'),
 (558,212,'Learning of Discrete Models'),
 (558,352,'General'),
 (558,436,'Combinatorics - Graph Theory - Optimisation'),
 (558,448,'Discrete Mathematics'),
 (558,464,'Discrete Mathematics'),
 (561,366,'Hypermedia modelling'),
 (562,295,'database implementation - database file structures'),
 (562,451,'File structures'),
 (563,251,NULL),
 (563,281,'Query languages - Update languages'),
 (563,292,'Languages - Deductive Databases - Query Optimization'),
 (563,295,'query languages'),
 (630,339,'Real-Time Systems - Fault-Tolerant Computing'),
 (630,450,'Adpative systems'),
 (630,467,'Increasing female participation in tertiary computing'),
 (563,317,'Conversion'),
 (563,461,NULL),
 (563,465,'Constraint Databases - Query Optimization - Integrity Constraints'),
 (564,288,'Deductive database systems'),
 (564,316,'Transaction Management'),
 (564,333,'Concurrency - distributed systems - transaction processing'),
 (564,421,'Implementation - diffusion - distributed'),
 (564,433,'Object-Oriented Databases'),
 (564,454,'Client-Server environments and tools'),
 (566,440,'Imformation Storage and Retrieval'),
 (566,456,'Information storage and retrieval'),
 (567,287,'Internet information management'),
 (568,351,'Meaning extraction - message processing'),
 (568,352,'Indexing and retrieval using deep level knowledge'),
 (568,366,'Dynamic linking - querying and linking'),
 (568,394,'Content/Meaning Analysis of Text'),
 (569,331,'Resource Discovery Integration'),
 (571,335,'Applications of Expert systems to'),
 (573,456,'Document management systems'),
 (574,350,'Electronic meeting systems'),
 (574,456,'Groupware'),
 (581,327,'User modelling'),
 (581,354,'Prolog implementation'),
 (581,363,'Concurrent logic programming - parallel PROLOG engines'),
 (581,410,'Peirce: A Conceptual Graph based AI Workbench'),
 (581,429,'Epistemic logics'),
 (582,228,'Scientific Visualisation'),
 (582,375,NULL),
 (582,377,'Visualization - AI - Robotics - Machine Vision - Genetic Algs'),
 (586,225,'Digital image processing'),
 (586,229,'Application of transputers'),
 (586,233,NULL),
 (586,377,'Visualization - AI - Robotics - Machine Vision - Genetic Algs'),
 (586,391,'Image processing software libraries'),
 (586,414,'Fourier Methods'),
 (588,391,'Forensic Images'),
 (589,244,'Image Restoration'),
 (590,430,'Image Reconstruction'),
 (593,315,'Data modelling'),
 (594,430,'Fuzzy C-means Clustering'),
 (597,271,NULL),
 (597,322,'Rule extraction from behavior - rare events - regeneration'),
 (597,430,'Simulation Theory'),
 (599,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (599,263,NULL),
 (600,430,'Fuzzy Simulation'),
 (602,285,'inverted files - algorithms - index compression'),
 (602,295,'inverted files - algorithms - index compression'),
 (602,351,'Intelligent index generation'),
 (602,394,'Index Generation'),
 (602,440,'Text processing - index generation'),
 (604,298,'Geographic Information Systems'),
 (605,416,'Commercial Information Systems'),
 (606,262,NULL),
 (606,408,'Application of Global Positioning Systems (GPS)'),
 (606,440,'Computers in Other Systems'),
 (607,321,'Detection of Suspected Plagiarism'),
 (607,337,'GIS Applications (Agriculture - Mining)'),
 (607,365,'Telemeeting systems'),
 (609,458,'History of Mathematics'),
 (610,213,'INFORMATION INDUSTRY STRUCTURE'),
 (614,335,'Overview'),
 (615,213,'SOFTWARE PROTECTION COPYRIGHT INTELLECTUAL PROPERTY'),
 (615,375,NULL),
 (619,213,'SOFTWARE PROJECT MANAGEMENT'),
 (619,375,NULL),
 (620,213,'RETROFITTING SECURITY'),
 (620,216,NULL),
 (620,239,NULL),
 (620,240,NULL),
 (620,243,'Security control in On-line transaction processing'),
 (620,258,'Device drivers'),
 (620,264,NULL),
 (620,296,'Security Modelling - Security in OO Databases'),
 (620,336,'Network security - Financial security - Privacy'),
 (621,407,'Miscellaneous (Management of Computing and IS)'),
 (625,213,'Professional standards'),
 (625,259,'Quality certification of software development'),
 (626,339,'Parallel Algorithms - Embedding - Load Balancing - Scheduling'),
 (627,259,'Provision and use of microcomputer packages'),
 (627,307,NULL),
 (627,339,'Applications of Parallel Computers'),
 (627,375,NULL),
 (627,414,'Spreadsheets - Hypercard'),
 (628,339,'Parallel Architectures - Multiprocessor Designs'),
 (628,414,'Macintosh'),
 (629,343,'Management - End User Computing'),
 (629,349,'End-user computing'),
 (630,212,'Adaptive methods'),
 (429,334,'Learning'),
 (429,347,'Theory of Inductive Inference - Natural Language Acquisition'),
 (429,352,'Neural Network - Planning Knowledge Acquisition'),
 (429,363,'Natural lang learning - corpus analysis - auto classification'),
 (429,374,'Neural Networks - Decision Trees - Reinforcement Learning'),
 (429,375,NULL),
 (429,413,'Neural networks theory and applications'),
 (429,429,'Epistemic logics'),
 (429,439,'Statistical Learning - Probabilistic Modeling'),
 (429,440,'Artificial Intelligence - Learning - Natural Language Processing'),
 (429,450,'Learning (Neural Networks)'),
 (429,461,NULL),
 (429,469,'Machine Learning and Neural Networks'),
 (430,121,'Natural Language Processing'),
 (430,134,'connectionist approaches - word sense disambiguation'),
 (430,137,'Scene description'),
 (430,155,'Natural Language Machine Translation'),
 (430,173,'Grammars and parsers - Concepts of computer intelligence'),
 (430,192,'Natural Language Understanding - Semantics'),
 (430,212,'Natural language understanding - Measures of comprehension'),
 (430,250,'Grammar - syntax - constraints'),
 (430,272,NULL),
 (430,307,NULL),
 (430,324,'HPSG Parsing'),
 (430,344,'Man-Machine Interface'),
 (430,347,'Combined Statistical and Symbolic Approaches'),
 (430,351,'NLP - computational linguistics - text generation'),
 (430,352,'Semantic Interpreter - Anaphor Resolution'),
 (430,363,'Natural lang learning - corpus analysis - auto classification'),
 (430,394,'Natural Language Processing and Text Generation'),
 (430,430,'Natural Language Processing'),
 (430,439,'Statistical NLP - Compound Nouns'),
 (430,440,'Artificial Intelligence - Learning - Natural Language Processing'),
 (431,100,'Simulated Annealing - Heuristics - GA and Linear Programming'),
 (431,108,NULL),
 (431,151,'control - rule extraction'),
 (431,158,'Problem Solving - Control Methods - and Search - Real time sensori'),
 (431,193,'blackboard systems - agent integration - control in distributed pr'),
 (431,206,'Content-based search - design - planning');
INSERT INTO `interest` (`FieldNum`,`AcNum`,`Descrip`) VALUES 
 (431,307,NULL),
 (431,352,'Automated Planning - Plan Merging - Plan Fusion'),
 (431,363,'Heuristic control in logic programming'),
 (432,108,NULL),
 (432,120,'Geometric constraint problems'),
 (432,145,'Robotics'),
 (432,158,'Autonomous Vehicles'),
 (432,223,'behaviour based robotics - autonomous robots - biological cont'),
 (432,235,'Robotics - legged locomotion - motion planning'),
 (432,353,'Robotics'),
 (432,363,'Multimodal ontological learning - simulated robot world'),
 (432,374,'Evolution - Controllers'),
 (432,377,'Visualization - AI - Robotics - Machine Vision - Genetic Algs'),
 (432,391,'Kinematics - Motion representation - Mobile robot navigation'),
 (432,392,'Robotics'),
 (433,105,NULL),
 (433,141,'Rendering - Ray-tracing - radiosity -shading models - visualisation -'),
 (433,257,'Computer Graphics'),
 (433,304,NULL),
 (433,355,NULL),
 (433,373,'Visualisation animation raytracing'),
 (433,420,'X Window System'),
 (434,116,'Particle Light Scattering in the Atmosphere.'),
 (434,120,'Wireframe - polygon surfaces'),
 (434,137,'Fast rendering'),
 (434,375,NULL),
 (435,137,'Object-oriented libraries'),
 (436,116,'Modelling Atmospheric Objects.'),
 (436,120,'Functional graphics programming - articulated figures - data struc'),
 (436,137,'Isoluminance contouring'),
 (436,232,NULL),
 (436,234,NULL),
 (436,235,'Computational Geometry - animation - path planning'),
 (436,237,NULL),
 (436,353,'Computational Geometry and Object Modelling'),
 (436,375,NULL),
 (436,400,'Solid Modelling'),
 (437,105,'VISUALISATION'),
 (437,116,'An Atmospheric Cloud Model for Deterministic and Non-Determinist'),
 (437,120,'Functional graphics programming'),
 (437,145,'Volume visualisation'),
 (437,375,NULL),
 (438,163,'Graphics with geographic data'),
 (438,249,'Graphical Hardware Description and Simulation'),
 (438,253,'Graphical Presentation of Software'),
 (438,363,'Simulated robot world'),
 (438,375,NULL),
 (438,400,'Volume Visualization'),
 (438,434,'Scientific Visualisation'),
 (439,105,'CAD (computer-aided design)'),
 (440,105,'colour image processing'),
 (440,171,NULL),
 (440,304,NULL),
 (440,340,'Modelling - Simulation - Image Processing - Pattern Recognition'),
 (440,353,'Image Processing'),
 (440,356,NULL),
 (440,357,NULL),
 (440,392,'Image analysis'),
 (440,413,'Color industrial quality inspection'),
 (440,415,NULL),
 (441,182,'Image Representation - Quadtrees Computation'),
 (441,202,'fovea - multiple resolution -spiral pyramid'),
 (441,265,NULL),
 (441,408,'Geographic Information Systems (GIS)'),
 (441,414,'Fractals - Wavelets - Orthogonal Basis Expansions - Splines'),
 (441,430,'Image Representation'),
 (442,142,'Xray images'),
 (442,145,'Data compression'),
 (442,164,'Lossless Image Compression'),
 (442,265,NULL),
 (442,285,'image compression - textual image compression'),
 (442,414,'Fractal Compression - Video Compression'),
 (443,187,'Image preprocessing - feature extraction'),
 (443,341,'Corner Detection - Curvature'),
 (444,163,'Stereo-image analysis'),
 (444,265,NULL),
 (444,338,'Scene Analysis'),
 (445,187,'Cytological analysis'),
 (445,202,'inspection for quality control'),
 (445,374,'Mammography'),
 (446,119,'Projection based transforms - Hough transform'),
 (446,212,'Non-linear forecasting and data compression'),
 (446,271,NULL),
 (446,334,'Pattern Recognition'),
 (446,340,'Modelling - Simulation - Image Processing - Pattern Recognition'),
 (446,353,'Pattern Recognition'),
 (446,363,'Natural lang learning - corpus analysis - auto classification'),
 (446,392,'Pattern Recognition'),
 (446,403,'Text recognition - reading'),
 (446,415,NULL),
 (446,450,'Pattern recognition'),
 (447,182,'Clustering - Network Clustering'),
 (447,363,'Natural language learning'),
 (448,109,'Applications'),
 (448,202,'inspection for quality control'),
 (449,126,'Fuzzy Systems - Fuzzy Control - Neural Networks.'),
 (449,187,'Connectionism - neural networks'),
 (450,186,'Interactive Model specification.'),
 (450,189,'neural networks - cognitive science'),
 (450,191,'Simulation Languages - Modelling Paradigms'),
 (450,214,NULL),
 (450,260,NULL),
 (450,302,NULL),
 (450,309,NULL),
 (450,320,'Simulation and Modelling - with Petri Nets'),
 (450,340,'Modelling - Simulation - Image Processing - Pattern Recognition'),
 (450,466,'Simulation'),
 (450,469,'Control Theory'),
 (451,163,'Spatial movement'),
 (451,287,'Parallel simulation'),
 (451,306,NULL),
 (451,395,'Simulation and Modelling General'),
 (452,124,NULL),
 (452,249,'Hardware Description Languages - VHDL - Parallel Simulation'),
 (452,395,'Simulation Languages'),
 (452,430,'Simulation Languages'),
 (453,102,'Applications'),
 (453,124,'Network design and performance issues'),
 (453,393,'Scientific and Medical Visualization'),
 (453,395,'Simulation and Modelling Applications'),
 (453,434,'Modelling Urban Climate - Modelling Pollutant Dispersion'),
 (453,442,NULL),
 (453,443,'Applications - Simulation and Modelling'),
 (454,150,'Model Validation and Analysis'),
 (454,190,'Tools - Design/CPN - Deadlock/Livelock'),
 (454,302,NULL),
 (454,322,'Iterative model repair'),
 (454,443,'Model Validation Techniques'),
 (455,102,'Modelling'),
 (455,158,'Model Development'),
 (455,302,NULL),
 (455,442,NULL),
 (455,443,'Model Development - Analytical and Simulation'),
 (456,191,'Text Retrieval - Hypertext - Authoring - Non-linear Presentation'),
 (457,163,'PostScript'),
 (458,138,'Text Editing'),
 (458,403,'User models - long term - exploration - learning - adaptivity'),
 (458,431,'Cooperative design'),
 (459,137,'Automated formatting'),
 (459,138,'Document Preparation'),
 (459,164,'Document preparation languages - Markup Languages - Document Desig'),
 (459,314,'Document formatting'),
 (459,351,'Document preparation - editing and formatting systems'),
 (459,355,NULL),
 (459,373,'HTML distance learning'),
 (459,456,'Document preparation'),
 (460,167,'Program visualization');
/*!40000 ALTER TABLE `interest` ENABLE KEYS */;


--
-- Definition of table `paper`
--

DROP TABLE IF EXISTS `paper`;
CREATE TABLE `paper` (
  `PaNum` int(11) default NULL,
  `Title` varchar(255) default NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

--
-- Dumping data for table `paper`
--

/*!40000 ALTER TABLE `paper` DISABLE KEYS */;
INSERT INTO `paper` (`PaNum`,`Title`) VALUES 
 (199,'Some empirical observations on program behaviour'),
 (200,'Product-form synthesis of queueing networks'),
 (201,'Evaluation of the file redundancy in distributed database systems'),
 (202,'Implementing distributed read-only transactions'),
 (203,'On the file design problem for partial-match retrieval'),
 (204,'Hardware-related software errors: measurement and analysis'),
 (205,'An experimental study of software metrics for real-time software'),
 (206,'Exception handling: formal specification'),
 (207,'Software engineering for user interfaces'),
 (208,'The modular structure of complex systems'),
 (209,'PROUST: knowledge-based program understanding'),
 (210,'PECAN: program development systems that support multiple views'),
 (211,'A tour through Cedar'),
 (212,'Steps to an advanced Ada programming environment'),
 (213,'Identifying error-prone software - an empirical study'),
 (214,'Translating SQL into relational algebra'),
 (215,'Performance evaluation of centralised databases with static locking'),
 (216,'SEES - a software testing environment support system'),
 (217,'Selecting software test data using data flow information'),
 (218,'An approach to the modeling of software testing with some applications'),
 (219,'Flex: a high level language for specifying customized microprocessors'),
 (220,'Communication and synchronization primitives for distributed programs'),
 (221,'Discrete time stochastic Petri nets'),
 (222,'Dynamic configuration for distributed systems'),
 (223,'Eager reclamation'),
 (224,'Variations on a method for representing data items of unlimited length'),
 (225,'A loosely coupled system for reliably storing data'),
 (226,'Completeness of proof systems for equational specifications'),
 (227,'Atomic action and resource coordination problems'),
 (228,'A compiler for an array and vector processing language'),
 (229,'Statistical estimation of software reliability'),
 (230,'An availability model for distributed transaction systems'),
 (231,'Optimal load balancing in a multiple processor system'),
 (232,'Implementing fault tolerant distributed objects'),
 (233,'Ordering actions for visibility'),
 (234,'Support for distributed transactions in the TABS prototype'),
 (235,'A simple and efficient randomized Byzantine agreement algorithm'),
 (236,'Randomized Byzantine agreement'),
 (237,'Streets of Byzantium: network architectures for fast reliable broadcasts'),
 (238,'A technique for estimating performance of fault tolerant programs'),
 (239,'Performance modeling of database recovery protocols'),
 (240,'Computers come and go but data go on forever'),
 (241,'Gambit: an interactive database design tool'),
 (242,'The semantic database constructor'),
 (243,'An application of statistical databases in manufacturing testing'),
 (244,'Utilizing an executable specification language for an information system'),
 (245,'Design of distributed databases'),
 (246,'On the use of an extended relational model'),
 (247,'An algebra for a general entity-relationship model'),
 (248,'Representing roles in universal scheme interfaces'),
 (249,'Analysis and design in MSG84: formalizing functional specifications'),
 (250,'Formal specification of user interfaces'),
 (251,'An approach to user specification of interactive display interfaces'),
 (252,'Extending state transition diagrams'),
 (253,'An aspect of aesthetics in human computer communication: pretty windows'),
 (254,'Experiences with a feedback version development methodology'),
 (255,'Transformation and verification of office procedures'),
 (256,'Towards a theory of forward error recovery'),
 (257,'System structure analysis: clustering with data bindings'),
 (258,'The qualified function approach'),
 (259,'Synthesizing code for resource controllers'),
 (260,'Symbolic semantics and program reduction'),
 (261,'Query processing in a fragmented relational distributed system: Mermaid'),
 (262,'An image processing language with icon-assisted navigation'),
 (263,'Omega - a data flow analysis tool for the C programming language'),
 (264,'Assessment of software reliability models'),
 (265,'Design stability measures for software maintenance'),
 (266,'On the uncertainty in the correctness of computer programs'),
 (267,'Database integrity block construct: concepts and design issues'),
 (268,'An implementation of an automated protocol synthesizer (APS)'),
 (269,'Automated software quality assurance'),
 (270,'System testing aided by structured analysis: a practical experience'),
 (271,'Stochastic modeling of branch-and-bound algorithms with best-first search'),
 (272,'Environmental testing techniques for software certification'),
 (273,'RUBRIC: a system for rule-based information retrieval'),
 (274,'SPD: a humanized documentation technology'),
 (275,'Time and cost evaluation schemes of multiple copies of data'),
 (276,'Adaptive file allocation in star computer network'),
 (277,'Toward the next generation of data modeling tools'),
 (278,'Augmenting Ada for SIMD parallel processing'),
 (279,'Monitoring software development through dynamic variables'),
 (280,'Autonomous vehicle control using AI techniques'),
 (281,'Software science applied to APL'),
 (282,'Allocating independent subtasks on parallel processors'),
 (283,'Interfacing Unix to data communications networks'),
 (284,'Abstract data type development and implementation: an example'),
 (285,'Statistical and scientific database issues'),
 (286,'Data compression in scientific and statistical databases'),
 (287,'Efficient support of statistical operations'),
 (288,'Statistical database query languages'),
 (289,'Antisampling for estimation: an overview'),
 (290,'Advances in distributed computing systems'),
 (291,'An optimal algorithm for processing distributed star queries'),
 (292,'Concurrent broadcast for information dissemination'),
 (293,'Modeling of software partition for distributed real-time applications'),
 (294,'Atomic remote procedure call'),
 (295,'Synchronized distributed termination'),
 (296,'Stability and distributed scheduling algorithms'),
 (297,'A distributed drafting algorithm for load balancing'),
 (298,'An empirical study of distributed application performance'),
 (299,'An analysis of the effect of network parameters'),
 (300,'Reliability optimization in the design of distributed systems'),
 (301,'Post-failure reconfiguration of CSP programs'),
 (302,'Integrated performance models for distributed processing'),
 (303,'An approach to performance specification of communication protocols'),
 (304,'Modeling and analysis of distributed database concurrency control'),
 (305,'Proving liveness and termination of systolic arrays'),
 (306,'What is AI ? and what does it have to do with software engineering ?'),
 (307,'A 15 year perspective on automatic programming'),
 (308,'Automating the transformational development of software'),
 (309,'Research on knowledge-based software environments at Kestrel Institute'),
 (310,'The programmer\"s apprentice: a session with KBEmacs'),
 (311,'Domain-specific automatic programming'),
 (312,'Enhanced maintenance and explanation of expert systems'),
 (313,'The role of domain experience in software design'),
 (314,'Understanding and automating algorithm design'),
 (315,'The roles of execution and analysis in algorithm design'),
 (316,'Expert systems and the \"myth\" of symbolic reasoning'),
 (317,'The \"software engineering\" of expert systems: is Prolog appropriate ?'),
 (318,'If Prolog is the answer - what is the question ?'),
 (319,'Software reliability models'),
 (320,'A statistical method for software quality control'),
 (321,'Software reliability growth modeling: models and applications'),
 (322,'Effect of system workload on operating system reliability'),
 (323,'Toward high confidence software'),
 (324,'Assessing (software) reliability growth'),
 (325,'Bayesian extensions to a basic model of software reliability'),
 (326,'Software reliability: the stopping rule problem'),
 (327,'Partition analysis: a method combining testing and verification'),
 (328,'The N-version approach to fault-tolerant software'),
 (329,'Software fault tolerance: an evaluation'),
 (330,'A theoretical basis for the analysis of multiversion software'),
 (1,'Performance of synchronized iterative processes in multiprocessor systems'),
 (2,'On the combined problem of compaction and sorting'),
 (3,'The interpretation of meta grammars describing syntax-directed interpreters'),
 (4,'A specification method for specifying data and procedural abstractions'),
 (5,'Specification and verification of communication protocols'),
 (6,'Program specification applied to a text formatter'),
 (7,'Specification of forms processing and business procedures'),
 (8,'On horizontally microprogrammed microarchitecture description techniques'),
 (9,'Display condensation of program text'),
 (10,'On a class of linear maps for data compression'),
 (11,'Implementation of the database machine DIRECT'),
 (12,'View modeling and integration using the functional data model'),
 (13,'Protocols for deadlock detection in distributed database systems'),
 (14,'A family of locking protocols'),
 (15,'The logical access path schema of a database'),
 (16,'Auditing and inference control in statistical databases'),
 (17,'A mechanism for database protection in cellular logic devices'),
 (18,'Unidirectional transport of rights and take-grant control'),
 (19,'Databases and units of measure'),
 (20,'Analysis of extendible hashing'),
 (21,'An object-oriented command language'),
 (22,'A symbol table abstraction to implement languages with explicit scope control'),
 (23,'Simulation of procedure variables using Ada tasks'),
 (24,'Language features for access control'),
 (25,'A practical method for reducing weak precedence parsers'),
 (26,'Programming language constructs for screen definition'),
 (27,'A generalized query-by-example data manipulation language'),
 (28,'Optimization algorithms for distributed queries'),
 (29,'Program restructing in a multilevel virtual memory'),
 (30,'Experiments on the knee criterion in a multiprogrammed computer system'),
 (31,'Analysis of secondary storage fragmentation'),
 (32,'Measuring the performance and behavior of Icon programs'),
 (33,'Program graphs and execution behavior'),
 (34,'Steady-state probabilities for a queue'),
 (35,'Syntax-directed pretty printing -'),
 (36,'Locality of reference in hierarchical database systems'),
 (37,'On the selection of an optimal set of indexes'),
 (38,'MIKE: a network operating system'),
 (39,'Software science revisited'),
 (40,'Software science and cognitive psychology'),
 (41,'Some properties derived from structural analysis of program graph models'),
 (42,'A very high-level interactive graphical trace for the Pascal heap'),
 (43,'Anatomy of a small Pascal compiler'),
 (44,'An engineering approach to software test data design'),
 (45,'Modeling a multiprocessor architecture'),
 (46,'A formal model of crash recovery in a distributed system'),
 (47,'Dynamic rematerialization'),
 (48,'Analyzing concurrency control algorithms'),
 (49,'Detection of mutual inconsistency in distributed systems'),
 (50,'Input-output tools: a language facility for interactive and real-time systems'),
 (51,'File structures - program structures - and attributed grammars'),
 (52,'Compilation of nonprocedural specifications into computer programs'),
 (53,'A Diagrammatic notation for abstract syntax and abstract structured objects'),
 (54,'The design for a secure system based on program analysis'),
 (55,'VSWS: the variable-interval sampled working set policy'),
 (56,'The study of a new perfect hash scheme'),
 (57,'Nonsensitive data and approximate transactions'),
 (58,'Optimal release time of computer software'),
 (59,'Combining testing with formal specifications: a case study'),
 (60,'Testing for perturbations of program statements'),
 (61,'A data flow oriented program testing strategy'),
 (62,'A framework for software fault tolerance in real-time systems'),
 (63,'The noisy substring matching problem'),
 (64,'A semantic design method'),
 (65,'Software structure for display management systems'),
 (66,'On the multiple implementation of abstract data types within a computation'),
 (67,'A paradigm for the design of parallel algorithms with applications'),
 (68,'Petri nets models for the evaluation'),
 (69,'ESPRESO - a system for process control software specification'),
 (70,'A scheme for parallel processing for MIMD systems'),
 (71,'Processes - tasks - and monitors'),
 (72,'Interconnection of local computer networks'),
 (73,'A causal model for analyzing distributed concurrency control algorithms'),
 (74,'Distribution design of logical database schemas'),
 (75,'Graph traversal techniques'),
 (76,'Performance analysis of FFT algorithms of multiprocessor systems'),
 (77,'Control of a heterogeneous two-server exponential queueing system'),
 (78,'Extending CSP to allow dynamic resource management'),
 (79,'A survey of software engineering practices: tools - methods - and results'),
 (80,'Managing and predicting the costs of real-time software'),
 (81,'Analyzing software safety'),
 (82,'Abstract requirement specification: a new approach and its application'),
 (83,'Casting Petri nets into programs'),
 (84,'Timing requirements for time-driven systems using augmented Petri nets'),
 (85,'The problem of equivalence for entity-relationship diagrams'),
 (86,'A data structure and an algorithm for the nearest point problem'),
 (87,'Software function - source lines of code - and development effort prediction'),
 (88,'Measuring the productivity of computer systems development activities'),
 (89,'Metric analysis and data validation across fortran projects'),
 (90,'An empirical study of a syntactic complexity family'),
 (91,'Toolpack - an experimental software development environment research project'),
 (92,'A mathematical framework for the investigation of testing'),
 (93,'Formal specification and verification of distributed systems'),
 (94,'Specification of synchronizing processes'),
 (95,'Distributed software system design representation using modified Petri nets'),
 (96,'Software engineering economics'),
 (97,'Software development management planning'),
 (98,'Managing software development projects for maximum productivity'),
 (99,'Software quality assurance'),
 (100,'The software engineering shortage: the third choice'),
 (101,'Managing software engineering projects: a social analysis'),
 (102,'Making software visible - operational - and maintainable'),
 (103,'Reviews - walkthroughs - and inspections'),
 (104,'Software engineering project standards'),
 (105,'Elements of software configuration management'),
 (106,'Performance analyses of Cartesian product files and random files'),
 (107,'Performance improvement of abstractions'),
 (108,'Specification of the Unix file system'),
 (109,'The rigorous development of a system version control program'),
 (110,'SLAN-4 - a software specification and design language'),
 (111,'Correct and robust programs'),
 (112,'On programming by iterations'),
 (113,'Cell: a distributed computing modularization concept'),
 (114,'Access control with single-key-lock'),
 (115,'Database support for versions and alternatives of large design files'),
 (116,'Design considerations for a message file server'),
 (117,'Debugging a distributed computing system'),
 (118,'A simple separate compilation mechanism'),
 (119,'Implementing language support in high-level languages'),
 (120,'Multiaccess in a nonqueueing mailbox environment'),
 (121,'Dataflow resource managers'),
 (122,'Resilient distributed computing'),
 (123,'Intervention schedules for real-time programming'),
 (124,'A heuristic for deriving loop functions'),
 (125,'Safe data type specifications'),
 (126,'Prototyping versus specifying: a multiproject experiment'),
 (127,'A relational representation of an abstract type system'),
 (128,'A unifying approach to the design'),
 (129,'Protocol verification via projections'),
 (130,'Broadcasting satellite processes (BSP)'),
 (131,'Program slicing'),
 (132,'Automatic design of the internal schema'),
 (133,'Modeling software behaviour in terms of a formal life cycle curve'),
 (134,'A software engineering environment (SEE) for weapon system software'),
 (135,'Research of structured programming: an empiricist\"s evaluation'),
 (136,'Use of software engineering practices at a small MIS shop'),
 (137,'Some equivalence results'),
 (138,'Virtual memory behaviour of some sorting algorithms'),
 (139,'Data flow anomaly detection'),
 (140,'An evaluation of random testing'),
 (141,'On the execution of large batch programs'),
 (142,'Static data flow analysis of PL/I programs with the PROBE system'),
 (143,'An expansive view of reusable software'),
 (144,'Reusability in programming: a survey of the state of the art'),
 (145,'An essay on software reuse'),
 (146,'Software engineering with reusable design and code'),
 (147,'Some experience in promoting reusable software'),
 (148,'The Unix system and software reusability'),
 (149,'Experience with Traits in the Xerox Star workstation'),
 (150,'Parameterized programming'),
 (151,'Design of Ada systems yielding reusable components'),
 (152,'Use of very high level languages'),
 (153,'The Draco approach to constructing software from reusable components'),
 (154,'Program reusability through program transformation'),
 (155,'Reusability through program transformations'),
 (156,'Empirical studies of programming knowledge'),
 (157,'Representative instances and gamma-acyclic relational schemes'),
 (158,'Knowledge representation for model management systems'),
 (159,'View definition and generalization'),
 (160,'Site initialization - recovery - and backup'),
 (161,'A methodology for data schema integration'),
 (162,'A scheme for batch verification of integrity assertions'),
 (163,'On the optimal selection of multilist database structures'),
 (164,'Criteria for software reliability model comparisons'),
 (165,'Evaluation of error recovery blocks used for cooperating processes'),
 (166,'Dependability evaluation of software systems in operation'),
 (167,'A successful software development'),
 (168,'A methodology for collecting valid software engineering data'),
 (169,'A concurrent general purpose operator interface'),
 (170,'An industrial software engineering retraining course'),
 (171,'Real-time execution monitoring'),
 (172,'Monitoring for deadlock and blocking in Ada tasking'),
 (173,'Concurrent maintenance of binary search trees'),
 (174,'Counting paths: nondeterminism as linear algebra'),
 (175,'On required element testing'),
 (176,'A concurrency measure'),
 (177,'Selectors: high-level resource schedulers'),
 (178,'An algebraic specification of HDLC procedures and its verification'),
 (179,'Adaptive optimization of a system\"s load'),
 (180,'Closed covers: to verify progress'),
 (181,'Defining database views as data abstractions'),
 (182,'Lock conversion in non-two-phase locking protocols'),
 (183,'A rigourous approach to fault tolerant programming'),
 (184,'Testing formal specifications to detect design errors'),
 (185,'The Eden system: a technical review'),
 (186,'An application of name based addressing to low level distributed algorithms'),
 (187,'A priority based distributed deadlock detection algorithm'),
 (188,'Timing constraints of real time systems'),
 (189,'Making pointers safe in system programming languages'),
 (190,'A field evaluation of natural language for data retrieval'),
 (191,'Estimating the speedup in parallel parsing'),
 (192,'Risk assessment of computer controlled systems'),
 (193,'A model for the basic block protocol of the Cambridge ring'),
 (194,'Operating system models in a Concurrent Pascal environment'),
 (195,'Task scheduling on the PASM parallel processing system'),
 (196,'Evaluating software development by analysis of changes'),
 (197,'Applying formal specification to software development in industry'),
 (198,'IOTA: a modular programming system'),
 (595,'Semantics of EqL'),
 (596,'A predicate-transition net model'),
 (597,'Parsing languages by pattern matching'),
 (598,'A model of visibility control'),
 (599,'A performance comparison of multimicro and mainframe database architectures'),
 (600,'Performance analysis of parallel processing systems'),
 (601,'Parallel discrete event simulation using shared memory'),
 (602,'Natural and social system metaphors for distributed problem solving'),
 (603,'Network structures for distributed situation assessment'),
 (604,'The scientific community metaphor'),
 (605,'Knowledge organization and distribution for medical diagnosis'),
 (606,'Toward a theory of distributed word expert natural language parsing'),
 (607,'Integrating knowledge sources for computer \"understanding\" tasks'),
 (608,'Frameworks for cooperation in distributed problem solving'),
 (609,'An organizational view of distributed systems'),
 (610,'Functionally accurate - cooperative distributed systems'),
 (611,'String and graph grammar characterizations of bounded regular languages'),
 (612,'Time required for reference count management'),
 (613,'Automatic insertion of indexing instructions in program synthesis'),
 (614,'Time required for reference count management'),
 (615,'A generating-function analysis of multiprogramming queues'),
 (616,'An operation-control scheme for authorization in computer systems'),
 (617,'Multivariate point process models for response times'),
 (618,'Analysis of some abstract measures of protection in computer systems'),
 (619,'CHITRA: cognitive handprinted input-trained recursively analyzing system'),
 (620,'A probabilistic approach for testing large-scale integrated circuits'),
 (621,'Simplified odd-even sort using multiple shift-register loops'),
 (622,'Depth-m search in branch-and-bound algorithms'),
 (623,'Parsers for indexed grammars'),
 (624,'Time required for garbage collection in retention block-structured languages'),
 (625,'Zoom-thresholding technique for boundary determination'),
 (626,'A structure theorem for the elementary functions'),
 (627,'Data schemata based on directed graphs'),
 (628,'Learning under a VEDIC teacher'),
 (629,'Properties of stochastic syntax-directed translation schemata'),
 (630,'Development of models of optimal complexity using self-organization theory'),
 (631,'Generalized inverse solutions of multiattribute accounting problems'),
 (632,'Notes on canonical label languages'),
 (633,'Composition of relational productions for plans and programs'),
 (634,'The notion of a probabilistic cellular acceptor'),
 (635,'Encoding of parallel program schemata by vector addition systems'),
 (636,'Syntactic/semantic interactions in programmer behavior'),
 (637,'OPAL: a new algorithm for optimal partitioning and learning'),
 (638,'Inhomogeneous sorting'),
 (639,'Enumerating syntactical graphs and lattices of derivations'),
 (640,'Algorithmic approach to the consecutive retrieval property'),
 (641,'An application of learning to robotic planning'),
 (642,'Doubly deterministic tabled OL systems'),
 (643,'A network of microprocessors to execute reduction languages - part I'),
 (644,'The applicability of program schema results to programs'),
 (645,'Minimum dominating cycles in 2-trees'),
 (646,'Computer algebra for the calculus of variations -'),
 (647,'A network of microprocessors to execute reduction languages - part II'),
 (648,'Finding a minimal set of base paths of a program'),
 (649,'A class of functions synthesized from a finite number of examples'),
 (650,'Semantic equivalence of covering attribute grammars'),
 (651,'DYNOC - a dynamic optimal cluster-seeking technique'),
 (652,'An approach to understanding geometrical configurations by computer'),
 (653,'A method for constructing binary search trees'),
 (654,'Higher order data types'),
 (655,'Formalization of correctness of recursive definitions'),
 (656,'Adaptive quadrature algorithms for the ILLIAC IV'),
 (657,'Response-time simulation of multivariate point process models'),
 (658,'A pragmatic approach to resolution-based theorem proving'),
 (659,'Algorithms for finding directed graph isomorphisms by finite automata'),
 (660,'Querying databases'),
 (661,'On the design and specification of message oriented programs'),
 (662,'An interpreter for a nondeterministic language'),
 (663,'Two algorithms for constructing a Delaunay triangulation'),
 (664,'A composite algorithm for strength reduction and code movement optimization'),
 (665,'Knowledge engineering'),
 (666,'WCRL: a data model independent language for database systems'),
 (667,'Fast recognition of Baxter permutations'),
 (668,'Statistical parameters of cluster validity functionals'),
 (669,'Useless prime implicants'),
 (670,'The order of merging operations for queries in inverted file systems'),
 (671,'Characterizations for the regular prefix codes and related families'),
 (672,'A classification of process coordination schemes in descriptive power'),
 (673,'The design and implementation of a scheme for large ordered indices'),
 (674,'Computer selection and criteria for computer performance evaluation'),
 (675,'Language use: a performance model'),
 (676,'Complexity and computability of solutions to linear programming systems'),
 (677,'The encoding of arbitrary two-dimensional geometric configurations'),
 (678,'A new technique for WFTA input/output reordering'),
 (679,'On the efficient implementation of retention in block-structured languages'),
 (680,'Partitioning trees: matching - domination - and maximum diameter'),
 (681,'Evaluation of queries based on the extended relational calculi'),
 (682,'Sense-controlled flexible robot behavior'),
 (683,'Minimum dominating cycles in outplanar graphs'),
 (684,'Approximate reasoning and possibilistic models in classification'),
 (685,'On the design of one-level indexed sequential files'),
 (686,'A graphical interpretation of dependency structures in relational data bases'),
 (687,'Stateless Turing machines and fixed points'),
 (688,'Computer aided design of database internal schema'),
 (689,'Graphical normal forms based on root dependencies'),
 (690,'Theta-join and normalization'),
 (691,'An effective preprocessor for structured Fortran: the Hentran system'),
 (692,'Conceptual modeling of data base operations'),
 (693,'On optimal scheduling of integrity assertions'),
 (694,'Cut point languages of Markov DTOL systems'),
 (695,'Magnetic bubble memory structures for relational database management systems'),
 (696,'Cost analysis of recovery block scheme and its implementation issues'),
 (697,'Query costs in HB(1) trees versus 2-3 trees'),
 (698,'A hybrid clustering procedure for concentric and chain-like clusters'),
 (699,'A note on Lee and Schachter\"s algorithm for Delaunay triangulation'),
 (700,'Inference of a class of CFPG by means of semantic rules'),
 (701,'Concepts and realization of a high-performance data type architecture'),
 (702,'Searching and encoding for infinite ordered sets'),
 (703,'Syntactic/semantic technique in pattern recognition: a survey'),
 (704,'An algorithmic analysis of simulation strategies'),
 (705,'On switching network functionalities and their relationships'),
 (706,'Comparing data type specification via their normal forms'),
 (707,'A comparison of iterative and defined classes of search trees'),
 (708,'On optimizing the evaluation of a set of expressions'),
 (709,'A procedure for the unsupervised abduction'),
 (710,'Predictive searching for chain encoding by computers'),
 (711,'Hierarchic syntax error repair for LR grammars'),
 (712,'Remarks concerning the optimization of matrix codes'),
 (713,'An algebraic approach to information retrieval systems'),
 (714,'Methodical specification of abstract data types via rewriting systems'),
 (715,'File allocation in a distributed database'),
 (716,'Rough sets'),
 (717,'Expert systems for decision support in EDP auditing'),
 (718,'An efficient external sorting with minimal space requirements'),
 (719,'Representation of temporal information'),
 (720,'An efficient algorithm for finding Kleene closure'),
 (721,'Conversion and parsing of tree transducers for syntactic pattern analysis'),
 (722,'Regular-like tree expressions'),
 (723,'A comparative study of 2-3 trees and AVL trees'),
 (724,'Scheduling the monitoring of EDP controls in online systems'),
 (725,'A simple way to near minimization of microprogram control memory'),
 (726,'Application of SQL/N'),
 (727,'On finding the convex hull of a simple polygon'),
 (728,'Application of multipath planar shapes in pattern analysis'),
 (729,'The GPSS-GAPS combined (GGC) system'),
 (730,'A topological formulation of linguistic typology'),
 (731,'A theory of data dependencies over relational expressions'),
 (732,'Time separation technique for large databases'),
 (733,'The verification of the protection mechanism of high-level language machines'),
 (734,'Another view of functional and multivalued dependencies'),
 (735,'Entity-relationship diagrams which are in BCNF'),
 (736,'Computationally efficient algorithms for a one-time pad scheme'),
 (737,'A state space approach to the finite automata'),
 (738,'Exponentiation modulo a polynomial for data security'),
 (739,'Computing largest empty circles with location constraints'),
 (740,'On omega-languages whose syntactic monoid is trivial'),
 (741,'On game graph structure and its influence on pathology'),
 (742,'Formal restructuring functions for hierarchical data bases'),
 (743,'Safety in grammatical protection systems'),
 (744,'Cellular topology and its applications in image processing'),
 (745,'Microcode compaction: extending the boundaries'),
 (746,'An optimal time and minimal space algorithm'),
 (747,'Inferability of context-free programmed grammars'),
 (748,'Algorithms for the inverse'),
 (749,'Binary search trees with binary comparison cost'),
 (750,'On the method of puzzles for key distribution'),
 (751,'Parallel multipliers with NOR gates based on G-minimum adders'),
 (752,'An iterative algorithm for the cyclic towers of Hanoi problem'),
 (753,'On the message complexity of distributed problem'),
 (754,'Familial model of data'),
 (755,'Inference of tree automata from sample set of trees'),
 (756,'Complexity - convexity - and unimodality'),
 (757,'A glimpse into the paradise of combinatory algebra'),
 (758,'Frequency decomposition technique for large archivable databases'),
 (759,'Parallel solution of recurrences on a tree machine'),
 (760,'Checking similarity of planar figures'),
 (761,'CH transform'),
 (762,'Further remarks for the matrix type-beta codes'),
 (763,'Embedding deductive capabilities in relational database systems'),
 (764,'A methodology for designing and modeling reconfigurable systems'),
 (765,'Concatenated hash code selection'),
 (766,'A grammatical inference for harmonic linear languages'),
 (767,'Specification of data restructuring software based on the attribute method'),
 (768,'The use of Hoare logic in the verification of horizontal microprograms'),
 (769,'A VLSI design for the parallel finite state automaton'),
 (770,'Surjections and coverings'),
 (771,'Schema manipulation in self-describing and self-documenting data models'),
 (772,'Modeling of multiple copy update costs'),
 (773,'Syntactic monoids in the construction of systolic tree automata'),
 (774,'Architectural support for variable addressing in Ada - a design approach'),
 (775,'Multidimensional extendible hashing for partial-match queries'),
 (776,'BPL: a set-based language for distributed system prototyping'),
 (777,'A complexity measure for data flow models'),
 (778,'Knowledge engineering revisited'),
 (779,'An empirical performance comparison'),
 (780,'A transportable programming language (TPL) system - I. overview'),
 (781,'Finding minimal enclosing boxes'),
 (782,'An evolutionary procedure for machine learning'),
 (783,'A note on the method of puzzles for key distributions'),
 (784,'LL(1) grammars and sub-LL(1) grammars'),
 (785,'A note on regular-controlled apical-growth filamentous systems'),
 (786,'An analysis of self-diagnosis model by conditional fault set'),
 (787,'A class of systolic multiplier units for VLSI technology'),
 (788,'Towards formal specification of a distributed computing system'),
 (789,'A partially distributed deadlock detection algorithm'),
 (790,'Minimal covering problem and PLA minimization'),
 (791,'An approach to computer-aided document examination'),
 (792,'On serializability'),
 (793,'Optimal taxiway repair: a set-covering approach'),
 (794,'AE1: an extension matrix approximate method for the general covering problem'),
 (795,'Trace confirmation with given object position'),
 (796,'A parallel sorting scheme whose basic operation sorts N elements'),
 (797,'A cse study of parallel execution of a rule-based expert system'),
 (798,'Modeling concurrency with partial orders'),
 (799,'Control and data driven execution of logic programs: a comparison'),
 (800,'How are parallel systems invented ?'),
 (801,'Denotational semantics of a para-functional programming language'),
 (802,'Maximum pipelining linear recurrence on static data flow computers'),
 (803,'Parallel microprogramming tools'),
 (804,'Experiments on alternatives to minimax'),
 (805,'When is pull better than push ?'),
 (806,'OR-parallel execution of Prolog on a multi-sequential machine'),
 (807,'Primitives for resource management in a demand-driven reduction model'),
 (808,'A parallel implementation of Flat Concurrent Prolog'),
 (809,'The bards on parallel programming'),
 (810,'Loop skewing: the wavefront method revisited'),
 (811,'The butterfly barrier'),
 (812,'Solution of sparse positive definite systems'),
 (813,'An optimal distributed solution to the dining philosophers problem'),
 (814,'Hotspotting'),
 (815,'Global garbage collection for distributed heap storage systems'),
 (816,'An optimal speed-up parallel algorithm'),
 (817,'An optimal parallel algorithm for triangulating a set of points in the plane'),
 (818,'Pseudosimulation: an algorithm for distributed simulation with limited memory'),
 (819,'The Church of the Least Fixed Point'),
 (820,'An assessment of Multilisp: lessons from experience'),
 (821,'Optimal parallel algorithms for constructing and maintaining'),
 (822,'Performance analysis of a scheme for concurrency/synchronization'),
 (823,'Systolic architectures for B-spline surfaces'),
 (824,'On mapping processes to processors in distributed systems'),
 (825,'Inheritance on processes - exemplified on distributed termination detection'),
 (826,'A multiprocessor using protocol-based programming primitives'),
 (827,'Amdahl\"s law'),
 (828,'Flat Parlog: a basis for comparison'),
 (829,'Optimal computation of prefix sums on a binary tree of processors'),
 (830,'Data dependence and its application to parallel processing'),
 (831,'Super-linear speed up'),
 (832,'Performance of symbolic applications on a parallel architecture'),
 (833,'A shared memory algorithm and proof'),
 (834,'Deriving parallel computations from functional specifications'),
 (835,'Systolic processing'),
 (836,'Fairness and the axioms of control predicates'),
 (837,'Experiments with applicative updating: practical results'),
 (838,'Simulating logic circuits: a multiprocessor application'),
 (839,'Connectionism'),
 (840,'Parallel consistent labeling algorithms'),
 (841,'Semi-automatic process partitioning for parallel computing'),
 (842,'Trace - failure and testing equivalences for communicating processes'),
 (843,'Blackboard systems in Polka'),
 (844,'Fixpoints in daily life'),
 (845,'A backtracking algorithm'),
 (846,'Parallel processing of biological sequence comparison algorithms'),
 (847,'A randomized path branch-and-bound algorithm'),
 (848,'Consistent integration and propagation of disparate sensor observations'),
 (849,'An anthropomorphic robot finger'),
 (850,'On the adaptive control of robot manipulators'),
 (851,'Constrained relations between two coordinated industrial robots'),
 (852,'Nonlinear adaptive control of an N-link robots with unknown load'),
 (853,'Satellite-mounted robot manipulators -'),
 (854,'A new development in camera calibration'),
 (855,'The design of flexible robotic manipulators with optimal arm geometries'),
 (856,'Universal profinite domains'),
 (857,'A unifying theorem for algebraic semantics and dynamic logics'),
 (858,'A refinement of strong sequentiality for term rewriting with constructors'),
 (331,'Certifying the reliability of software'),
 (332,'Exponential order statistic models of software reliability growth'),
 (333,'Software reliability modeling and analysis'),
 (334,'Analysis of software availability/reliability'),
 (335,'Distributed program reliability analysis'),
 (336,'Software reliability in the system context'),
 (337,'Atomic actions for fault-tolerance using CSP'),
 (338,'Concurrency and forward recovery in atomic actions'),
 (339,'Modular redundancy in a message passing system'),
 (340,'A watchdog processor based general rollback technique with multiple retries'),
 (341,'An experimental evaluation of the assumption of independence'),
 (342,'Experiments in software reliability: life-critical applications'),
 (343,'Specification directed module testing'),
 (344,'A high level language-based computing environment'),
 (345,'Building reliable interactive information systems'),
 (346,'Typestate: a programming language concept for enhancing software reliability'),
 (347,'Generation and consistency checking of design and program structures'),
 (348,'Data structured programming: program design without arrays and pointers'),
 (349,'The transformation schema'),
 (350,'Object-oriented development'),
 (351,'An overview of JSD'),
 (352,'Functional programming - formal specification - and rapid prototyping'),
 (353,'A rational design process: how and why to fake it'),
 (354,'A recommended practice for describing software designs'),
 (355,'An empirical study of software design practices'),
 (356,'A metaprogramming method and its economic justification'),
 (357,'Constrained expressions'),
 (358,'SARA (System ARchitects Apprentice)'),
 (359,'Salient features of an executable specification language and its environment'),
 (360,'Developing interactive information systems'),
 (361,'Process-translatable Petri nets'),
 (362,'Real-time software life cycle with the model system'),
 (363,'Two-dimensional program design'),
 (364,'Flexible software development for multiple computer systems'),
 (365,'Reuse of software through generation of partial systems'),
 (366,'A structure editor for abstract document objects'),
 (367,'Dynamic storage fragmentation and file deterioration'),
 (368,'Derivation of a parallel algorithm for balancing binary trees'),
 (369,'Approximate analysis of open networks of queues with blocking'),
 (370,'Commutable transactions'),
 (371,'Distributed agreement in the presence of processor and communication faults'),
 (372,'Optimal partitioning of randomly generated distributed programs'),
 (373,'The impact on software development costs of using HOL\"s'),
 (374,'Some design aspects of databases through Petri net modeling'),
 (375,'Distributed database management model and validation'),
 (376,'A decomposition solution to a queueing model'),
 (377,'A layout algorithm for data flow diagrams'),
 (378,'Development of a debugger for a concurrent language'),
 (379,'Load-leveling in fault-tolerant distributed computing systems'),
 (380,'Combining queueing network and generalized stochastic Petri net models'),
 (381,'NON-VON\"s performance on certain database benchmarks'),
 (382,'The automatic inversion of attribute grammars'),
 (383,'Efficient decentralized consensus protocols'),
 (384,'The cloze procedure and software comprehensibility measurement'),
 (385,'ARES: a relational database'),
 (386,'Privilege transfer and revocation in a port-based system'),
 (387,'Direct implementation of abstract data types from abstract specifications'),
 (388,'Adaptive load sharing in homogeneous distributed systems'),
 (389,'Considerations on the insularity of performance evaluation'),
 (390,'An approach to decentralized computer systems'),
 (391,'Operational survivability'),
 (392,'The last 10 percent'),
 (393,'A survey of software design techniques'),
 (394,'Whether software engineering needs to be artificially intelligent'),
 (395,'Experimentation in software engineering'),
 (396,'Advances in software inspections'),
 (397,'Knowledge-based programming'),
 (398,'Programming in the large'),
 (399,'Specification of modular systems'),
 (400,'Dynamic file structure for partial match retrieval'),
 (401,'Error recovery in asynchronous systems'),
 (402,'Mechanical verification and automatic implementation'),
 (403,'Optimal allocation of file servers in a local network environment'),
 (404,'SODOS: a software documentation support environment - its definition'),
 (405,'A formal method for composing a network command language'),
 (406,'RT-ASLAN: a specification language for real-time systems'),
 (407,'Safety analysis of timing properties in real-time systems'),
 (408,'On hierarchical design of computer systems for critical applications'),
 (409,'Design of reliable software in distributed systems'),
 (410,'PODS - a project on diverse software'),
 (411,'Real-time Euclid: a language for reliable real-time systems'),
 (412,'Evaluation of competing software reliability predictions'),
 (413,'A statistical methodology for the study of the software failure process'),
 (414,'Extensions to an approach to the modeling of software testing'),
 (415,'A functional approach to program testing and analysis'),
 (416,'On multisystem coupling through function request shipping'),
 (417,'Allocating programs containing branches and loops'),
 (418,'Decomposition and aggregation by class in closed queueing networks'),
 (419,'Controllability of computer performance tradeoffs'),
 (420,'The gains from computer communication'),
 (421,'Functional addressing in Gutenberg'),
 (422,'Internet Locus: extending transparency to an internet environment'),
 (423,'SODOS: a software documentation environment - its use'),
 (424,'On the projection method for protocol verification'),
 (425,'A fault-tolerant scheduling problem'),
 (426,'Statistical relational tables for statistical database management'),
 (427,'Gandalf: software development environments'),
 (428,'Axiomatizing software test data adequacy'),
 (429,'Guaranteed response times in a distributed hard-real-time environment'),
 (430,'Special issue on distributed systems'),
 (431,'Local distributed deadlock detection by cycle detection and clustering'),
 (432,'Comparison and diagnosis of large replicated files'),
 (433,'Checkpointing and roll-back-recovery for distributed systems'),
 (434,'The gradient model load balancing method'),
 (435,'Discarding obsolete information in a replicated database system'),
 (436,'Caching hints in distributed systems'),
 (437,'Distributed version management for read-only actions'),
 (438,'Distribution and abstract types in Emerald'),
 (439,'A stub generator for multilanguage RPC in heterogeneous environments'),
 (440,'Language support for loosely coupled distributed programs'),
 (441,'The design of the Saguaro distributed operating system'),
 (442,'Views for multilevel database security'),
 (443,'Extending the noninterference version of MLS for SAT'),
 (444,'Muse - a computer assisted verification system'),
 (445,'An experience using two covert channel analysis techniques'),
 (446,'A new security testing method and its application to the secure Xenix kernel'),
 (447,'Towards a formal basis for the formal development method'),
 (448,'An access checking in capability-based systems'),
 (449,'Design and implementation of secure Xenix'),
 (450,'An intrusion-detection model'),
 (451,'Factors affecting distributed system security'),
 (452,'Controls for interorganization networks'),
 (453,'Cycle structure of the DES'),
 (454,'The interrogator: protocol security analysis'),
 (455,'Matching secrets in the absence of a continuously available trusted authority'),
 (456,'Covert channels in LAN\"s'),
 (457,'The state of software maintenance'),
 (458,'Understanding software maintenance work'),
 (459,'Maintaining configurations of evolving software systems'),
 (460,'The use of software complexity metrics in software maintenance'),
 (461,'A controlled experiment on the impact of software structure'),
 (462,'Knowledge representation of software component interconnection information'),
 (463,'Queueing analysis of fault-tolerant computer systems'),
 (464,'Cycle time properties of the FDDI token ring protocol'),
 (465,'Safety analysis using Petri nets'),
 (466,'A distributed algorithm for constructing minimal spanning trees'),
 (467,'Concurrent certifications by intervals of timestamps'),
 (468,'An information-based model for failure-handling in database database systems'),
 (469,'A paradigm for developing information systems'),
 (470,'Software bases for the flexible composition of application systems'),
 (471,'An application of structural modeling'),
 (472,'Refinement methodology for Ada'),
 (473,'Performance criteria for constrained nonlinear programming codes'),
 (474,'Program structure charts for applicative languages'),
 (475,'Automatic identification of software system differences'),
 (476,'CSM: a distributed programming language'),
 (477,'Test data selection and quality estimation'),
 (478,'A test deterministic methodology for protocol testing'),
 (479,'Implementation of an FP-shell'),
 (480,'Cooperative distributed algorithms for dynamic cycle prevention'),
 (481,'On the implementation and use of Ada on fault-tolerant distributed systems'),
 (482,'Scheduling tasks with resource requirements in hard real-time systems'),
 (483,'New NP-complete problems'),
 (484,'Fault-tolerant software reliability modeling'),
 (485,'Methodology for business system development'),
 (486,'Automatic compiler production: the front end'),
 (487,'Optimizing static scope Lisp'),
 (488,'A space-efficient optimization of call-by-need'),
 (489,'Reflexive incidence matrix (RIM) representation of Petri nets'),
 (490,'A message-based approach to discrete-event simulation'),
 (491,'An approach and mechanism'),
 (492,'Some theory concerning certification of mathematical subroutines'),
 (493,'Automated protocol validation in Argos'),
 (494,'An empirical study of software metrics'),
 (495,'Analysis of database system architectures using benchmarks'),
 (496,'A scheme to enforce data dependence on large multiprocessor systems'),
 (497,'Reasoning about probabilistic behavior in concurrent systems'),
 (498,'The path prefix software testing strategy'),
 (499,'Measuring errors in operational analysis assumptions'),
 (500,'A recursion theoretic approach to program testing'),
 (501,'Superviews: virtual integration of multiple databases'),
 (502,'Two access methods using compact binary trees'),
 (503,'Construction of universal instances for loop-free network databases'),
 (504,'Theory of modules'),
 (505,'A conceptual analysis of the Draco approach to constructing software systems'),
 (506,'Evaluating software engineering technologies'),
 (507,'Time-sensitive cost models in the commercial MIS environment'),
 (508,'Data integration in distributed databases'),
 (509,'A note on concurrent programming control'),
 (510,'Local area networks: software and related issues'),
 (511,'A remote procedure call facility'),
 (512,'A resource sharing system for personal computers in a LAN'),
 (513,'Location independent remote execution in NEST'),
 (514,'Key concepts of the INCAS multicomputer project'),
 (515,'Modeling and verification of real-time protocols for broadcast networks'),
 (516,'Virtual time CSMA protocols for hard real-time communication'),
 (517,'The Crystal multicomputer: design and implementation experience'),
 (518,'A methodology for developing distributed programs'),
 (519,'On multiple random accesses and physical data placement in dynamic files'),
 (520,'Semiautomatic implementation of communication protocols'),
 (521,'Edmas: an object-oriented - locally distributed mail system'),
 (522,'Software and hardware in data processing budgets'),
 (523,'Performance analysis of Disk Modulo allocation method'),
 (524,'Cleanroom software development: an empirical evaluation'),
 (525,'Very high level concurrent programming'),
 (526,'An information-theoretic analysis of relational databases -'),
 (527,'An information-theoretic analysis of relational databases -'),
 (528,'Towards a general concurrency control algorithm for database systems'),
 (529,'Interactive state-space analysis of concurrent systems'),
 (530,'A comprehensive model for the design of distributed computer systems'),
 (531,'Performance and reliability analysis using directed acyclic graphs'),
 (532,'Automated analysis of discrete communication behavior'),
 (533,'Isomorphism between Petri nets and dataflow graphs'),
 (534,'On the reliability of the IBM MVS/XA operating system'),
 (535,'Essential elements of software engineering education revisited'),
 (536,'The evolution of Wang Institute\"s Master of Software Engineering program'),
 (537,'Teaching a software design methodology'),
 (538,'Exercises in software design'),
 (539,'Two complementary course sequences'),
 (540,'Software projects in an academic environment'),
 (541,'Experience with a software engineering project course'),
 (542,'Components of typical undergraduate software engineering courses'),
 (543,'Technology selection: an educational approach'),
 (544,'IAI corporate software engineering training and education program'),
 (545,'SPANNER: a tool for the specification - analysis - and evaluation of protocols'),
 (546,'Multidimensional timestamp protocols for concurrency control'),
 (547,'Facilitating mixed language programming in distributed systems'),
 (548,'A simulation study of the vertical-migration multiprocessor architecture'),
 (549,'Comparing the effectiveness of software testing strategies'),
 (550,'A generalized time Petri net model for performance analysis'),
 (551,'Production study of two phase locking in single-site database systems'),
 (552,'An evaluation of two new inference control methods'),
 (553,'An algorithm to decide feasibility of linear integer constraints'),
 (554,'The performance of alternative strategies for dealing with deadlocks'),
 (555,'Algebraic specifications as solutions of implementation equations'),
 (556,'Function point analysis: difficulties and improvements'),
 (557,'Systematic program development'),
 (558,'Rajdoot: a remote procedure call mechanism'),
 (559,'User-process communication performance in networks of computers'),
 (560,'A simulation study of two distributed task allocation procedures'),
 (561,'On the exact and approximate throughput analysis'),
 (562,'Mathematical model of composite objects'),
 (563,'Fragtypes: a basis for programming environments'),
 (564,'Executable logic specifications for protocol service interfaces'),
 (565,'Clarification of two phase locking in concurrent transaction processing'),
 (566,'Graph directed locking'),
 (567,'A taxonomy of scheduling in general-purpose distributed computing systems'),
 (568,'Optimizing shadow recovery algorithms'),
 (569,'An algebra for data flow diagram process decomposition'),
 (570,'A relational algebraic approach to protocol verification'),
 (571,'An automatic software design assistant'),
 (572,'Dependency directed reasoning and learning in systems maintenance support'),
 (573,'DEVS formalism: a framework for hierarchical model development'),
 (574,'An expert database design system based on analysis of forms'),
 (575,'Effects of field service on software reliability'),
 (576,'Preserving abstraction in concurrent programming'),
 (577,'The formal specification of small bookshop information system'),
 (578,'Reasoning about interactive systems'),
 (579,'A software environment for the specification and analysis'),
 (580,'Automated protocol implementation with RTAG'),
 (581,'PROTEAN: a high-level Petri net tool'),
 (582,'The IC* model of parallel computation and programming environment'),
 (583,'PROSPEC: an interactive programming environment'),
 (584,'Development of Veda - a prototyping tool for distributed algorithms'),
 (585,'Protocol conversion'),
 (586,'MAP 2.1 conformance testing tools'),
 (587,'Entity structure based design methodology: a LAN protocol example'),
 (588,'Semiautomatic implementation of protocols using an Estelle-C compiler'),
 (589,'An interactive protocol synthesis algorithm'),
 (590,'Verification of concurrent control flow in distributed computer systems'),
 (591,'Mean value analysis for blocking queueing networks'),
 (592,'Version support for engineering database systems'),
 (593,'Experiments in optimizing FP'),
 (594,'A language and system for the construction and tuning of parallel programs'),
 (991,'Subspaces of GF(q)^omega and convolutional codes'),
 (992,'An n^3/2 lower bound'),
 (993,'Two nonlinear lower bounds for on-line computations'),
 (994,'Unbounded program memory'),
 (995,'A synchronization logic'),
 (996,'The complexity of sorting on distributed systems'),
 (997,'On static logics - dynamic logics - and complexity classes'),
 (998,'On the complexity of concurrency control by locking'),
 (999,'Process algebra for synchronous communication'),
 (1000,'A semantic approach to program modularity'),
 (1001,'A game theoretic approach to robust filtering'),
 (1002,'Dynamic - first-fit packings in two or more dimensions'),
 (1003,'Randomness conservation inequalities;'),
 (1004,'Compatability and commutativity of lock modes'),
 (1005,'A logic for constant-depth circuits'),
 (1006,'On acyclic database decomposition'),
 (1007,'A fresh look at free choice nets'),
 (1008,'An average case analysis of Floyd\"s algorithm to construct heaps'),
 (1009,'On quasi-perfect property of double-error-correcting Goppa codes'),
 (1010,'Diamond formulas: a fragment of dynamic logic'),
 (1011,'The complexity of promise problems'),
 (1012,'Deciding full branching time logic'),
 (1013,'Semantics of communicating processes'),
 (1014,'Fixed-point characterization of context-free inifinity-languages'),
 (1015,'Arbitrary versus periodic storage schemes'),
 (1016,'An intermediate machine technique'),
 (1017,'Effectively given domains and lambda-calculus models'),
 (1018,'Optimal hashing'),
 (1019,'Alternation between auxiliary pushdown automata'),
 (1020,'On similarity and duality of computation (I)'),
 (1021,'Optimal decision trees and one-time-only branching programs'),
 (1022,'Functional behavior of nondeterministic and concurrent programs'),
 (1023,'An upper and lower bound for clock synchronization'),
 (1024,'On the spectra of universal relational sentences'),
 (1025,'Fault tolerance and storage reduction in binary search trees'),
 (1026,'An approach for generating different types of Gray codes'),
 (1027,'A decidable propositional dynamic logic with explicit probabilities'),
 (1028,'Geometric retrieval problems'),
 (1029,'The uniform conjugacy problem for finite Church-Rosser Thue systems'),
 (1030,'Fast probabilistic RAM simulation'),
 (1031,'Can message buffers be axiomatized in linear temporal logic ?'),
 (1032,'Direction independent context-sensitive grammars'),
 (1033,'A programming language for the inductive sets - and applications'),
 (1034,'Dynamic C-oriented polygonal intersection searching'),
 (1035,'An algorithm for covering polygons with rectangles'),
 (1036,'An easy proof of Greibach normal form'),
 (1037,'On the progress of communication between two finite-state machines'),
 (1038,'Hash functions for priority queues'),
 (1039,'Unraveling k-page graphs'),
 (1040,'On the relationship between'),
 (1041,'On relative completeness of Hoare logics'),
 (1042,'An area-maximum edge length trade-off for VLSI layout'),
 (1043,'The complexity of cubical graphs'),
 (1044,'Implicit data structures for weighted elements'),
 (1045,'A proof rule for fair termination of guarded commands'),
 (1046,'The complexity of equivalence problems for commutative grammars'),
 (1047,'Alternation with restrictions on looping'),
 (1048,'Fast recognition of pushdown automaton and context-free languages'),
 (1049,'The power of the future perfect in program logics'),
 (1050,'Uniform characterizations of non-uniform complexity measures'),
 (1051,'A zero-one law for logic with a fixed-point operator'),
 (1052,'Optimal parallel pattern matching in strings'),
 (1053,'Some characterizations of multihead finite automata'),
 (1054,'On space and time efficient TM simulations'),
 (1055,'Optimal parallel algorithms for string matching'),
 (1056,'There is no polynomial deterministic space simulation of probabilistic space'),
 (1057,'Symmetrical one-dimensional cellular spaces'),
 (1058,'AVL-trees for localized search'),
 (1059,'Lower time bounds for solving linear Diophantine equations'),
 (1060,'The critical complexity of all (monotone) boolean functions'),
 (1061,'Functional dependencies and constraints on null values in database relations'),
 (1062,'Deterministic coin tossing with applications to optimal parallel list ranking'),
 (1063,'The density and complexity of polynomial cores for intractable sets'),
 (1064,'Aggregating inductive expertise'),
 (1065,'Probabilistic propositional temporal logics'),
 (1066,'Inductive inference of approximations'),
 (1067,'A note on some simultaneous relations among time - space - and reversal'),
 (1068,'Every sequence is reducible to a random one'),
 (1069,'Pre-analysis locking'),
 (1070,'Definability by constant-depth polynomial-size circuits'),
 (1071,'An automata-theoretical characterization of the OI-hierarchy'),
 (1072,'Retraction map categories and their applications to the construction'),
 (1073,'An exponential lower bound for real-time branching programs'),
 (1074,'An ideal model for recursive polymorphic types'),
 (1075,'On the power of two-way random generators'),
 (1076,'Simulation of large networks on smaller networks'),
 (1077,'A note on succinct representations of graphs'),
 (1078,'Function definitions in term rewriting and applicative programming'),
 (1079,'Systolic trellis automata: stability: decidability and complexity'),
 (1080,'On relativized exponential and probabilistic complexity classes'),
 (1081,'A descriptive model of success for computer-based information systems'),
 (1082,'A user evaluation of information characteristics'),
 (1083,'Empirical investigation of systems development practices and results'),
 (1084,'The impact of requirements analysis'),
 (1085,'A systems life cycle for office automation projects'),
 (1086,'A framework for systems analysis for decision support systems'),
 (1087,'Attitudes toward telecommuting'),
 (1088,'The impact of DSS on organizational communication'),
 (1089,'The relevance of microcomputers'),
 (1090,'An effective database formation for decision cupport systems'),
 (1091,'Office automation in British Rail'),
 (1092,'Effects of individual characteristics -'),
 (1093,'A synopsis of present day practices'),
 (1094,'Productive capacity of a system for software development'),
 (1095,'The evolution of a distributed processing network'),
 (1096,'A survey of applications systems prototyping in industry'),
 (1097,'Reasoning with imprecise knowledge in expert systems'),
 (1098,'Relational-product architectures for information processing'),
 (1099,'A model for an expert system for medium access control'),
 (1100,'Symbolic normalized acquisition and representation of knowledge'),
 (1101,'Detection - decision - and missing information'),
 (1102,'Implementing imprecision in information systems'),
 (1103,'Emergency-oriented expert systems: a fuzzy approach'),
 (1104,'File handling for detail and extent and for subtasks'),
 (1105,'Frame representation of physical systems for expert system use'),
 (1106,'Generalized network modeling and diagnosis using financial ratios'),
 (1107,'Specialized speech: a first prose for language expert systems'),
 (1108,'The development of a medical expert system'),
 (1109,'A formal model of diagnostic inference'),
 (1110,'A formal model of diagnostic inference'),
 (1111,'Principles of information structure'),
 (1112,'The analysis of simple list structures'),
 (1113,'A VLSI implementation of a fuzzy-inference engine'),
 (1114,'A partitioning algorithm for distributed software systems design'),
 (1115,'Computing human oriented descriptions'),
 (1116,'A note on rule representation in expert systems'),
 (1117,'Weights of evidence and internal conflict for support functions'),
 (1118,'Correctness proofs for the majority consensus algorithm'),
 (1119,'The complementary process of fuzzy medical diagnosis and its properties'),
 (1120,'Letter-oriented reciprocal hashing scheme'),
 (1121,'Complete test-set generation for bridging faults'),
 (1122,'Three-way two-dimensional finite automata with rotated inputs'),
 (1189,'Parallel parsing of programming languages'),
 (1190,'Analysis of a class of cluster-based multiprocessor systems'),
 (1191,'Dependability evaluation of interconnection networks'),
 (1192,'Self-routing control algorithms'),
 (1193,'Fuzzy semilattices'),
 (1194,'Additive information measures with preference of order beta'),
 (1195,'Efficient two-dimensional pattern matching in the presence of errors'),
 (1196,'Several properties of array languages'),
 (1197,'Algorithms for some graph problems on a distributed computational model'),
 (1198,'Alpha-beta search on virtual tree machines'),
 (1199,'An SIMD machine for low-level vision'),
 (1200,'Realization of permutations on generalized INDRA networks'),
 (1201,'Performance analysis of multistage interconnection networks'),
 (1202,'Shannon\"s random-cipher result and the R-norm information'),
 (1203,'Computational issues in solid boundary evaluation'),
 (1204,'On observability of discrete-event systems'),
 (1205,'Decentralized supervisory control of discrete-event systems'),
 (1206,'A multiprocessor system for real-time robotic control'),
 (1207,'A note on three-way two-dimensional alternating Turing machines'),
 (1208,'Batched searching in database organizations'),
 (1209,'An optimal algorithm for Reve\"s puzzle'),
 (1210,'A preservation theorem for fuzzy number theory'),
 (1211,'A new concatenated BCH-matrix type-B code'),
 (1212,'Structured extension of Cobol for handling data bases'),
 (1213,'Random access in a list environment'),
 (1214,'Significations: the key to unify data base management'),
 (1215,'Security for the GPLAN system'),
 (1216,'TORUS: a step towards bridging the gap between data bases and the casual user'),
 (1217,'Optimal tree lists for ONF storage and retrieval'),
 (1218,'Extensions and corrections for the CODASYL approach to data base management'),
 (1219,'Stored-data description and data translation: a model and language'),
 (1220,'Reduced combined indexes for efficient multiple attribute retrieval'),
 (1221,'Avoiding redundant record accesses in unsorted multilist file organizations'),
 (1222,'Towards a more familiar relational retrieval language'),
 (1223,'A generalized mapping language for network data structures'),
 (1224,'Multidimensional clustering for data base organizations'),
 (1225,'A unimodality property of optimal exhaustive prefix codes'),
 (1226,'Information systems theory'),
 (1227,'Are intelligent information systems ever achievable ? inviting a discussion'),
 (1228,'On algorithmic natural language analysis and understanding'),
 (1229,'Semantics of data bases: the semantics of data models'),
 (1230,'Comments on a paper Biller and Neuhold'),
 (1231,'Remarks on the comments of B. Langefors on our paper'),
 (1232,'Binary relations - matrices and inference developments'),
 (1233,'A class of hybrid list file organizations'),
 (1234,'Data base reorganization by clustering methods'),
 (1235,'Schema design using a data structure matrix'),
 (1236,'Efficient algorithms for answering queries with unsorted multilists'),
 (1237,'The WELL system: a multiuser database system'),
 (1238,'Dynamic file movement in multilevel storage systems'),
 (1239,'Formulation of choice criterions for file organizations');
INSERT INTO `paper` (`PaNum`,`Title`) VALUES 
 (1240,'Formal aspects of the relational model'),
 (1241,'Mapping external views to a common data model'),
 (1242,'The ANSI/X3/SPARC DBMS framework'),
 (1243,'Set-theoretic foundations of data-structure representation'),
 (1244,'Linguistic approach to database theory: DDL-s for hierarchical model'),
 (1245,'A cooperation system for heterogeneous data base management systems'),
 (1246,'On database systems viewed as programming languages'),
 (1247,'Comments on the paper of Cherniavsky'),
 (1248,'Report of the CODASYL data description language committee'),
 (1249,'A systematic approach to information systems development - I. introduction'),
 (1250,'Structured logical design information systems'),
 (1251,'Organization of quasi-consecutive retrieval files'),
 (1252,'On the equivalence of data base schema'),
 (1253,'File organizations and their reorganization'),
 (1254,'Further refinement of the linear quotient hashing method'),
 (1255,'Comments on Cherniavsky\"s paper'),
 (1256,'A systematic approach to information systems development - II.'),
 (1257,'Toward a unified view of'),
 (1258,'Comparing insertions schemes used to update 2-3 trees'),
 (1259,'Use of bipartite graphics as a notation for data bases'),
 (1260,'The integration of network data base management and problem resolution'),
 (1261,'Authorization in multilevel database models'),
 (1262,'Overflow handling in hashing tables: a hybrid approach'),
 (1263,'Manipulation of expressions in a relational algebra'),
 (1264,'On models of information retrieval processes'),
 (1265,'On the selection of the access path in inverted database organization'),
 (1266,'Height-balanced multiway trees'),
 (1267,'Rational data base standards: an examination of the 1978 CODASYL DDLC report'),
 (1268,'Information systems: on queries involving cardinalities'),
 (1269,'Comments on a paper by Eric K. Clemons'),
 (1270,'Grammatical data base model'),
 (1271,'Permitting updates through views of data bases'),
 (1272,'Experiments with a very efficient heuristic for clustering problems'),
 (1273,'LEGOL 2.0: a relational specification language for complex rules'),
 (1274,'A heuristic approach for determining the optimal degree of file inversion'),
 (1275,'Reducing block accesses in inverted files by partial clustering'),
 (1276,'Space utilization and access path length in B-trees'),
 (1277,'Infological models and information user views'),
 (1278,'An access control facility for relational data base systems'),
 (1279,'Optimizing the evaluation of calculus expressions'),
 (1280,'Data base communication in heterogeneous data base management system network'),
 (1281,'Proceduralism and parallelism in specification languages'),
 (1282,'Approximate pattern matching in a pattern database system'),
 (1283,'On limitations of artificial intelligence'),
 (1284,'A uniform formal description of data base management systems'),
 (1285,'An experiment in learning DBTG database administration'),
 (1286,'A note on optimal allocation of files in a symmetric and homogeneous network'),
 (1287,'Temporal aspects of logical procedure definition'),
 (1288,'A model of cluster searching based on classification'),
 (1289,'The file allocation problem under dynamic usage'),
 (1290,'Alternate implementations of the conceptual schema'),
 (1291,'Matrix for retrieval and sorting'),
 (1292,'Applications of graph grammar theory'),
 (1293,'A query-maintenance language for the data independent accessing model II'),
 (1294,'Integrated data analysis and management for the problem solving environment'),
 (1295,'The application of data types to database semantic integrity'),
 (1296,'Natural language access to information systems'),
 (1297,'Database maintenance efficiency using differential files'),
 (1298,'Algorithms for processing partial match queries using word fragments'),
 (1299,'Interacting in natural language with artificial systems: the DONAU project'),
 (1300,'Database security - system architectures'),
 (1301,'On data dependency structures of relational databases'),
 (1302,'Structured methodology for designing static and dynamic aspects'),
 (1303,'Complexity of a proposed database storage structure'),
 (1304,'Utilization of data access and manipulation in conceptual schema definitions'),
 (1305,'Dynamic modelling of a simple existence constraint'),
 (1306,'RDBM - a relational data base machine'),
 (1307,'Imprecision of specification of information systems parameters'),
 (1308,'Computed chaining: a hybrid of direct chaining and open addressing'),
 (1309,'Four-schema approach: an extended model for database architecture'),
 (1310,'A note on human factors issues'),
 (1311,'A data base management system for document retrieval applications'),
 (1312,'Key compression using segment strings'),
 (1313,'CODASYL Fortran data base facility'),
 (1314,'Allocation of copies of s distinct files in an information network'),
 (1315,'Information systems theoretical considerations'),
 (1316,'An implementation of relational interface to an information retrieval system'),
 (1317,'Management information systems structure - types and integration'),
 (1318,'The power of inequality semijoins'),
 (1319,'Data base design constrained by traffic load estimates'),
 (1320,'Applying simple theory of types to data bases'),
 (1123,'On selecting rollback points for error recovery'),
 (1124,'Fuzzy subgroups: some characterizations II'),
 (1125,'A comment on \"NP = P? and restricted partitions\"'),
 (1126,'Foreword: special issue on theory of choice and voting'),
 (1127,'Tournament methods in choice theory'),
 (1128,'Hierarchical voting'),
 (1129,'Control of social choice systems'),
 (1130,'Asymptotic properties of the paths in a specific voting model'),
 (1131,'On a class of best-choice problems'),
 (1132,'A structural representation of shape and its features'),
 (1133,'Normal form of extended table matrix L systems'),
 (1134,'The relative dimension of a probabilistic experiment'),
 (1135,'A scheme for constructing ordered minimal prefect hashing functions'),
 (1136,'Arithmetic codes resembling neural encoding'),
 (1137,'Weighted minimum and maximum operations in fuzzy set theory'),
 (1138,'A short note on the redundancy of degree alpha'),
 (1139,'Effect of data organization in a system of interleaved memories'),
 (1140,'Fuzzy groups: some group-theoretic analogs'),
 (1141,'On fuzzy convergence'),
 (1142,'Design of optimal filters for error-feedback quantization'),
 (1143,'An improved protocol validation technique for a class of communication models'),
 (1144,'Direction-independent grammars with contexts'),
 (1145,'On the average case analysis of some satisfiability model problems'),
 (1146,'On the derivation of memberships for fuzzy sets in expert systems'),
 (1147,'On two-dimensional pattern-matching languages and their decision problems'),
 (1148,'Finding fundamental cycles and bridges on a tree-structures parallel computer'),
 (1149,'Signal space geometry'),
 (1150,'Lower bounds over codes'),
 (1151,'Lattice model of browsable data spaces'),
 (1152,'System-level diagnosis: analysis of two new models'),
 (1153,'An LDU decomposition algorithm for a block Toeplitz matrix'),
 (1154,'Detection of interlocking components in three-dimensional digital pictures'),
 (1155,'Order-alpha weighted information energy'),
 (1156,'Fuzzy entropy and conditioning'),
 (1157,'Efficient generation of binary trees from inorder-postorder sequences'),
 (1158,'Markov reliability models of fault-tolerant distributed computing systems'),
 (1159,'(p -q)-logical completeness for output-coherent sets'),
 (1160,'The p-valued-input - q-valued-output threshold logic'),
 (1161,'Satisfying solutions for a possibilistic linear program'),
 (1162,'Constrained string editing'),
 (1163,'Set-based representations of conjunctive and disjunctive knowledge'),
 (1164,'Polynomial-average-time satisfiability problems'),
 (1165,'Towards an abstract theory of dependency constraints in relational databases'),
 (1166,'A parallel approach for theorem proving in propositional logic'),
 (1167,'Fuzzy groups: some group theoretic analogs II'),
 (1168,'On the Dempster-Shafer framework and new combination rules'),
 (1169,'Bivariate certainty and information measures'),
 (1170,'An application of Shannon\"s coding theorem'),
 (1171,'Data analysis using a geometrical representation of predicate calculus'),
 (1172,'Optimal matching of deformed patterns with positional influence'),
 (1173,'A hierarchy of random-context grammars and automata'),
 (1174,'Partitioning and separating sets of orthogonal polygons'),
 (1175,'Generalized distances in digital geometry'),
 (1176,'An entropic approach'),
 (1177,'On the diagnosability problem for a general model of diagnosable systems'),
 (1178,'A practical divide-and-conquer algorithm'),
 (1179,'Distance functions in digital geometry'),
 (1180,'A general algorithm for finding a shortest path between two n-configurations'),
 (1181,'A hierarchical system of learning automata'),
 (1182,'A practical approach to transforming extended ER diagrams'),
 (1183,'An algebraic synthesis of the foundations of logic and probability'),
 (1184,'Metric bounds on losses in adaptive coding'),
 (1185,'Software fault tolerance in real-time systems'),
 (1186,'A loopless and optimal algorithm for the cyclic towers of Hanoi problem'),
 (1187,'Domain oriented analysis of PDE splitting algorithms'),
 (1188,'On the direct parallel solution of systems of linear equations'),
 (859,'Preservation of expressive completeness in temporal models'),
 (860,'Type theories - normal forms - and Dinf-lambda-models'),
 (861,'Computing short generator sequences'),
 (862,'A generalized Grzegorczyk hierarchy and low complexity classes'),
 (863,'Optimal computation of finitely oriented convex hulls'),
 (864,'Reductions among number theoretic problems'),
 (865,'A new look at fault-tolerant network routing'),
 (866,'Petri nets - algebras - morphisms - and compositionality'),
 (867,'Qualitative robustness in time series'),
 (868,'Area-time optimal division for T = Omega((log n)^1+eps)'),
 (869,'Lower bounds on communication complexity'),
 (870,'The decentralized Wald problem'),
 (871,'Layouts with wires of balanced length'),
 (872,'Semi-commutations'),
 (873,'Parallel time O(log n) recognition of unambiguous context-free languages'),
 (874,'Semantics of production systems'),
 (875,'Separation and lower bounds for ROM'),
 (876,'Algebra of constructions I. The world problem for partial algebras'),
 (877,'Object histories which avoid certain subsequences'),
 (878,'Weak and strong fairness in CCS'),
 (879,'Look-ahead on pushdowns'),
 (880,'Information compression and Varshamov-Gilbert bound'),
 (881,'On the recursion depth of special tree traversal algorithms'),
 (882,'On fault tolerant routings in general networks'),
 (883,'An efficient algorithm for multiprocessor fault diagnosis'),
 (884,'The Dyck language D1* is not generated by any matrix grammar of finite index'),
 (885,'Identification of pattern languages from examples and queries'),
 (886,'On-line updating of solutions to a class of matroid intersection problems'),
 (887,'Finding the minimum bandwidth of an interval graph'),
 (888,'Simulating synchronous processors'),
 (889,'Easy multiplications I. The realm of Kleene\"s theorem'),
 (890,'Convex powerdomains I.'),
 (891,'One-way functions and circuit complexity'),
 (892,'On using deterministic functions to reduce randomness'),
 (893,'Time-space efficient algorithms for computing convolutions'),
 (894,'Parallel recognition and decomposition of two terminal series parallel graphs'),
 (895,'Towards optimal parallel bucket sorting'),
 (896,'Efficient fault-tolerant routings in networks'),
 (897,'The hierarchical structure of graph searches'),
 (898,'Learning regular sets from queries and counterexamples'),
 (899,'The node visit cost of brother trees'),
 (900,'Asynchronous Byzantine agreement protocols'),
 (901,'Comparison of the power between reversal-bounded ATMs'),
 (902,'On the bit complexity of distributed computations in a ring with a leader'),
 (903,'On the Monte Carlo space constructible functions'),
 (904,'Needed reduction and spine strategies for the lambda calculus'),
 (905,'Safe states in banker-like resource allocation problems'),
 (906,'Fixed point equations with parameters in the projective model'),
 (907,'The pursuit of deadlock freedom'),
 (908,'Optimal parallel randomized algorithms for sparse addition and identification'),
 (909,'Limits on the power of concurrent-write parallel machines'),
 (910,'Strictness analysis and denotational abstract interpretation'),
 (911,'The calculus of constructions'),
 (912,'The equational theory of parameterized specifications'),
 (913,'A semantics of multiple inheritance'),
 (914,'Specifications in an arbitrary institution'),
 (915,'Polymorphic type inference and containment'),
 (916,'Partial morphisms in categories of effective objects'),
 (917,'Pebble - a kernel language for modules and abstract data types'),
 (918,'A new fault-tolerant algorithm for clock synchronization'),
 (919,'Polynomial terse sets'),
 (920,'Mathematical optimization and the synchronizing properties of encodings'),
 (921,'Probability and plurality for aggregations of learning machines'),
 (922,'The problem of space invariance for sequential machines'),
 (923,'One-step completely orthogonalizable codes from generalized quadrangles'),
 (924,'Reducibility of types in typed labmda calculus'),
 (925,'Synthesizing inductive expertise'),
 (926,'How robust is the n-cube ?'),
 (927,'Why Godel didn\"t have Church\"s thesis'),
 (928,'The recursion-theoretic complexity'),
 (929,'The complexity of the validity problem for dynamic logic'),
 (930,'Processes and the denotational semantics of concurrency'),
 (931,'Propositional dynamic logic of looping and converse is elementarily decidable'),
 (932,'Robustness of probabilistic computational complexity classes'),
 (933,'Using string languages to describe picture languages'),
 (934,'The completeness of the algebraic specification methods'),
 (935,'Characterization theorems for a filter lambda model'),
 (936,'On reversal-bounded counter machines'),
 (937,'How to reuse a \"write once\" memory'),
 (938,'On efficient simulations of multicounter machines'),
 (939,'Circuit-size lower bounds and non-reducibility to sparse sets'),
 (940,'On the security of ping pong protocols'),
 (941,'The inference problem for template dependencies'),
 (942,'On the unique satisfiability problem'),
 (943,'A consistent extension of the lambda calculus'),
 (944,'A tight Omega(log log n) bound on the time'),
 (945,'Fair derivations in context-free grammars'),
 (946,'A note on deterministic and nondeterministic time complexity'),
 (947,'The theory of fringe analysis and its application to 2-3 trees and B-trees'),
 (948,'Looping vs. repeating in dynamic logic'),
 (949,'Two-dimensional alternating Turing machines with only universal states'),
 (950,'The enumeration of certain run length sequences'),
 (951,'Channel distances and representation'),
 (952,'Isomorphism of k-contractible graphs.'),
 (953,'Isomorphism of graphs which are pairwise k-separable'),
 (954,'The recognition of deterministic CFLs in small time and space'),
 (955,'A formal notion of program-based test data adequacy'),
 (956,'Temporal logic can be more expensive'),
 (957,'Pseudo-extensions of computable functions'),
 (958,'Termination assertions for recursive programs'),
 (959,'Ambiguity and decision problems concerning number systems'),
 (960,'The implication problem for functional and inclusion dependencies'),
 (961,'Dynamic parallel memories'),
 (962,'Sucinct representations of graphs'),
 (963,'On storage media with aftereffects'),
 (964,'Tree automata and attribute grammars'),
 (965,'Commutative grammars: the complexity of uniform word problems'),
 (966,'On the random oracle hypothesis'),
 (967,'Deterministic dynamic logic is strictly weaker than dynamic logic'),
 (968,'Deterministic process logic is elementary'),
 (969,'Optimal orientations of cells in slicing floorplan designs'),
 (970,'Connections between two theories of concurrency'),
 (971,'The non-sequential behaviour of Petri nets'),
 (972,'Loops in combinator-based compilers'),
 (973,'On the strength of \"sometimes\" and \"always\" in program verification'),
 (974,'Complexity of the first-order theory of almost all finite structures'),
 (975,'Some applications of a theorem of Shirshov to language theory'),
 (976,'Discrete random process stabilization'),
 (977,'Patterns and pattern-matching in trees: an analysis'),
 (978,'Nontrivial definability by flow-chart programs'),
 (979,'Relativizations comparing NP and exponential time'),
 (980,'The complexity of evaluating relational queries'),
 (981,'Parallel computations'),
 (982,'Area-time optimal VLSI integer multiplier with minimum computation time'),
 (983,'On the computational complexity of ordinary differential equations'),
 (984,'The satisfiability problem for a class consisting'),
 (985,'Repetition of subwords in D0L languages'),
 (986,'Synchronous and asynchronous experiments on processes'),
 (987,'Mental poker with three or more players'),
 (988,'Regular dynamic logic is not interpretable'),
 (989,'Algebraic semantics of recursive flowchart schemes'),
 (990,'Semantics for classical AUTOMATH and related systems'),
 (1585,'Algorithms for permutation channel routing'),
 (1586,'Expandable arithmetic block macrocell'),
 (1587,'SYSIM: a simulation tool for systolic processors'),
 (1588,'A compact and modular VLSI design'),
 (1589,'Combinational static CMOS networks'),
 (1590,'VLSI with a very low scale investment'),
 (1591,'Microprogramming implementation of timed Petri nets'),
 (1592,'Semantics of a hardware specification language'),
 (1593,'A high speed 2-D discrete cosine transform chip'),
 (1594,'Integrated FIR median hybrid filter'),
 (1595,'About folded-PLA area and folding evaluation'),
 (1596,'An effective algorithm for optimal PLA column folding'),
 (1597,'A bottom-up layout technique based on two-rectangle routing'),
 (1598,'VLSI computations: from physics to algorithms'),
 (1599,'Evaluation of a prototype VLSI tester'),
 (1600,'Design rule checking and VLSI'),
 (1601,'Applications of computational geometry to VLSI layout pattern design'),
 (1602,'New algorithms for increased efficiency in hierarchical design rule checking'),
 (1603,'The role of virtual memory in the handling of application files'),
 (1604,'Programmed simulation of sequential circuits'),
 (1605,'The solution of a problem by Ginsburg'),
 (1606,'Programmed simulation of race hazards in sequential circuits'),
 (1607,'A run-time mechanism for referencing variables'),
 (1608,'General programs for management systems'),
 (1609,'Stacking without really stacking when reducing categorical expressions'),
 (1610,'Notes on avoiding \"go to\" statements'),
 (1611,'A V^2 algorithm for determining isomorphism of planar graphs'),
 (1612,'The performance of interactive information retrieval'),
 (1613,'A note on comparison of subrecursive hierarchies'),
 (1614,'An existence lemma for canonical forms in symbolic mathematics'),
 (1615,'A note on scattered context grammars'),
 (1616,'An n^2 algorithm for determining the bridges of a graph'),
 (1617,'Efficient determination of the transitive closure of a directed graph'),
 (1618,'The two-thirds rule for dynamic storage allocation under equilibrium'),
 (1619,'Representation and equality of modes'),
 (1620,'Evaluating polynomials at many points'),
 (1621,'Input-output modeling and identification of linear automata'),
 (1622,'On the use of complete subgraphs in cluster analysis'),
 (1623,'Software data paging and segmentation for complex systems'),
 (1624,'The critical value of the basic parameter'),
 (1625,'A classification of extensible programming languages'),
 (1626,'ECT - an extensible-contractable translator system'),
 (1627,'Programming by induction'),
 (1628,'Soft precedence'),
 (1629,'Expression evaluation with minimum average working storage'),
 (1630,'Recursion and stacks'),
 (1631,'Outline of a machine without branch instructions'),
 (1632,'Determining whether a groupoid is a group'),
 (1633,'Protection in operating systems'),
 (1634,'An efficient algorithm for determining the convex hull of a finite planar set'),
 (1635,'Automatic content analysis in an on-line environment'),
 (1636,'A context-free syntax of Algol 68'),
 (1637,'Fast and read-only algorithms for traversing trees without an auxiliary stack'),
 (1638,'Feature evaluation with quadratic mutual information'),
 (1639,'A fast method for interpolation using preconditioning'),
 (1640,'A new additive pseudorandom number generator for extremely short word-lengths'),
 (1641,'On an approach to integrating boundary problems with a non-unique solution'),
 (1642,'An experiment in optimal sorting'),
 (1643,'Information streams sharing a finite buffer'),
 (1644,'On an extension of Dijkstra\"s semaphore primitives'),
 (1645,'Priority processes used for scheduling'),
 (1646,'Short note on a heuristic search strategy in long-term memory networks'),
 (1647,'A refinement procedure for pure random search'),
 (1648,'The equivalence problem for deterministic T0L-systems is undecidable'),
 (1649,'Iterative methods for solving difference equations'),
 (1650,'Synthesis of a discrete-time optimal filter algorithm'),
 (1651,'Storage requirements in stochastic data acquisition systems'),
 (1652,'Bounds on the weighted path length of binary trees'),
 (1653,'Oriented balanced trees and equivalence relations'),
 (1654,'A note on infinite trees'),
 (1655,'Direct proofs of the undecidability of the equivalence problem'),
 (1656,'Design parameters for a multiserver computer processing buffering system'),
 (1657,'An unintentional omission from Algol 68'),
 (1658,'XCRIBL - a hardcopy scan line graphics system for document generation'),
 (1659,'Representation of binary trees on associative memories'),
 (1660,'Experiments in multi-lingual information retrieval'),
 (1661,'An improved algorithm for traversing binary trees without auxiliary stack'),
 (1662,'A note on the relative performance of two disk scanning policies'),
 (1663,'On the identification of the convex hull'),
 (1664,'A note on the number of states of the De Remer\"s recognizer'),
 (1665,'Numerical differentiation of experimental data'),
 (1666,'A transformation of marked graphs'),
 (1667,'A note on leftmost restricted random context grammars'),
 (1668,'An algorithm for obtaining the chromatic number'),
 (1669,'On computing the time complexity of transitive closure algorithms'),
 (1670,'Parallel/sequential array automata'),
 (1671,'Scanning list structures without stacks or tag bits'),
 (1672,'Another representation of binary tree traversal'),
 (1673,'A generalization of the method of finite differences'),
 (1674,'On universal computer-constructors'),
 (1675,'A modified branch-and-bound strategy'),
 (1676,'A limit theorem for sets of subwords in deterministic T0L languages'),
 (1677,'Examples of formal grammars with weights'),
 (1678,'Applying the minimax rule over graphs which are not trees'),
 (1679,'A general observation law for queueing disciplines'),
 (1680,'On one class of iterative methods for obtaining the generalized solution'),
 (1681,'A note on implementing parallel assignment instructions'),
 (1682,'A dynamic storage allocation problem'),
 (1683,'Syntax-directed unit conversion'),
 (1684,'On a problem connected with topological sorting'),
 (1685,'Realization of Petri nets without conditional statements'),
 (1686,'A max(m -n) algorithm for determining the graph H from its line graph G'),
 (1687,'Some properties of fully reducible graphs'),
 (1688,'On the convergence of difference schemes approximating a plane static'),
 (1689,'A linear time two tape merge'),
 (1690,'A technique for reducing comparison times'),
 (1691,'Minimal comparison sorting by choosing most efficient comparisons'),
 (1692,'An example of a PD2L-system with the growth type 2 1/2'),
 (1693,'The inclusion of the substitution closure of linear and one-counter languages'),
 (1694,'On the non-compactness of the class of program schemas'),
 (1695,'Simple algorithms for traversing a tree without an auxiliary stack'),
 (1696,'A new upper bound on the complexity of derivative evaluation'),
 (1697,'Numerical solution of a boundary problem for equations of elastic equilibrium'),
 (1698,'A structured program to generate all topological sorting arrangements'),
 (1699,'On a notational device for the description'),
 (1700,'A note on finding the bridges of a graph'),
 (1701,'A stable minimum storage sorting algorithm'),
 (1702,'Optimization of store size for garbage collection'),
 (1703,'Cost-oriented program optimisation'),
 (1704,'\"Software devices\" for processing graphs using PL/I compile time facilities'),
 (1705,'The identification of parallel micro-operations'),
 (1706,'The length sets of D0L languages are uniformly bounded'),
 (1707,'The Earley algorithm as a problem representation'),
 (1708,'Median selection of 9 elements in 14 comparisons'),
 (1709,'A new algorithm for finding weak components'),
 (1710,'Information streams sharing in a finite buffer: other solutions'),
 (1711,'An improved bound for detecting looping configurations in deterministic DPA\"s'),
 (1712,'A note on semilinear sets and bounded-reversal multihead pushdown automata'),
 (1713,'Bounded workspace garbage collection'),
 (1714,'Note on a modification of the fundamental cycles finding algorithm'),
 (1715,'A note on the ambiguity of context-free grammars'),
 (1716,'Optimal use of storage in a simple model of garbage collection'),
 (1717,'Structured operating system organization'),
 (1718,'Remark on the computational power of a Turing machine variant'),
 (1719,'Abstract computation model usd for a production compiler'),
 (1720,'A good algorithm for edge-disjoint branching'),
 (1721,'A note on extending equivalence theories of algorithms'),
 (1722,'Computer generation of vertex graphs'),
 (1723,'A synchronization anomaly'),
 (1724,'On the cardinality of some lattices'),
 (1725,'On T0L languages over terminals'),
 (1726,'On the minimization of control memories'),
 (1727,'On the vector representation of the reachability in planar directed graphs'),
 (1728,'A decidability theorem for a class of vector-addition systems'),
 (1729,'Bounds for 4-matroid intersection problems'),
 (1730,'Evading the drift in floating-point addition'),
 (1731,'A simple Fortran support for computer-assisted instructions'),
 (1732,'Program schemata with polynomial bounded counters'),
 (1733,'Structured implementation of symbolic execution'),
 (1734,'Interpretation of non-deterministic algorithms in higher-level languages'),
 (1735,'An algorithm for testing chordality of graphs'),
 (1736,'Finding near neighbours in k-dimensional space'),
 (1737,'On the graceful numbering of spanning trees'),
 (1738,'Retrieval from context trees'),
 (1739,'Numerical methods for solving integral equations of potential problems'),
 (1740,'A simple solution to the interleaved memory bandwidth problem'),
 (1741,'A comparison of simulation results and a mathematical model'),
 (1742,'On the divergence and the Joshi dependence measure in feature selection'),
 (1743,'The membership question for ET0L-languages is polynomially complete'),
 (1744,'The time required to evaluate division-free arithmetic expressions'),
 (1745,'Design of queueing buffer register size'),
 (1746,'An elementary computer algorithm'),
 (1747,'Universal types in Concurrent Pascal'),
 (1748,'A fast compacting garbage collector'),
 (1749,'Analysis of range searches in quad trees'),
 (1750,'LL(1) grammars supporting an efficient error handling'),
 (1751,'On the complexity of quaternion multiplication'),
 (1752,'On the generation of permutations'),
 (1753,'On the programming of elastic stores'),
 (1754,'Should the stable rounding rule be radix-dependent ?'),
 (1755,'Sequence-to-sequence recursiveness'),
 (1756,'Three results of comparison between L languages with and without interaction'),
 (1757,'ET0L-grammars and N-grammars'),
 (1758,'On homomorphic images of transition graphs'),
 (1759,'Some observations on the determination of an upper bound'),
 (1760,'Some properties of centroid of a free tree'),
 (1761,'An O('),
 (1762,'Optimal chain partitions of trees'),
 (1763,'A note on optimal scheduling for two-processor systems'),
 (1764,'LL-regular grammars'),
 (1765,'Complete operator precedence'),
 (1766,'A linear algorithm for the domination number of a tree'),
 (1767,'On the additive complexity of specific polynomials'),
 (1768,'A rationale for the numerical differentiation of experimental data'),
 (1769,'A generating function for entropy'),
 (1770,'Priority queues with update and finding minimum spanning trees'),
 (1771,'On a correspondence between binary trees and a certain type of permutation'),
 (1772,'A fast algorithm for copying binary trees'),
 (1773,'A dual link data structure for random file organization'),
 (1774,'Loop unravelling: a practical tool for proving program correctness'),
 (1775,'Crossvalidation: minimizing the entropy of the future'),
 (1776,'On the complexity of inexact computations'),
 (1777,'Subgraph isomorphism - matching relational structures and maximal cliques'),
 (1778,'Two fast simulations which imply some fast'),
 (1779,'Comments on \"A synchronization anomaly\"'),
 (1780,'Optimal alphebetic search trees with restricted maximal height'),
 (1781,'Scheduling of unit-length independent tasks with execution constraints'),
 (1782,'A note on precedence functions'),
 (1783,'On the storage space requirement of consecutive retrieval with redundancy'),
 (1784,'Noiselike transforms of omega-events'),
 (1785,'A simple variant of the boundary-tag algorithm'),
 (1786,'Layer - a language construction for Concurrent Pascal program design'),
 (1787,'A note on the semantic definition of side effects'),
 (1788,'The logical meaning of programs of a subrecursive language'),
 (1789,'On slicing of K-iteration grammars'),
 (1790,'Heuristics for partial-match retrieval data base design'),
 (1791,'Numerical solution of integral equations for potential problems'),
 (1792,'A proof rule for multiple coroutine systems'),
 (1793,'Generalized lattices applicable in retrieval models'),
 (1794,'The complexity of vector products'),
 (1795,'An algorithm for finding all shortest paths'),
 (1796,'Copying theorems'),
 (1797,'A note on K-iteration grammars'),
 (1798,'Automatic generation of lexical analyzers in a compiler-compiler'),
 (1799,'A distributed index sequential access method'),
 (1800,'An application of pattern matching to a problem in geometrical complexity'),
 (1801,'On finding all unilaterally connected components of a digraph'),
 (1802,'Implementing dictionaries using binary trees of very small height'),
 (1803,'Constructing optimal binary decision trees is NP-complete'),
 (1804,'On the parallel evaluation of division-free arithmetic expressions'),
 (1805,'Relative complexity of checking and evaluating'),
 (1806,'Recursiveness of monotonic array grammars and a hierarchy of array languages'),
 (1807,'Improvements on fast methods for generating normal random variables'),
 (1808,'A hashing method for fast set operations'),
 (1809,'Toward a system\"s environment for computer assisted programming'),
 (1810,'Matrix multiplication by diagonals on a vector/parallel processor'),
 (1811,'Commutativity - non-commutativity - and bilinearity'),
 (1812,'A cascade algorithm for the local closure of a set of binary relations'),
 (1813,'A linear algorithm for the Hamiltonian completion number of a tree'),
 (1814,'N-reconstructability of context-free grammars'),
 (1815,'Finding nearest neighbours'),
 (1816,'A note on the complexity of the chromatic number problem'),
 (1817,'Storage for consecutive retrieval'),
 (1818,'Full table search by polynomial functions'),
 (1819,'A series expansion involving the harmonic numbers'),
 (1820,'On a problem in storage optimization'),
 (1821,'A note on linear precedence functions'),
 (1822,'An almost optimal algorithm for unbounded searching'),
 (1823,'On a semaphore anomaly'),
 (1824,'Interval analysis - pagination and program locality'),
 (1825,'A space-saving technique for assigning Algol 68 multiple values'),
 (1826,'On the complexity of finding the set of candidate keys'),
 (1827,'More on ET0L systems versus random context grammars'),
 (1828,'B-trees in a system with multiple users'),
 (1829,'Some improved bounds on the number of 1-factors of n-connected graphs'),
 (1830,'Comments on monitor definition and implementation'),
 (1831,'Some properties of deadlock detection and recovery'),
 (1832,'Enclosures: an access control mechanism'),
 (1833,'On program analysis'),
 (1834,'Semantics in problem representation and search'),
 (1835,'Linear expected time of a simple union-find algorithm'),
 (1836,'The D0L-ness of context-free languages is decidable'),
 (1837,'A pattern representation of indexed languages'),
 (1838,'Output driven implementation of recursive programs -'),
 (1839,'Garbage collecting a heap which includes a scatter table'),
 (1840,'A note on degree-constrained star subgraphs of bipartite graphs'),
 (1841,'Bracket-languages are recognizable in logarithmic space'),
 (1842,'A Gray code for set partitions'),
 (1843,'A family of rules for recursion removal'),
 (1844,'A generalization of Dijkstra\"s algorithm'),
 (1845,'Theil\"s estimator'),
 (1846,'Parallel hashing algorithms'),
 (1847,'Generalizations of line graphs and applications'),
 (1848,'A fast error evaluation algorithm for polynomial approximation'),
 (1321,'Compromisability of a statistical database'),
 (1322,'Data structuring with virtual sets'),
 (1323,'A new model for data base abstraction'),
 (1324,'Optimistic versus pessimistic concurrency control mechanisms'),
 (1325,'On the updatability of network views -'),
 (1326,'Dissimilarity and distance coefficients in automation-supported thesauri'),
 (1327,'Performance evaluation of four associative disk designs'),
 (1328,'A throughput model: sequential vs concurrent processing'),
 (1329,'Query optimisation using a data dictionary'),
 (1330,'Tree structures for high dimensionality nearest neighbor searching'),
 (1331,'Multidimensional B-trees for associative searching in database systems'),
 (1332,'An extended model for database implementation'),
 (1333,'Description models and the design of ADP systems: trends in Germany'),
 (1334,'Man-management communication in Portuguese'),
 (1335,'Axiomatic definitions for data model semantics'),
 (1336,'An ISR system based on Turkish language'),
 (1337,'Formal verification of information derivability in databases'),
 (1338,'Data security management in distributed data bases'),
 (1339,'Process model and resource management in a distributed database'),
 (1340,'Semantics - dynamic tradeoff in a relational database design'),
 (1341,'Incorporating English descriptions into a relational database'),
 (1342,'A prescriptive database interface methodology for end-users'),
 (1343,'A computer-aided methodology for conceptual data-base design'),
 (1344,'A consulting system for data base design'),
 (1345,'Reorganizing the files in a data base management system'),
 (1346,'A procedure to define the object type structure of a conceptual schema'),
 (1347,'Binary trees paging'),
 (1348,'Structural locking mechanisms'),
 (1349,'Achieving mutual exclusion in a distributed computing environment'),
 (1350,'A familial model of data for a multilevel schema framework'),
 (1351,'On recursive axioms in deductive databases'),
 (1352,'BASIS: a behavioral approach to the specification of information systems'),
 (1353,'Testing a dependency-preserving decomposition for losslessness'),
 (1354,'Navigational facilities for relational data base'),
 (1355,'A methodology to solve distributed termination problem'),
 (1356,'Abstractions in temporal information'),
 (1357,'A practitioner\"s guide to data base compression'),
 (1358,'The automatic generation of test data for a relational database'),
 (1359,'On correctness of information models'),
 (1360,'Privacy and security in information systems'),
 (1361,'Estimating record selectivities'),
 (1362,'Semantic hierarchies and abstractions in conceptual schemata'),
 (1363,'Integrity checking in data base systems'),
 (1364,'Binary search with variable-length keys with an index page'),
 (1365,'A seven-tuple representation for hierarchical data structures'),
 (1366,'A dynamic model for the optimal selection of secondary indexes'),
 (1367,'Defining database views as data abstractions in EXT_Pascal'),
 (1368,'Interface control in statistical databases with incomplete information'),
 (1369,'Applications software and organizational change'),
 (1370,'Complexity assessment: a design and management tool'),
 (1371,'Analysis of linear probing with buckets'),
 (1372,'Comparison of database interfaces for application programming'),
 (1373,'Coding methods for text string searching on compressed databases'),
 (1374,'Granting and revoking discretionary authority'),
 (1375,'Input output timing in information systems'),
 (1376,'A two level superimposed coding scheme for partial match retrieval'),
 (1377,'Theory of random observables in relational data bases'),
 (1378,'Formal aspects of optimistic concurrency control'),
 (1379,'Computation of statistical functions in distributed information systems'),
 (1380,'Correctness of a distributed transaction system'),
 (1381,'Validating database updates'),
 (1382,'Performance of VIDEBAS in an operational environment'),
 (1383,'Lipski\"s approach to incomplete information data bases'),
 (1384,'Towards multi-level and modular conceptual schema specifications'),
 (1385,'A storage structure definition language for CODASYL data bases'),
 (1386,'Estimating block selectivities'),
 (1387,'Observations on optimistic concurrency control schemes'),
 (1388,'Semantic integrity enforcement in centralized DBMS and distributed DBMS'),
 (1389,'Constraint preserving and lossless database transformations'),
 (1390,'Information semantics and the conceptual schema'),
 (1391,'A pruned trie to index a sorted file and its evaluation'),
 (1392,'HOLMES: a deduction augmented database management system'),
 (1393,'Identifying subsystems in information systems analysis'),
 (1394,'An approach toward integrated algorithm information system'),
 (1395,'Dynamic non-dense indexes in relational databases'),
 (1396,'A comprehensive model for the storage structure design of CODASYL databases'),
 (1397,'On the sizes of projections: a generating function approach'),
 (1398,'Attribute equivalence in global schema design'),
 (1399,'Nested set languages for functional databases'),
 (1400,'A methodology for conceptual design of office data bases'),
 (1401,'A graph grammar approach to geographical databases'),
 (1402,'On the complexity of some multi-attribute file design problems'),
 (1403,'Design of a virtual database'),
 (1404,'On the automatic generation of optimal internal schemata'),
 (1405,'Data base design with the constrained multiple attribute tree'),
 (1406,'Property of separability'),
 (1407,'A straightforward formalization of the relational model'),
 (1408,'A formal framework'),
 (1409,'A framework for application systems engineering'),
 (1410,'A query language allowing conditions of relational type in queries'),
 (1411,'Choosing optimal branching factors for k-d-B trees'),
 (1412,'Nondeterministic dependencies in relations'),
 (1413,'Modeling and integrating procedures'),
 (1414,'GRDB: a general purpose relational database system'),
 (1415,'DATAID-1: a database design methodology'),
 (1416,'Temporal inferencing on administrative databases'),
 (1417,'Design criteria for functional databases'),
 (1418,'Semantic and pragmatic processing in FIDO'),
 (1419,'The answerability of database queries'),
 (1420,'Causal dependencies in deadline requirements'),
 (1421,'Removing redundant join operations in queries involving views'),
 (1422,'Growing certainty with null values'),
 (1423,'A methodology to model the dynamic structure of an organization'),
 (1424,'Enabling local actions by global consensus'),
 (1425,'Decomposition of select expressions'),
 (1426,'Ontological aspects of logical databases'),
 (1427,'A case study of database design using the DATAID approach'),
 (1428,'Dynamic access control for relational views'),
 (1429,'Heuristic approach to network database external parameters design'),
 (1430,'A comparison of a network structure and a database system'),
 (1431,'Performance of a multi-key access method'),
 (1432,'Information systems with attribute decomposition'),
 (1433,'Essential information structure diagrams and database schema design'),
 (1434,'Design of a distributed CODASYL database system'),
 (1435,'The power of the private workspace model'),
 (1436,'A requirements modeling language and its logic'),
 (1437,'Taxonomy and formal properties of distributed joins'),
 (1438,'Losslessness and semantic correctness'),
 (1439,'The INFOLOG linear tense propositional logic'),
 (1440,'Modeling the CODASYL DML context dependency'),
 (1441,'Classification and transformations of binary relationship relation schemata'),
 (1442,'Functional data model design'),
 (1443,'The relational model with relation-valued attributes'),
 (1444,'A semantic data model as the basis for an automated database design tool'),
 (1445,'Batch insertion for tree structured file organizations'),
 (1446,'Double encoding - a technique for reducing storage requirement of text'),
 (1447,'Dimensions of information systems design'),
 (1448,'Choice of the optimal number of blocks for data access by an index'),
 (1449,'Statistical treatment of the information content of a database'),
 (1450,'Redundancy in functional databases'),
 (1451,'Grid file concurrency'),
 (1452,'A combined methodology for information systems analysis and design'),
 (1453,'Schema translation: a three-level semantic abstraction approach'),
 (1454,'Primary copy synchronization for DB-sharing'),
 (1455,'Transaction management'),
 (1456,'Action based model of information system'),
 (1457,'Database concurrency control using read/write set information'),
 (1458,'A database language for sets - lists and tables'),
 (1459,'Choosing an optimal sequence of discriminators'),
 (1460,'Adding time dimension to relational model and extending relational algebra'),
 (1461,'A formal approach to timing analysis and design of information systems'),
 (1462,'Approximating the number of unique values of an attribute without sorting'),
 (1463,'Functional dependencies'),
 (1464,'Temporal semantics and natural language processing'),
 (1465,'Non-first normal form universal relations'),
 (1466,'Verification of resource controller processes'),
 (1467,'Denotational semantics of query languages'),
 (1468,'Evaluation of a multiple version scheme for concurrency control'),
 (1469,'SQL/NF: a query language for non-1NF relational databases'),
 (1470,'Achieving minimum height for block split tree structured files'),
 (1471,'Information requirements and alternatives in information system design'),
 (1472,'Concurrency control for design objects with versions in CAD databases'),
 (1473,'Multi-relation dependencies'),
 (1474,'Text signatures by superimposed coding of letter triplets and quadruplets'),
 (1475,'CONST - a constructive approach to information modelling'),
 (1476,'On testing soundness of relational expressions'),
 (1477,'Voronoi trees and clustering problems'),
 (1478,'A general framework for computing block accesses'),
 (1479,'Synchronization of replicated data in distributed systems'),
 (1480,'The design of optimal access paths for relational databases'),
 (1481,'Fact structure and its applications to updates in relational databases'),
 (1482,'On the irreducible non first normal form relations'),
 (1483,'Duplicate record identification in bibliographic databases'),
 (1484,'A hierarchical model of organizational control'),
 (1485,'Monitoring dynamic integrity constraints based on temporal logic'),
 (1486,'Linkage versus integration'),
 (1487,'Defining views in the binary relationship model'),
 (1488,'Cooperative behavior in the FIDO system'),
 (1489,'PIQUE: a relational query language without relations'),
 (1490,'Tuple calculus: formal definition'),
 (1491,'An architecture for processing graph-grammar applications'),
 (1492,'Forward multidimensional search'),
 (1493,'A nearly optimal Huffman technique in the microcomputer environment'),
 (1494,'Optimal bucket size for multiattribute retrieval in partitioned files'),
 (1495,'Linked hashing: an improvement of open addressing techniques'),
 (1496,'The fact model: a semantic data model for complex databases'),
 (1497,'An integrated model of record segmentation'),
 (1498,'An approach and its specification to data reformatting in data conversion'),
 (1499,'A Petri-net model of access control mechanisms'),
 (1500,'Full text retrieval based on syntactic similarities'),
 (1501,'Optimizing the cost of relational queries using partial-relation schemes'),
 (1502,'GISD: a graphical interactive system for conceptual database design'),
 (1503,'Concurrency in extendible hashing'),
 (1504,'Adaptive hashing'),
 (1505,'Dynamic-history predictive compression'),
 (1506,'Handling hot spot data in DB-sharing systems'),
 (1507,'Representation of vague information'),
 (1508,'Intelligent caching and indexing techniques for relational database systems'),
 (1509,'The effect of buffer size on pages accessed in random files'),
 (1510,'ADISSA: architectural design of information systems'),
 (1511,'Split sequence coalesced hashing'),
 (1512,'Relational database design using the NIAM conceptual schema'),
 (1513,'VLSI physics'),
 (1514,'Hierarchical channel router'),
 (1515,'A very fast multiplication algorithm for VLSI implementation'),
 (1516,'LAMBDA - and integrated master-slice LSI CAD system'),
 (1517,'A function-independent self-test for large programmable logic arrays'),
 (1518,'Logic gate characterization through ringoscillators'),
 (1519,'An autolayout system for a hierarchical i.c. design environment'),
 (1520,'CIRCAL: a calculus for circuit description'),
 (1521,'A proof rule for restoring logic circuits'),
 (1522,'An algorithm for optimal two-dimensional compaction of VLSI layouts'),
 (1523,'Detection and identification of input/output'),
 (1524,'VLSI systolic arrays for band matrix multiplication'),
 (1525,'A systolic VLSI matrix'),
 (1526,'Microelectronic architectures and devices'),
 (1527,'An architecture for a VLSI FFT processor'),
 (1528,'An area-time efficient NMOS adder'),
 (1529,'Design methodology for full custom CMOS microcomputers'),
 (1530,'NORCHIP - a silicon brokers model'),
 (1531,'On programming VLSI concurrent array processors'),
 (1532,'PLMAP - a piecewise linear MOS circuit analysis program'),
 (1533,'Test generation through logic programming'),
 (1534,'VLSI circuit reconstruction from mask topology'),
 (1535,'An heuristic SPICE2-based approach for 2D IIL device simulation'),
 (1536,'A fast near optimum VLSI implementation of FFT'),
 (1537,'Optimization of programmable logic arrays'),
 (1538,'AT2-optimal VLSI integer division and integer square rooting'),
 (1539,'A VLSI model for residue number system architectures'),
 (1540,'A recursive design methodology for VLSI: theory and example'),
 (1541,'DIF: a framework for VLSI multi-level representation'),
 (1542,'On a case of symbiosis between systolic arrays'),
 (1543,'Maximizing pin alignment by pin permutations'),
 (1544,'Testable design of large random access memories'),
 (1545,'VLSI parallel shift sort algorithm and design'),
 (1546,'Test generation by activation and defect-drive (TEGAD)'),
 (1547,'Formal semantics for a symbolic IC design technique'),
 (1548,'Interval-graph-based PLA folding'),
 (1549,'A flexible bottom-up approach for layout generation'),
 (1550,'Top-down design of a VLSI digital filter bank'),
 (1551,'Automatic design rule adaptation of leaf cell layouts'),
 (1552,'ACE: a congestion estimator for wiring custom chips'),
 (1553,'A greedy switch-box router'),
 (1554,'The multiple-processor PPS chip of the NON-VON 3 supercomputer'),
 (1555,'Architectures for language recognition'),
 (1556,'Some results on the design of regular structured sequential circuits'),
 (1557,'VLSI implementation of iterative methods'),
 (1558,'A router for channels of nonuniform width'),
 (1559,'FSPICE: a tool for fault modelling in MOS circuits'),
 (1560,'Component placement in VLSI circuits'),
 (1561,'Heuristic circuit simulation using Prolog'),
 (1562,'A single-chip adaptive delta modulator with optimum performance'),
 (1563,'SPLASH: a framework for chip design and layout'),
 (1564,'Access to rows and columns of a rectangular array'),
 (1565,'MASHER: an automatic VLSI layout system'),
 (1566,'Yield optimization in wafer scale circuits'),
 (1567,'Automatic determination of signal flow'),
 (1568,'The instruction systolic array - a parallel architecture for VLSI'),
 (1569,'Signal resynchronization in VLSI systems'),
 (1570,'On the models for designing VLSI asynchronous digital systems'),
 (1571,'An automatic cell pattern generation system'),
 (1572,'VLSI architecture for device simulation'),
 (1573,'On minimizing memory in systolic arrays'),
 (1574,'Contributions to VLSI computational complexity theory'),
 (1575,'Information flow in VLSI design'),
 (1576,'Parallel implementations of the statistical cooling algorithm'),
 (1577,'Fast execution for circuit consistency verification'),
 (1578,'Lower bounds for VLSI implementation of residue number system architectures'),
 (1579,'Computer algebra and logic programming'),
 (1580,'Compacted channel routing with via placement restrictions'),
 (1581,'An analysis of ternary simulation'),
 (1582,'PLA implementation'),
 (1583,'An O(n) algorithm for width determination'),
 (1584,'A global router based on a multicommodity flow model'),
 (1981,'A note on cyclic closure operations'),
 (1982,'A note on a construction of Margulis'),
 (1983,'A note on Rabin\"s nearest neighbor algorithm'),
 (1984,'Edge-disjoint branching in directed multigraphs'),
 (1985,'Factoring numbers in O(log n) arithmetic steps'),
 (1986,'A note on vector grammars'),
 (1987,'A note on bottom-up pyramid acceptors'),
 (1988,'Generalized sequential machine maps'),
 (1989,'Reference counting can manage the circular environments of mutual recursion'),
 (1990,'Using duality to compute the pair of matrix products QY and Y^TQ'),
 (1991,'Three efficient algorithms for counting problems'),
 (1992,'Batch scheduling from short lists'),
 (1993,'Deadline scheduling of tasks with ready times and resource constraints'),
 (1994,'Even initial feedback vertex set problem is NP-complete'),
 (1995,'Two implementations of the conditional critical region'),
 (1996,'Binary merging by partitioning'),
 (1997,'A starvation-free solution to the mutual exclusion problem'),
 (1998,'Space-time trade off in implementing certain set operations'),
 (1999,'Miller\"s primality test'),
 (2000,'Rational search'),
 (2001,'Self-stabilization (in spite of distributed control)'),
 (2002,'Linear programming is log-space hard for P'),
 (2003,'An approach for data type specification and its use in program verification'),
 (2004,'On Szilard\"s languages associated to a matrix grammar'),
 (2005,'On finding test data sets for loop free programs'),
 (2006,'Two remarks on a convex hull algorithm'),
 (2007,'The minimization method for some permutation functionals'),
 (2008,'An improved bisection algorithm'),
 (2009,'A new safety test for deadlock avoidance'),
 (2010,'A linear-time algorithm for testing the truth'),
 (2011,'Analysis of a periodically inspected buffer'),
 (2012,'A note on the graph isomorphism counting problem'),
 (2013,'A note on Euclidean near neighbor searching in the plane'),
 (2014,'An efficient algorithm for detection of combined occurrences'),
 (2015,'An intermediate-value theorem for optimum tree valuation'),
 (2016,'Strong linear orderings of a directed network'),
 (2017,'On compromising statistical data-bases with a few known elements'),
 (2018,'Addendum to \"A storage scheme for height-balanced trees\"'),
 (2019,'Addendum to \"An improved algorithm to check for polygon similarity\"'),
 (2020,'Minimum node disjoint path covering for circular-arc graphs'),
 (2021,'A specification of parallel problems'),
 (2022,'The practical significance of distributive partitioning sort'),
 (2023,'The practical significance of D.P. sort revisited'),
 (2024,'Comments on convex hull of a finite set of points in two dimensions'),
 (2025,'A technique for implementing backtrack algorithms and its application'),
 (2026,'The depth of monotone functions in multivalued logic'),
 (2027,'An Omega((n/lg n)^1/2) lower bound on the number of additions'),
 (2028,'Secure information storage and retrieval using new results in cryptography'),
 (2029,'The nonexistence of some covering context-free grammars'),
 (2030,'A note on the nearest-neighbor problem for convex polygons'),
 (2031,'Two results on process logic'),
 (2032,'The NP-completeness of the Hamiltonian cycle problem'),
 (2033,'Substantiable evaluations by electronic computers'),
 (2034,'Abstract for-loops over several aggregates'),
 (2035,'F-factors of graphs: a generalized matching problem'),
 (2036,'A note on time-space tradeoffs for computing continuous functions'),
 (2037,'Average case analysis of region search in balanced k-d trees'),
 (2038,'Methodical solution of the problem of'),
 (2039,'On a generalization of binary search'),
 (2040,'O(n^2.7799) complexity for n*n approximate matrix multiplication'),
 (2041,'A fast equivalence-checking algorithm for circular lists'),
 (2042,'A note on the representation of finite tree automata'),
 (2043,'A clarification of the comparison between some measures of software science'),
 (2044,'Decomposable search problems'),
 (2045,'Mathematical solution for a data processing system'),
 (2046,'The decidability of the F0L-D0L equivalence problem'),
 (2047,'Immediate error detection in strong LL(1) parsers'),
 (2048,'On the space complexity of recursive algorithms'),
 (2049,'A note on paths embedded in trees'),
 (2050,'Axiomatic proofs of total correctness of programs'),
 (2051,'On the implementation of constants'),
 (2052,'Characterizing the regular prefix codes and right power-bounded languages'),
 (2053,'A note concerning top down program development'),
 (2054,'United and discriminated record types in strongly typed languages'),
 (2055,'A note on median selection and spider production'),
 (2056,'On polygon similarity'),
 (2057,'A fast garbage compaction algorithm'),
 (2058,'Neither the greedy nor the Delaunay triangulation of a planar point set'),
 (2059,'Implicit computation of synchronization primitives'),
 (2060,'A new data structure for the union-find problem'),
 (2061,'Lower bounds of the complexity of linear algebras'),
 (2062,'A note on a conjecture of Kam and Ullman concerning statistical databases'),
 (2063,'From left-regular to Greibach normal form grammars'),
 (2064,'Some observations on random 2-3 trees'),
 (2065,'The unsolvability of some Petri net language problems'),
 (2066,'Document retrieval using associative processors'),
 (2067,'Graph 2-isomorphism is NP-complete'),
 (2068,'A note on the complexity of approximative evaluation of polynomials'),
 (2069,'Aliasing among pointers in Euclid'),
 (2070,'\"Possible\" membership of a multivalued dependency in a relational database'),
 (2071,'An observation on scattered grammars'),
 (2072,'Finding a homomorphism between two words in NP-complete'),
 (2073,'On the normalization of relational databases'),
 (2074,'On identification of CR property in file organisation'),
 (2075,'Partial values in a tabular database model'),
 (2076,'Complexity of sorting by distributive partitioning'),
 (2077,'A note on the proof of a concurrent program'),
 (2078,'Comments on the all nearest-neighbor problem for convex polygons'),
 (2079,'The complexity of symmetrizing matrices'),
 (2080,'Linear algorithms for edge coloring trees and unicyclic graphs'),
 (2081,'On module assignment in two-processor distributed systems'),
 (2082,'A randomized algorithm for checking equivalence of circular lists'),
 (2083,'A transportable code generator generator system'),
 (2084,'DB: a Lisp-type data base system'),
 (2085,'A note on the pumping lemma for regular languages'),
 (2086,'Reduction of page swaps on the dimensional transforms in a paging environment'),
 (2087,'Comments on convex hull of a finite set of points in two dimensions'),
 (2088,'Stack implementation of shallow binding in languages with mixed scoping'),
 (2089,'The formal termination problem for programs with finite Algol 68-modes'),
 (2090,'Padded lists: set operations in expected theta(log log n) time'),
 (2091,'Bounds on list scheduling of UET tasks with restricted resource constraints'),
 (2092,'An algorithm for the most economic link addition'),
 (2093,'A mechanical proof of the termination of Takeuchi\"s function'),
 (2094,'On the solution of polynomial equations using continued fractions'),
 (2095,'Deadlock absence proofs for networks of communicating processes'),
 (2096,'Location of multiple points in a planar subdivision'),
 (2097,'Systems of distinct representatives for k families of sets'),
 (2098,'Traversing binary trees simply and cheaply'),
 (2099,'A linear algorithm for finding the convex hull of a simple polygon'),
 (2100,'Cyclomatic numbers do not measure complexity of unstructured programs'),
 (2101,'A note on simplification orderings'),
 (2102,'Another efficient algorithm for convex hulls in two dimensions'),
 (2103,'The emptiness of complement problem'),
 (2104,'Voronoi diagrams from convex hulls'),
 (2105,'Linear algorithms to recognize outerplanar and maximal outerplanar graphs'),
 (2106,'Cost-minimal preemptive scheduling of independent jobs'),
 (2107,'The denotational semantics of sequential machines'),
 (2108,'On the relationship between son-trees and symmetric binary B-trees'),
 (2109,'Finding linear and circular sequences of minimal and maximal total adjacency'),
 (2110,'Testing the universal instance assumption'),
 (2111,'Conflict-free access of arrays - a counter example'),
 (2112,'Once more on storage for consecutive retrieval'),
 (2179,'A fast parallel algorithm for the closest pair problem'),
 (2180,'A note on finding convex hulls via maximal vectors'),
 (2181,'A complement to Tarjan\"s result'),
 (2182,'An O(log n) algorithm for computing the nth element of the solution'),
 (2183,'Computing Fibonacci numbers (and similarly defined functions) in log time'),
 (2184,'An algorithm for testing lossless join property in relational databases'),
 (2185,'Area-time optimal VLSI networks for multiplying matrices'),
 (2186,'Minimum number of steps for permutation in a bubble memory'),
 (2187,'A note on the analysis of extendible hashing'),
 (2188,'Transformational semantics for concurrent programs'),
 (2189,'The complexity of a VLSI adder'),
 (2190,'An improvement of Rabin\"s probabilistic algorithm'),
 (2191,'A correction to Colbourn\"s paper on the complexity of matrix symmetrizability'),
 (2192,'On the computational complexity of cardinality constraints'),
 (2193,'Tuning architecture via microprogramming'),
 (2194,'A note on a signature system based on probabilistic logic'),
 (2195,'A note on preemptive scheduling of periodic - real-time tasks'),
 (2196,'Storage allocation is NP-hard'),
 (2197,'Comments on a lower bound for convex hull determination'),
 (2198,'A note on grammatical covers'),
 (2199,'Fast string searching by finding subkeys in subtext'),
 (2200,'Shortest-path problem is not harder than matrix multiplication'),
 (2201,'Internal merge sorting with delayed selection'),
 (2202,'The Schorr-Waite marking algorithm revisited'),
 (2203,'On inclusion problem for deterministic multitape automata'),
 (2204,'Safe procedural implementations of algebraic types'),
 (2205,'Grant levels in an authorization mechanism'),
 (2206,'Probabilistic analysis for simple'),
 (2207,'A note on the parallel complexity of computing the rank of order n matrices'),
 (2208,'Code improvement via lazy evaluation'),
 (2209,'Convertibility in databases'),
 (2210,'Derivatives of an O(k^2 log n) algorithm for computing'),
 (2211,'Cubic map configurations'),
 (2212,'Batch sizes for the batching method of colouring planar maps'),
 (2213,'A simple relation between relational and predicate transformer semantics'),
 (2214,'A switching algorithm for the solution of quadratic boolean equations'),
 (2215,'Heuristic algorithms for process assignment in distributed computing systems'),
 (2216,'A formal system for parallel programs in discrete time and space'),
 (2217,'Consecutive retrieval with redundancy'),
 (2218,'On covering Boyce-Codd normal forms'),
 (2219,'On two theorems of Lenstra'),
 (2220,'On expected costs of deadlock detection'),
 (2221,'A family of code commutatively equivalent to prefix codes'),
 (2222,'On a stable minimum storage merging algorithm'),
 (2223,'Scheduling periodically occurring tasks on multiple processors'),
 (2224,'A closure property of deterministic context-free languages'),
 (2225,'The numerical instability of Bini\"s algorithm'),
 (2226,'A linear-type recognition algorithm for interval DAGs'),
 (2227,'Master keys for group sharing'),
 (2228,'Bunch theory: a simple set theory for computer science'),
 (2229,'An algorithm for finding clique sets'),
 (2230,'On generalized matching problems'),
 (2231,'Solving combinatorial search problems by intelligent backtracking'),
 (2232,'Coffman-Graham scheduling of UET task systems with 0-1 resources'),
 (2233,'An upper bound on the number of execution nodes for a distributed join'),
 (2234,'Some principles for dynamizing decomposable searching problems'),
 (2235,'Optimal policy for database backup and recovery'),
 (2236,'Concurrency in a language employing messages'),
 (2237,'A user authentication scheme for shared data'),
 (2238,'The Morse sequence and iterated morphisms'),
 (2239,'Efficient searching using partial ordering'),
 (2240,'How many polynomials can be approximated faster than they can be evaluated ?'),
 (2241,'Presburger arithmetic with array segments'),
 (2242,'A layout for the shuffle-exchange network with Theta(N^2/log N) area'),
 (2243,'Another look at the degree constrained subgraph problem'),
 (2244,'Optimal dynamization of decomposable searching problems'),
 (2245,'General methods for \"all elements\" and \"all pairs\" problems'),
 (2246,'Two-way deterministic finite automata'),
 (2247,'An extension of Savitch\"s theorem to small space bounds'),
 (2248,'The simultaneous accessibility of two configurations of two equivalent DPDA\"s'),
 (2249,'Myths about the mutual exclusion problem'),
 (2250,'High density graphs for processor interconnection'),
 (2251,'The undecidability of a word problem'),
 (2252,'Two types of properties for complexity measures'),
 (2253,'A modified tree-to-tree correction problem'),
 (2254,'Optimal packing and covering in the plane are NP-complete'),
 (2255,'Linear decision trees are too weak for convex hull problem'),
 (2256,'On efficient computation of the coefficients of some polynomials'),
 (2257,'On the time and tape complexity of weak unification'),
 (2258,'Information streams sharing a finite buffer: protection problems'),
 (2259,'Testing a simple polygon for monotonicity'),
 (2260,'Optimal bucket size for nearest neighbor searching in k-d trees'),
 (2261,'Worst-case optimal insertion and deletion methods'),
 (2262,'Simple deterministic NTS languages'),
 (2263,'A note on \"A cryptosystem for multiple communication\"'),
 (2264,'Another cryptanalytic attack on \"A cryptosystem for multiple communication\"'),
 (2265,'Sub-regular grammar forms'),
 (2266,'Generation of all the balanced parenthesis strings in lexicographical order'),
 (2267,'A combinatorial property of the Fibonacci words'),
 (2268,'An implementation of P and V');
INSERT INTO `paper` (`PaNum`,`Title`) VALUES 
 (2269,'Hysterical B-trees'),
 (2270,'On minimal Eulerian graphs'),
 (2271,'Linear-time approximation algorithms'),
 (2272,'An improvement to immediate error detection in strong LL(1) parsers'),
 (2273,'A note on heuristics for dynamic organization of data structures'),
 (2274,'On the complexity of simplifying quadratic forms'),
 (2275,'On facilities for interprocess communication'),
 (2276,'Probabilistic algorithms and straight-line programs'),
 (2277,'A note on Post\"s correspondence problem'),
 (2278,'An effective simulation of deterministic pushdown automata'),
 (2279,'An algorithm for inverting a permutation'),
 (2280,'Protocols of accessing overlapping sets of resources'),
 (2281,'An optimal algorithm for computing the repetitions in a word'),
 (2282,'The decision problem for database dependencies'),
 (2283,'A sensitive transitive closure algorithm'),
 (2284,'A fast algorithm for finding all shortest paths'),
 (2285,'Expected complexity of fast search with uniformly distributed data'),
 (2286,'Constructing full spanning trees for cubic graphs'),
 (2287,'Deterministic and probabilistic algorithms'),
 (2288,'Greedy binary search trees are nearly optimal'),
 (2289,'On the optimality of semidynamic routing schemes'),
 (2290,'Hardware address translation for machines with a large virtual memory'),
 (2291,'A new class of CFL for which the equivalence is decidable'),
 (2292,'Degrees of constancy in programming languages'),
 (2293,'An approach to the problems of routing optimization'),
 (2294,'The inclusion of D0L in multi-reset'),
 (2295,'Real-time queue operations in pure Lisp'),
 (2296,'An adversary-based lower bound for sorting'),
 (2297,'The dynamic simulation of recursive and stack manipulating programs'),
 (2298,'On the average height of trees in digital search and dynamic hashing'),
 (2299,'Optimal choice of discriminators in a balanced k-d binary search tree'),
 (2300,'The lower bounds on the adaptive complexity of bilinear problems'),
 (2301,'NTS grammars and Church-Rosser systems'),
 (2302,'A shared-memory scheme for coalesced hashing'),
 (2303,'Some remarks on one-pebble rectangular array acceptors'),
 (2304,'A note on \"Is shortest path problem not harder than matrix multiplication ?\"'),
 (2305,'Author\"s reply to S. Moran\"s note on the shortest path problem'),
 (2306,'On the decidability of equivalence for deterministic pushdown transducers'),
 (2307,'On weak persistency of Petri nets'),
 (2308,'Deciding freeness for program schemes with a single unary function'),
 (2309,'A parallel merging algorithm'),
 (2310,'Maximum flow in (s - t) planar networks'),
 (2113,'A space efficient algorithm for the monotone planar circuit value problem'),
 (2114,'List scheduling bounds for UET systems with resources'),
 (2115,'Mixed transitivity for functional and multivalued dependencies'),
 (2116,'A note on an improved bisection algorithm'),
 (2117,'A 2.5 times optimal algorithm for packing in two dimensions'),
 (2118,'A note on universal classes of hash functions'),
 (2119,'Encoded pointers - an interesting data-structure for modern SIL\"s'),
 (2120,'Dynamization of decomposable searching problems'),
 (2121,'The logic-termal equivalence is polynomial-time decidable'),
 (2122,'Structured programs for Turing machines'),
 (2123,'An O(log n) algorithm for computing general order-k Fibonacci numbers'),
 (2124,'A lower bound for on-line bin packing'),
 (2125,'Equivalence of free boolean graphs'),
 (2126,'Achievable high scores of epsilon-moves'),
 (2127,'Extending the four Russians bound to general matrix multiplication'),
 (2128,'Purging in an equality data base'),
 (2129,'A simplified proof that regular resolution is exponential'),
 (2130,'A scheme for a fault-tolerant virtual memory'),
 (2131,'On the generation of compilers fro language definitions'),
 (2132,'An improvement in the iterative data flow analysis algorithm'),
 (2133,'Analysis of the module assignment problem'),
 (2134,'Another application of recursion introduction'),
 (2135,'Efficient implementation of the Ada overloading rules'),
 (2136,'Formal derivation of a list processing program'),
 (2137,'A note on Delaunay and optimal triangulations'),
 (2138,'Some new results on isotonic array grammars'),
 (2139,'On the Omega(n log n) lower bound'),
 (2140,'A simple model of query scheduling in distributed data base systems'),
 (2141,'A characterization of systems derived from terminating concurrent histories'),
 (2142,'Parallel system schemas and their relation to automata'),
 (2143,'The readers and writers problem avoided'),
 (2144,'A fast sorting algorithm - a hybrid of distributive and merge sorting'),
 (2145,'Controlled density sorting'),
 (2146,'On the complexity of scheduling jobs on dedicated resources'),
 (2147,'Complexity of solving algebraic equations'),
 (2148,'A cryptosystem for multiple communication'),
 (2149,'The space complexity of pebble games on trees'),
 (2150,'Levelling terrain trees: a transshipment problem'),
 (2151,'Program development: from enumeration to backtracking'),
 (2152,'A robust variation of interpolation search'),
 (2153,'Maximum matchings and trees'),
 (2154,'Variants of the software solution to mutual exclusion'),
 (2155,'Further comments on Bykat\"s convex hull algorithm'),
 (2156,'The design and analysis of a new hybrid sorting algorithm'),
 (2157,'A remark on two-dimensional finite automata'),
 (2158,'On the emptiness problem of the intersection of two D0S languages problem'),
 (2159,'A new permutation algorithm for bubble memories'),
 (2160,'Complexity bounds for equivalence and isomorphism of latin squares'),
 (2161,'Deadlock and fairness in parallel schemas'),
 (2162,'Lexicographically least circular substrings'),
 (2163,'The towers of Hanoi problem'),
 (2164,'A note on decision problems for three-way two-dimensional finite automata'),
 (2165,'Termination detection for diffusing computations'),
 (2166,'An efficient variation of bubble sort'),
 (2167,'Selection by distributive partitioning'),
 (2168,'Error correction by mutational grammars'),
 (2169,'On the complexity testing a graph for n-cube'),
 (2170,'The decidability of persistence for vector addition systems'),
 (2171,'A note on the pebble game'),
 (2172,'On the internal S-stability of Rosenbrock methods'),
 (2173,'Comments on: T.D. Bui -'),
 (2174,'On a cycle finding algorithm'),
 (2175,'An improved BL lower bound'),
 (2176,'A note on colored Petri nets'),
 (2177,'Computing multivariate polynomials in parallel'),
 (2178,'On the area of binary tree layouts'),
 (1849,'Alternative solutions to the cigarette smokers problem without conditionals'),
 (1850,'A note on optimal preemptive scheduling for two-processor systems'),
 (1851,'Relations as programming language elements'),
 (1852,'A universally hard set of formulae'),
 (1853,'On the partial computation principle'),
 (1854,'The universal space for parallel computation'),
 (1855,'FIFO-optimal placement on pages of independently referenced sectors'),
 (1856,'\"V-tape\"'),
 (1857,'Producing optimised code for coercions'),
 (1858,'Complete operator precedence conditions'),
 (1859,'A first-in-first-out buffered cyclic memory'),
 (1860,'An O(N) algorithm for finding periodicity of a sequence using hash coding'),
 (1861,'Nonisomorphic trees with the same T-polynomial'),
 (1862,'A method for determining class subspaces'),
 (1863,'Preserving order in a forest in less than logarithmic time and linear space'),
 (1864,'An adaptive time advancement algorithm for discrete simulation'),
 (1865,'Comments on \"Error resynchronisation in producer consumer systems\"'),
 (1866,'One more polynomial complete consecutive retrieval problem'),
 (1867,'Sorting tree - nestling tree and inverse permutation'),
 (1868,'An optimization of the alternating semantic evaluator'),
 (1869,'Automatic solution of a certain class of combinatorial problems'),
 (1870,'An algebraic characterization of the behavior of non-sequential systems'),
 (1871,'A note on linear time simulation of deterministic two-way pushdown automata'),
 (1872,'Error diagnosis and recovery in one pass compilers'),
 (1873,'One the formal specification of the semantics of processed information'),
 (1874,'Two characterization theorems of locally catenative developmental systems'),
 (1875,'A study of a page-on-demand system'),
 (1876,'A note on a multidimensional searching problem'),
 (1877,'The interpolation-sequential search algorithm'),
 (1878,'Selection of good algorithms from a family of algorithms'),
 (1879,'Functional grammars'),
 (1880,'Analysis of the Pope-Stein division algorithm'),
 (1881,'Null values in a relational data base'),
 (1882,'On an L-stable method for stiff differential equations'),
 (1883,'Simple algorithms for multiprocessor scheduling to meet deadlines'),
 (1884,'On the completeness of a set of transformations optimizing linear program'),
 (1885,'Two dimensional pattern matching'),
 (1886,'Realization of graceful permutation by a shuffle-exchange network'),
 (1887,'Recognition of EOL languages in less than quartic time'),
 (1888,'An experimental investigation of Geschke\"s method'),
 (1889,'On a relation between algebraic programs and Turing machines'),
 (1890,'The tree-to-tree editing problem'),
 (1891,'An experiment in formal definition of operating system facilities'),
 (1892,'The class of context-free languages is not an EOL family'),
 (1893,'A case for a forward predicate transformer'),
 (1894,'Testing for equality between maximum matching and minimum node covering'),
 (1895,'Concurrent file access under unpredictability'),
 (1896,'The complexity of finding fixed-radius near neighbors'),
 (1897,'A note on weak operator precedence grammars'),
 (1898,'Understanding the complexity of interpolation search'),
 (1899,'Binomial coefficients with non-integral lower index'),
 (1900,'Sorting by distributive partitioning'),
 (1901,'Commutation relations of slices characterize some synchronization primitives'),
 (1902,'The min-max spanning tree problem and some extensions'),
 (1903,'Cycle detection in critical path networks'),
 (1904,'Analysis of queuing networks'),
 (1905,'A class of grammar generating non-counting languages'),
 (1906,'Genetic order and compactifying garbage collectors'),
 (1907,'The decidability of nu-local catenativity'),
 (1908,'Lindenmayer grammars and symbolic testing'),
 (1909,'An information-theoretic lower bound'),
 (1910,'What is an abstract datatype ?'),
 (1911,'A probabilistic minimum spanning tree algorithm'),
 (1912,'A note on two-dimensional finite automata'),
 (1913,'A reevaluation of an efficient algorithm'),
 (1914,'A more efficient convex hull algorithm'),
 (1915,'Substad: for fast substitution in Lisp - with an application on unification'),
 (1916,'The maximum depth of monotone formulae'),
 (1917,'A linear storage space algorithm for a reference structure index'),
 (1918,'An error-correcting coding scheme for alphanumeric data'),
 (1919,'Arcade - a system for research and education in computer architecture'),
 (1920,'Comments on: G. Manacher -'),
 (1921,'Divide and conquer for linear expected time'),
 (1922,'Insertion merge sorting'),
 (1923,'On the generative capacity of simple matrix grammars of finite index'),
 (1924,'A canonical form algorithm for proving equivalence of conditional forms'),
 (1925,'On the expressive power of the relational algebra'),
 (1926,'Multiple access to a tree in the context of readers and writers problem'),
 (1927,'A note on the complexity of algebraic differentiation'),
 (1928,'A correction to a unilaterally connected components algorithm'),
 (1929,'An improved algorithm to check for polygon similarity'),
 (1930,'Tag systems generating Thue irreducible sequences'),
 (1931,'An optimal demand prepaging algorithm'),
 (1932,'A predecessor algorithm for ordered lists'),
 (1933,'Phrase structures - non-determinism and backtracking'),
 (1934,'An algorithm to generate the basis'),
 (1935,'An improved parallel processor bound in fast matrix inversion'),
 (1936,'A method for proving programming languages non context-free'),
 (1937,'A counterexample to the generalized Aanderaa-Rosenberg conjecture'),
 (1938,'A general mechanism for avoiding starvation with distributed control'),
 (1939,'A linear selection algorithm for sets of elements with weights'),
 (1940,'Notes on the derivation of symptotic expressions from summations'),
 (1941,'On tree transducers for partial functions'),
 (1942,'New bounds for the clique number of a graph'),
 (1943,'Triangulating a simple polygon'),
 (1944,'A noncommutative algorithm for multiplying 5*5 matrices'),
 (1945,'On Cahit\"s result on graceful permutations'),
 (1946,'A batching method for coloring planar graphs'),
 (1947,'The all nearest neighbor problem for convex polygons'),
 (1948,'A probabilistic remark on algebraic program testing'),
 (1949,'Counting productions in context-free derivations'),
 (1950,'The equivalence of vector addition systems'),
 (1951,'Comments on: \"Sorting by distributive partitioning\"'),
 (1952,'Author\"s reply to Warren Burton\"s comments on'),
 (1953,'A note on language equations involving morphisms'),
 (1954,'A note on weak operator precedence grammars'),
 (1955,'A fast convex hull algorithm'),
 (1956,'Proving correctness of strategies in the AL1 assertional language'),
 (1957,'A storage scheme for height-balanced trees'),
 (1958,'Exploiting the optimal paging algorithms'),
 (1959,'On the expected behaviors of the Dijkstra\"s shortest path algorithm'),
 (1960,'Implementation approach to parallel systems'),
 (1961,'QT logic: simpler and more expressive than predicate calculus'),
 (1962,'Certain problems of the theory of structured programs schemes'),
 (1963,'Optimum domination in weighted trees'),
 (1964,'On the number of candidate keys'),
 (1965,'There is no fast single hashing algorithm'),
 (1966,'A linear-time algorithm for finding all feedback vertices'),
 (1967,'An O('),
 (1968,'Counter-one-pass features in one-pass compilation'),
 (1969,'A simple proof of Strassen\"s result'),
 (1970,'On equivalence and subclass containment problems'),
 (1971,'Parallel implementation of path executions'),
 (1972,'Convex hull of a finite set of points in two dimensions'),
 (1973,'An iterative program to calculate Fibonacci numbers'),
 (1974,'Huffman coding in bit-vector compression'),
 (1975,'A compression method for clustered bit-vectors'),
 (1976,'A note on shared list structure in Lisp'),
 (1977,'Efficient search for rationals'),
 (1978,'Some decidability results about regular and pushdown translations'),
 (1979,'Paired sequential lists in a memory interval'),
 (1980,'Testing for existence of a covering Boyce-Codd normal form'),
 (2575,'An O(n) algorithm for the linear multiple choice knapsack problem'),
 (2576,'Experiments with a fast string searching algorithm'),
 (2577,'A technique for developing loop invariants'),
 (2578,'A fast VLSI conversion between binary and residue systems'),
 (2579,'On computing the determinant in small parallel time'),
 (2580,'The critical complexity of graph properties'),
 (2581,'Pattern matching machine implementation'),
 (2582,'Algorithms for adaptive Huffman codes'),
 (2583,'Algebraic approach to p-adic conversion of rational numbers'),
 (2584,'A note on border rank'),
 (2585,'Programmed deallocation without dangling reference'),
 (2586,'A priority queue for the all pairs shortest path problem'),
 (2587,'The L1 traveling salesman problem'),
 (2588,'A 4n-lower bound on the monotone network complexity'),
 (2589,'A simple linear-time algorithm for in situ merging'),
 (2590,'A new combination of input and unit deductions for Horn sentences'),
 (2591,'Fairness and conspiracies'),
 (2592,'On verification of programs with goto statements'),
 (2593,'A fast Voronoi-diagram algorithm with quaternary tree bucketing'),
 (2594,'Functional dependencies in relations with null values'),
 (2595,'Deterministic two-way one-head pushdown automata are very powerful'),
 (2596,'Multiseralization of iterated transactions'),
 (2597,'An analytical comparison of two string searching algorithms'),
 (2598,'A note on lossless database decompositions'),
 (2599,'A characterization of multivalued dependencies'),
 (2600,'Scheduling independent 2-processor tasks to minimize schedule length'),
 (2601,'Some equivalent transformations of recursive programs'),
 (2602,'Some negative results concerning DPDA\"s'),
 (2603,'On the consecutive retrieval property for generalized binary queries'),
 (2604,'A storage-size selection problem'),
 (2605,'Extension of the banker\"s algorithm for resource allocation'),
 (2606,'Some remarks on subclass containment problems for several classes of DPDA\"s'),
 (2607,'A proof of determinacy property of the data flow schema'),
 (2608,'On converting character strings to integers'),
 (2609,'On the use of extendible hashing without hashing'),
 (2610,'Minimizing completion time for a class of scheduling problems'),
 (2611,'On the power of real-time two-way multihead automata with jumps'),
 (2612,'Dominating sets for split and bipartite graphs'),
 (2613,'On embedding functions in logic'),
 (2614,'An optimal algorithm for parallel selection'),
 (2615,'A probabilistic lower bound for checking disjointness of sets'),
 (2616,'Strong NP-hardness of moving many discs'),
 (2617,'Partial match retrieval in implicit data structures'),
 (2618,'A presentation of the Fibonacci algorithm'),
 (2619,'Communication problems on MIMD parallel computers'),
 (2620,'Approximating block accesses in database organizations'),
 (2621,'Integer linear programming for microprograms register allocation'),
 (2622,'A linear algorithm of a deadlock avoidance for nonpreemtible resources'),
 (2623,'Area-time tradeoff for rectangular matrix multiplication in VLSI models'),
 (2624,'An O(n log n) Manhattan path algorithm'),
 (2625,'The complexity of data flow criteria for test data selection'),
 (2626,'Cryptanalysis of certain variants of Rabin\"s signature scheme'),
 (2627,'Extensions to grid selector composition and computation in APL'),
 (2628,'Non-partitionable point sets'),
 (2629,'An algorithm for generating subsets of fixed size'),
 (2630,'Formal syntax methods for natural language'),
 (2631,'Another solution of the mutual exclusion problem'),
 (2632,'On synthesis of scheduling algorithms'),
 (2633,'Some variants of the take-grant protection model'),
 (2634,'On estimating access costs in relational databases'),
 (2635,'On linear context-free languages and one-way multihead automata'),
 (2636,'Probabilistic Turing machines and recursively enumerable Dedekind cuts'),
 (2637,'Towards a formal proof system for omega-rational expressions'),
 (2638,'A note on bounded-reversal multipushdown machines'),
 (2639,'How to produce all sentences for a two-level grammar'),
 (2640,'On the centers of the set of weakly square-free words'),
 (2641,'On software equations'),
 (2642,'The complexity of incremental convex hull algorithms in R^d'),
 (2643,'Approximate storage utilisation of B-trees'),
 (2644,'How evenly should one divide to conquer quickly ?'),
 (2645,'Throughput concavity and response time convexity'),
 (2646,'Inverse morphic equivalence of languages'),
 (2647,'On linear-time algorithms for five-coloring planar graphs'),
 (2648,'On derivation preservation'),
 (2649,'The contour problem for rectilinear polygons'),
 (2650,'How to estimate the sizes of domains'),
 (2651,'An inductive number-theoretic characterization of NP'),
 (2652,'A note on boolean matrix multiplication'),
 (2653,'Permutations of bounded degree generate groups of polynomial diameter'),
 (2654,'Asserting the optimality of serial SJRPs'),
 (2655,'Some properties of commutation in free partially commutative monoids'),
 (2656,'Cancellation rules and extended word problems'),
 (2657,'Selection in X+Y and matrices with sorted rows and columns'),
 (2658,'A note on undercover relation'),
 (2659,'A special purpose MIMD parallel processor'),
 (2660,'An algorithm for local compaction of horizontal microprograms'),
 (2661,'PDL with data constants'),
 (2662,'A linear applicative solution for the set union problem'),
 (2663,'Direct determination of a \"seed\" binary matrix'),
 (2664,'On equivalence of relational and network database models'),
 (2665,'The VLSI optimality of the AKS sorting network'),
 (2666,'The undecidability of self-embedding for term rewriting systems'),
 (2667,'Evaluating expressions with a queue'),
 (2668,'A comment on the \"basic security theorem\" of Bell and LaPadula'),
 (2669,'Translation of Turner combinators in O(n log n) space'),
 (2670,'An optimal algorithm for the maximum alignment of terminals'),
 (2671,'On the correspondence between two classes of reduction systems'),
 (2672,'More on looping vs. repeating dynamic logic'),
 (2673,'On separation of the emptiness and equivalence problems'),
 (2674,'Codeterministic automata on infinite words'),
 (2675,'Upper bounds on the size of LR(k) parsers'),
 (2676,'An infinite square-free co-CFL'),
 (2677,'How to detect tampering of data'),
 (2678,'Details of distortions in the computed Fourier transforms of signals'),
 (2679,'Real addition and the polynomial hierarchy'),
 (2680,'A note on redundant disk module allocation'),
 (2681,'The probe: an addition to communication primitives'),
 (2682,'Split sequence hash search'),
 (2683,'A parallel median algorithm'),
 (2684,'An undecidable problem for context-free grammars'),
 (2685,'An optimal parallel processor bound'),
 (2686,'A new distributed depth-first-search algorithm'),
 (2687,'Number-theoretic functions which are equivalent to number of divisors'),
 (2688,'Some results on addition/subtraction chains'),
 (2689,'Computing a basis for a finite Abelian p-group'),
 (2690,'Constructing the visibility graph for n-line segments in O(n^2) time'),
 (2691,'On a problem in real-time computing'),
 (2692,'Interpolation-binary search'),
 (2693,'Fair derivations in E0L systems'),
 (2694,'Global and logical time in distributed algorithms'),
 (2695,'Representing matrices as quadtrees for parallel processors'),
 (2696,'Finding Hamiltonian circuits in interval graphs'),
 (2697,'How to cope with faulty processors'),
 (2698,'Analysis of algorithms on problems in general Abelian groups'),
 (2699,'A note on chains of deterministic pushdown transducers'),
 (2700,'A note on the dynamic storage allocation problem'),
 (2701,'Depth-first search is inherently sequential'),
 (2702,'On efficient parallel strong orientation'),
 (2703,'Independence results about context-free languages and lower bounds'),
 (2704,'Storing matrices on disk for efficient row and column retrieval'),
 (2705,'A note on the expected time required to construct the outer layer'),
 (2706,'An algorithm for shortest-path motion in three dimensions'),
 (2707,'Bidirectional coroutines'),
 (2708,'Alternating multicounter machines with constant number of reversals'),
 (2709,'Join during merge: an improved sort based algorithm'),
 (2710,'An algorithm for uniform random sampling'),
 (2711,'Self-adjusting hash tables'),
 (2712,'Worst-case choice for the stable marriage problem'),
 (2713,'A note on removing loops from table-driven code generators'),
 (2714,'A secure and useful \"keyless cryptosystem\"'),
 (2715,'Finding extreme points in three dimensions'),
 (2716,'Optimal search with positive switch cost is NP-hard'),
 (2717,'On fast computation of distance between line segments'),
 (2718,'Exposure to deadlock for communicating processes in hard to detect'),
 (2719,'On the decomposition of sequences into ascending subsequences'),
 (2720,'Linear lower bounds on unbounded fan-in boolean circuits'),
 (2721,'A note on finding minimum cuts in directed planar networks'),
 (2722,'Fast parallel polynomial division via reduction'),
 (2723,'Feedback automata and their languages'),
 (2724,'Square time is optimal for simulation'),
 (2725,'The incompleteness of Misra and Chandy\"s proof systems'),
 (2726,'Fair mutual exclusion with unfair P and V operations'),
 (2727,'Lower time bounds for integer programming with two variables'),
 (2728,'VLSI design with multiple active layers'),
 (2729,'General algorithms for the address calculation'),
 (2730,'The power of geometric duality revisited'),
 (2731,'Improved lower bounds for some matrix multiplication problems'),
 (2732,'On distributed search'),
 (2733,'A note on a special one-rule semi-Thue system'),
 (2734,'Creation and reflexive rights in grammatical protection systems'),
 (2735,'An n^1.618 lower bound on the time to simulate'),
 (2736,'An approach to the transportation of computer software'),
 (2737,'VLSI implementation of fast solvers for band linear systems'),
 (2738,'Fast dynamic intersection searching'),
 (2739,'Enumeration of articulation pairs of a planar graph'),
 (2740,'Defining liveness'),
 (2741,'On zigzag permutations and comparisons of adjacent elements'),
 (2742,'A systolic array for the longest common subsequence problem'),
 (2743,'On the efficient use of semaphore primitives'),
 (2744,'k-fold bitonic sort on a mesh-connected parallel computer'),
 (2745,'On different approximation criteria for subset product problems'),
 (2746,'Incremental string matching'),
 (2747,'Performance evaluation of systems of cyclic sequential processes'),
 (2748,'The unwind property for programs with bounded memory'),
 (2749,'A note on natural selection'),
 (2750,'Tight chip area lower bounds'),
 (2751,'Decomposing a set of points into chains -'),
 (2752,'An efficient Dijkstra-like labeling method'),
 (2753,'A direct routing algorithm'),
 (2754,'A fast algorithm for renaming a set of clauses as a Horn set'),
 (2755,'On transformations of algorithms to multiply 2*2 matrices'),
 (2756,'Every iterated morphism yields a co-CFL'),
 (2757,'The trade-off between the additive complexity and the asynchronicity'),
 (2758,'On termination and phase changes in the presence of unreliable communication'),
 (2759,'Linear programming in O(n*3^d) time'),
 (2760,'The greedy and Delaunay triangulations are not bad in the average case'),
 (2761,'A note on Presburger arithmetic with array segments - permutation and equality'),
 (2762,'Hexagonal unit network - a tool for proving the NP-completeness results'),
 (2763,'Two results on tables'),
 (2764,'Tree-like parse and polynomial subclasses of search problems'),
 (2765,'A note on approximate convex hulls'),
 (2766,'An improved parallel algorithm for maximal matching'),
 (2767,'Edison-80'),
 (2768,'A lower bound to the complexity'),
 (2769,'A fast and simple randomized parallel algorithm for maximal matching'),
 (2770,'Lower bounds on parallel algorithms'),
 (2771,'Some remarks on the possibility'),
 (2772,'Verifying nonrigidity'),
 (2773,'Exact balancing is not always good'),
 (2774,'A class of differential equations for testing variable step-size integration'),
 (2775,'On probability of forest of quadtrees reducing to quadtrees'),
 (2776,'Inhomogeneities in the polynomial-time degrees'),
 (2777,'The one-dimensional weighted Voronoi diagram'),
 (2778,'Square-free words on partially commutative free monoids'),
 (2779,'Nonisomorphic graphs with the same T-polynomial'),
 (2780,'Two decidability problems for infinite words'),
 (2781,'A novel representation of lists and its application to the function \"reverse\"'),
 (2782,'On the rationality of Petri net languages'),
 (2783,'O(1) space complexity deletion for AVL trees'),
 (2784,'Exact computation of Steiner minimal trees in the plane'),
 (2785,'Computing the minimum cover of functional dependencies'),
 (2786,'Convex hull made easy'),
 (2787,'An efficient algorithm for the transitive closure'),
 (2788,'Total domination in interval graphs'),
 (2789,'A note on the higher moments'),
 (2790,'Two tagless variations on the Deutsch-Schorr-Waite algorithm'),
 (2791,'Election in a complete network with a sense of direction'),
 (2792,'Splitmerge - a fast stable merging algorithm'),
 (2793,'A note on the VLSI counter'),
 (2794,'Deques with heap order'),
 (2795,'Data compression and Gray-code sorting'),
 (2796,'A controlled quantification in parsing of Montague grammar'),
 (2797,'Optimal algorithms for finding the symmetries of a planar point set'),
 (2798,'An O(log n) algorithm for parallel update of minimum spanning trees'),
 (2799,'String matching cannot be done'),
 (2800,'Experiments with trees for the storage and retrieval of future events'),
 (2801,'Approximate storage utilization of B-trees'),
 (2802,'Lower and upper bounds of the sizes of domains: estimates and experiments'),
 (2803,'Determining the shape of a convex n-sided polygon'),
 (2804,'Set-theoretic problems of null completion in relational databases'),
 (2805,'Batched search of index sequential files'),
 (2806,'On the calculation of control transition probabilities in a program'),
 (2807,'The space complexity of the unique decipherability problem'),
 (2808,'Long edges in the layouts'),
 (2809,'The bounded subset problem is almost everywhere randomly decidable in O(n)'),
 (2810,'On the maximum edge length in VLSI layouts of complete binary trees'),
 (2811,'On DELTA(P - 2)-immunity'),
 (2812,'A note on the equivalence problem of rational formal power series'),
 (2813,'A parallel reference counting algorithm'),
 (2814,'A note on the queen\"s problem'),
 (2815,'Data algebra and its application in database design'),
 (2816,'A fully distributed (minimal) spanning tree algorithm'),
 (2817,'Improving the worst-case performance of the Hunt-Szymanski strategy'),
 (2818,'Shortest paths in the plane with convex polygonal obstacles'),
 (2819,'An implementation of mutual inclusion'),
 (2820,'An application of Mehlhorn\"s algorithm for bracket languages'),
 (2821,'An algorithm for the derivation of codefinitions in computer programs'),
 (2822,'Comments on Morris\"s starvation-free solution to the mutual exclusion problem'),
 (2823,'On gallery watchmen in grids'),
 (2824,'On the probabilistic performance of algorithms for the satisfiability problem'),
 (2825,'Area-time tradeoffs for bilinear forms computations in VLSI'),
 (2826,'A VLSI fast solver for tridiagonal linear systems'),
 (2827,'A noncommutative algorithm for multiplying 5*5 matrices'),
 (2828,'A note on anomalies in parallel branch-and-bound algorithms'),
 (2829,'Efficient selection on a binary tree'),
 (2830,'Approximating functions by their Poisson transform'),
 (2831,'Total domination in interval graphs'),
 (2832,'On an asymptotic analysis of tree-type algorithm for broadcast communications'),
 (2833,'On the intersection of the class of linear context-free languages'),
 (2834,'Semantics of a declarative language'),
 (2835,'Some characterizations'),
 (2836,'Absence of individual starvation using weak semaphores'),
 (2837,'Turing complexity of the ordinals'),
 (2838,'Finitely generated omega-languages'),
 (2311,'The jogger\"s problem'),
 (2312,'The cyclic towers of Hanoi'),
 (2313,'On the complexity of vector computations in binary tree machines'),
 (2314,'More on master keys for group sharing'),
 (2315,'Synchronous communication between asynchronous components'),
 (2316,'The clique problem for planar graphs'),
 (2317,'An alternative for the implementation of the Knuth-Morris-Pratt algorithm'),
 (2318,'Data compression in limited capacity microcomputer systems'),
 (2319,'Time complexity of languages recognized'),
 (2320,'A hardest language recognized by two-way nondeterministic pushdown automata'),
 (2321,'Tree equivalence of linear recursive schemata is polynomial-time decidable'),
 (2322,'Limitations of the chase'),
 (2323,'The edge Hamiltonian path problem in NP-complete'),
 (2324,'Efficient query evaluation in relational data bases with missing values'),
 (2325,'The complexity of testing whether a graph is a superconcentrator'),
 (2326,'Finding the minimum distance between two convex polygons'),
 (2327,'A new method for implementing LR(k) tables'),
 (2328,'On the intersection of orthogonal objects'),
 (2329,'Acceptors for isometric parallel context-free array languages'),
 (2330,'A systematic test for extended operator precedence'),
 (2331,'Width and depth of combinational logic circuits'),
 (2332,'Projections of languages recognizable'),
 (2333,'Guarded procedure: a distributed programming concept'),
 (2334,'Multi-problem-solving: knowledge representation and system architecture'),
 (2335,'Modulus division on a two\"s complement machine'),
 (2336,'An approximation algorithm for reducing expected head movement'),
 (2337,'On the computational power of the floor function'),
 (2338,'Arithmetic of finite fields'),
 (2339,'Parallel algorithms for the'),
 (2340,'A note on \"Master keys for group sharing\"'),
 (2341,'Writing a number as the sum of two squares: a new solution'),
 (2342,'On the size of projections: I'),
 (2343,'Compile time type checking of structure field accessing'),
 (2344,'A hierarchical clustering algorithm using strong components'),
 (2345,'Sensitivity analysis of minimum spanning trees and shortest path trees'),
 (2346,'Efficient recognition of rational relations'),
 (2347,'Some observations on the probabilistic algorithms and NP-hard problems'),
 (2348,'Generation and ranking of k-ary trees'),
 (2349,'A simple deduction method for modal logic'),
 (2350,'Context-free grammars as a tool'),
 (2351,'Strong EVQ of relational expressions under dependencies'),
 (2352,'Minimal storage representations for binary relations'),
 (2353,'The automatic synthesis of iterative programs'),
 (2354,'Polygonal intersection searching'),
 (2355,'A simple transfer lemma for algebraic specifications'),
 (2356,'Formal correctness proofs of a nondeterministic program'),
 (2357,'Parallel computation and conflicts in memory access'),
 (2358,'A three-restricted normal form theorem for ETOL languages'),
 (2359,'LR parsing of some ambiguous grammars'),
 (2360,'An algorithm for verifying equations of morphisms in a category'),
 (2361,'An optimal algorithm for sink-finding'),
 (2362,'Fixed-point theorems and semantics: a folk tale'),
 (2363,'Parallel multisection for the determination of the eigenvalues'),
 (2364,'A hybrid of quicksort with O(n log n) worst case complexity'),
 (2365,'On the equivalence of some rectangle problems'),
 (2366,'A syntax-free semantics for the APL operators'),
 (2367,'Defining database dynamics with attribute grammars'),
 (2368,'Growing nearly optimal binary search trees'),
 (2369,'Reply to the paper \"The numerical instability of Bini\"s algorithm\"'),
 (2370,'Evaluation of a hierarchical bit-vector compression technique'),
 (2371,'Multidimensional tries used for associative searching'),
 (2372,'Nondeterministic one-way simulation'),
 (2373,'Monte Carlo estimation of numerical stability'),
 (2374,'An extension to trees of the Sardinas and Patterson algorithm'),
 (2375,'Generalized division for relational algebraic language'),
 (2376,'Asymptotic estimates for the higher moments'),
 (2377,'A lower bounds for the time to assure interactive consistency'),
 (2378,'The complexity of recognizing 3NF relation schemes'),
 (2379,'An extension to linear resolution with selection function'),
 (2380,'On the triangle conjecture'),
 (2381,'A linear space translation of functional programs to Turner combinators'),
 (2382,'An efficient functional implementation of FIFO queues'),
 (2383,'A note on the sufficiency of Sokolowski\"s criterion'),
 (2384,'A model for concurrency control in distributed database systems'),
 (2385,'A recursive algorithm to generate joint probability distribution of arrivals'),
 (2386,'Permutation inversions and multidimensional cumulative distribution functions'),
 (2387,'Extreme time-space tradeoffs for graphs with small space requirements'),
 (2388,'Complexity of finding k-path-free dominating sets in graphs'),
 (2389,'Depth-first search and the vertex cover problem'),
 (2390,'A linear algorithm to determine minimal spanning forests in chain graphs'),
 (2391,'A note on two-way nondeterministic pushdown automata'),
 (2392,'Tables of large graphs with given degree and diameter'),
 (2393,'NP-completeness of some generalizations of the maximum matching problem'),
 (2394,'A memory-management unit'),
 (2395,'Optimal database reorganization: some practical difficulties'),
 (2396,'A labeling algorithm to recognize a line digraph and output its root graph'),
 (2397,'Efficient parallel algorithms for linear recurrence computation'),
 (2398,'On computability of the mean deviation'),
 (2399,'A note on some tree similarity measures'),
 (2400,'An improved list-searching algorithm'),
 (2401,'Steady-paced-output and fractional-on-line algorithms on a RAM'),
 (2402,'Partially specified nearest neighbor searches using k-d trees'),
 (2403,'On multiset orderings'),
 (2404,'The towers of Hanoi revisited: moving the rings by counting the moves'),
 (2405,'Permutations are not context-free: an application of the interchange lemma'),
 (2406,'Average time analyses of simplified David-Putnam procedures'),
 (2407,'Universal grammars'),
 (2408,'Best possible asymptotic bounds'),
 (2409,'A note on a theorem by Ladner'),
 (2410,'Fast algorithm for sparse linear matrix multiplication'),
 (2411,'A homomorphism theorem for data base mappings'),
 (2412,'On the relationship between the LL(k) and LR(k) grammars'),
 (2413,'Time complexity of unambiguous path systems'),
 (2414,'Robust - centralized certifier based concurrency control'),
 (2415,'A communication concept for distributed systems'),
 (2416,'A statistical model for estimating the number of records'),
 (2417,'Sorting numbers in linear expected time and optimal extra space'),
 (2418,'Finding connected components of an intersection graph of squares'),
 (2419,'An introduction to three algorithms for sorting in situ'),
 (2420,'A probabilistic algorithm for vertex connectivity of graphs'),
 (2421,'Another compacting garbage collector'),
 (2422,'Two theorems about the completeness of Hoare\"s logic'),
 (2423,'Grammatical unification'),
 (2424,'Determinacy of sinking automata on infinite trees'),
 (2425,'A note on alternating on-line Turing machines'),
 (2426,'A counter example to a monotonicity property of k-d trees'),
 (2427,'A solution method for the non-additive resource allocation problem'),
 (2428,'Recognition of perfect elimination bipartite graphs'),
 (2429,'Fast composition of sparse maps'),
 (2430,'A linear algorithm for the number of degree constrained subforests of a tree'),
 (2431,'On optimal multilevel indexed sequential files'),
 (2432,'The ears of a polygon'),
 (2433,'A finite 5-pebble-automaton can search every maze'),
 (2434,'Sorting a linked list with equal keys'),
 (2435,'A data structure for dynamic range queries'),
 (2436,'A note on upper bounds for the selection problem'),
 (2437,'Unifiability is complete for co-NlogSpace'),
 (2438,'A new hierarchy of two-dimensional array languages'),
 (2439,'Extendible hashing with overflow'),
 (2440,'Drawing straight lines with a pyramid cellular automaton'),
 (2441,'Directed maximal-cut problems'),
 (2442,'Infinite cube-connected cycles'),
 (2443,'Preemptive scheduling of periodic jobs in uniform multiprocessor systems'),
 (2444,'On the subword complexity of locally catenative DOL languages'),
 (2445,'Traveling salesman cycles are not always subgraphs of Voronoi duals'),
 (2446,'Armstrong databases for functional and inclusion dependencies'),
 (2447,'A representation of disjoint sets with fast initialization'),
 (2448,'A modification of the greedy algorithm for vertex cover'),
 (2449,'On a language without star'),
 (2450,'About rewriting systems produced by the Knuth-Bendix completion algorithm'),
 (2451,'Stabbing C-oriented polygons'),
 (2452,'Relating monotone formula size and monotone depth of boolean functions'),
 (2453,'Accuracy of approximating queueing network departure processes'),
 (2454,'On the enlargement of the class of regular languages'),
 (2455,'On sparse sets in NP-P'),
 (2456,'Stable marriages by coroutines'),
 (2457,'A generalization of two code ordering optimizations'),
 (2458,'Optimal networks for distributing nonsequential programs'),
 (2459,'A decision procedure for optimal polyhedron partitioning'),
 (2460,'Key exchange using keyless cryptography'),
 (2461,'Should the two-headed disk be greedy ? - yes - it should'),
 (2462,'Connectivity and edge disjoint spanning trees'),
 (2463,'Iteration strikes back - at the cyclic towers of Hanoi'),
 (2464,'On-line computation of iterative closures of graphs'),
 (2465,'Minimization of demand paging for the LRU stack model of program behavior'),
 (2466,'Programs as proofs: a synopsis'),
 (2467,'Is SSS* better than alpha-beta ?'),
 (2468,'On computing approximate convex hulls'),
 (2469,'Time complexity of loop-free two-way pushdown automata'),
 (2470,'Analysis of N-trees'),
 (2471,'A control mechanism of a Lisp-based data-driven machine'),
 (2472,'Updating hypothetical data bases'),
 (2473,'Polynomial complete problems in automata theory'),
 (2474,'The theory of functional and subset dependencies over relational expressions'),
 (2475,'An application of a transfer lemma'),
 (2476,'Smoothsort\"s behavior on presorted sequences'),
 (2477,'Scheduling unit-time tasks with integer release time and deadlines'),
 (2478,'On a simple deadlock recovery problem'),
 (2479,'An optimal test on finite unavoidable sets of words'),
 (2480,'A hybrid algorithm for the shortest path between two nodes'),
 (2481,'Generalization of Floyd\"s model'),
 (2482,'Increasing the orders of equidistribution'),
 (2483,'An improved algorithm for the fixed-radius neighbor problem'),
 (2484,'A simulation result for two-way pushdown automata'),
 (2485,'A divide-and-conquer approach to general context-free parsing'),
 (2486,'On the structure of Delta(P -2)'),
 (2487,'Derivation of a termination detection algorithm for distributed computations'),
 (2488,'The effects of checkpointing on program execution time'),
 (2489,'On the size of a square-free morphism on a three letter alphabet'),
 (2490,'Expected-time complexity results for hierarchic clustering algorithms'),
 (2491,'Considerations on the similarity measures between index terms'),
 (2492,'A note on a fast algorithm for sparse matrix multiplication'),
 (2493,'Estimating block transfers when record access probabilities are non-uniform'),
 (2494,'Updating a balanced search tree in O(1) rotations'),
 (2495,'Insertion-safeness in balanced trees'),
 (2496,'Init and Anf operating on omega-languages'),
 (2497,'Computing sums of order-k Fibonacci numbers in log time'),
 (2498,'Trapdoor knapsack without super-increasing structure'),
 (2499,'An algorithm to construct a compact B-tree in case of ordered keys'),
 (2500,'Shape distribution of height-balanced trees'),
 (2501,'Simulation - reduction and preservation'),
 (2502,'Denotational semantics of communicating processes'),
 (2503,'An improved algorithm for hierarchical clustering using strong components'),
 (2504,'A distributed solution of the distributed termination problem'),
 (2505,'Is an exit statement sufficient ?'),
 (2506,'Perfect stables in graphs'),
 (2507,'Contiguous segmentation with limited compacting'),
 (2508,'Optimality of intuitive checkpointing problems'),
 (2509,'Optimum ordered bi-weighted binary trees'),
 (2510,'A note on the power of integer division'),
 (2511,'A faster algorithm for finding edge-disjoint branches'),
 (2512,'Embedding cryprographic trapdoors in arbitrary knapsack systems'),
 (2513,'Log-logarithmic worst-case queries are possible in space PSI(N)'),
 (2514,'Stability of desynchronized 0L systems'),
 (2515,'An algorithm for horizontal decompositions'),
 (2516,'Finding Hamiltonian circuits in proper interval groups'),
 (2517,'Physical parallel devices are not much faster than sequential ones'),
 (2518,'Precise typing and filters'),
 (2519,'Space as time'),
 (2520,'A note on the complexity of a partition algorithm'),
 (2521,'On the subword complexity of m-free D0L languages'),
 (2522,'A measure in which boolean negation is exponentially powerful'),
 (2523,'Reconstructing sequential behavior from parallel behavior projections'),
 (2524,'Semi-linearity - Parikh-boundedness and tree adjunct languages'),
 (2525,'On the arithmetic complexity of matrix Kronecker powers'),
 (2526,'Folding of the plane and the design of systolic arrays'),
 (2527,'Verifying programs by induction on their data structure'),
 (2528,'On the \"correct prefix property\" in precedence parsers'),
 (2529,'The Duodirun merging algorithm: a new fast algorithm for parallel merging'),
 (2530,'The problem of absolute privacy'),
 (2531,'Real-time functional queue operations using the logical variable'),
 (2532,'A fast heuristic based on spacefilling curves'),
 (2533,'Boundedness testing for unambiguous context-free grammars'),
 (2534,'Dynamic cycle detection'),
 (2535,'The liveness property of on-the-fly garbage collector - a proof'),
 (2536,'Two pyramid machine algorithms for edge detection in noisy binary images'),
 (2537,'A note on the \"parallel computation thesis\"'),
 (2538,'A linear time algorithm for the Hausdorff distance between convex polygons'),
 (2539,'Models of programs and processes'),
 (2540,'BPP and the polynomial hierarchy'),
 (2541,'On computing all north-east nearest neighbors in the L1 metric'),
 (2542,'Listing and counting subtrees of equal size of a binary tree'),
 (2543,'A faster lexicographical N queens algorithm'),
 (2544,'Unboundedness detection for a class of communicating finite-state machines'),
 (2545,'An applicative random-access stack'),
 (2546,'Storage requirements for fair scheduling'),
 (2547,'Address calculation algorithms for ordered sets of combinations'),
 (2548,'Recursive descent parsing'),
 (2549,'Some FP algebra with currying operation'),
 (2550,'Where-oblivious is not sufficient'),
 (2551,'A general program scheme for finding bridges'),
 (2552,'A consideration of a practical implementation for a new convergence division'),
 (2553,'Loop cleaning'),
 (2554,'Performance evaluation of concurrent systems using Petri nets'),
 (2555,'Infinitary tree languages recognized by omega-automata'),
 (2556,'Note on node-rewriting graph grammars'),
 (2557,'Diophantine inference on a statistical database'),
 (2558,'Termination detection for distributed computations'),
 (2559,'Parallel strong orientation of an undirected graph'),
 (2560,'Minimum vertex distance between separable convex polygons'),
 (2561,'Large processors are good in VLSI chips'),
 (2562,'A note on array grammars'),
 (2563,'Perception-based configuration design of computer systems'),
 (2564,'A partitioning algorithm for minimum weighted Euclidean matching'),
 (2565,'A parallel view of stable marriages'),
 (2566,'Insecurity of set controls for statistical databases'),
 (2567,'Extending binary Byzantine agreement to multivalued Byzantine agreement'),
 (2568,'A note on specifying and verifying concurrent processes'),
 (2569,'When do non-conflict-free multivalued dependency sets appear'),
 (2570,'On legal path problems in digraphs'),
 (2571,'A probabilistic analysis of an error-correcting algorithm'),
 (2572,'Remarks on two-way automata with weak-counters'),
 (2573,'On a circle-cover minimization problem'),
 (2574,'Backtrack: an O(1) expected time algorithm for the graph coloring problem'),
 (2971,'Transformations for communication fairness in CSP'),
 (2972,'An encoding scheme'),
 (2973,'Varieties of weakest liberal preconditions'),
 (2974,'Prefixes of infinite words and ambiguous context-free languages'),
 (2975,'The complexity of symmetric functions in bounded-depth circuits'),
 (2976,'Inevitability in concurrent systems'),
 (2977,'A note on the number of leftist trees'),
 (2978,'A deficiency of natural deduction'),
 (2979,'Remark on the Hsu-Du new algorithm for the longest common subsequence problem'),
 (2980,'Horner\"s rule and the computation of linear recurrences'),
 (2981,'Parallel (Delta + 1)-coloring of constant-degree graphs'),
 (2982,'An Omega(sqrt n) lower bound'),
 (2983,'A simplified solution of the N queens problem'),
 (2984,'Multiprocessor automata'),
 (2985,'The complexity of minimizing wire lengths in VLSI layouts'),
 (2986,'A log log n data structure for three-sided range queries'),
 (2987,'Garbage collection can be faster than stack allocation'),
 (2988,'On bounds for a board covering problem'),
 (2989,'Stable unmerging in linear time and constant space'),
 (2990,'Optimal checkpointing and local recording for domino-free rollback recovery'),
 (2991,'A storage allocation method with invalidating dangling references'),
 (2992,'Super-exponentials nonprimitive recursive - but rudimentary'),
 (2993,'An application of the planar separator theorem to counting problems'),
 (2994,'A note on Graham\"s convex hull algorithm'),
 (2995,'A new distributed breadth-first-search algorithm'),
 (2996,'Fitted diagonals for reducing I/O bandwidth in systolic systems'),
 (2997,'An efficient solution to the mutual exclusion problem using weak semaphores'),
 (2998,'Packing items from a triangular distribution'),
 (2999,'Nesting on shuffle closure is important'),
 (3000,'On the rotation distance in the lattice binary trees'),
 (3001,'Some average measures in m-ary search trees'),
 (3002,'Generalized lower bounds derived from Hastad\"s main lemma'),
 (3003,'On the worst-case ration of a compound multiprocessor scheduling algorithm'),
 (3004,'The area-time complexity of the VLSI counter'),
 (3005,'Determining connected components in linear time'),
 (3006,'The complexity of strict serializability revisited'),
 (3007,'A note on symmetrical cellular spaces'),
 (3008,'On the complexity of the maximum satisfiability problem for Horn formulas'),
 (3009,'Modeling B-tree insertion activity'),
 (3010,'A notation for distributed operations'),
 (3011,'On the length of word chains'),
 (3012,'Rewriting systems and word problems in a free partially commutative monoid'),
 (3013,'The deap - a double-ended heap to implement double-ended priority queues'),
 (3014,'Practical variations of shellsort'),
 (3015,'Equivalence of multistage interconnection networks'),
 (3016,'Random oracles separate PSPACE from the polynomial-time hierarchy'),
 (3017,'On lexicographic semi-commutations'),
 (3018,'A tight lower bound on the size of visibility graphs'),
 (3019,'On termination of the direct sum of term-rewriting systems'),
 (3020,'A halving technique for the longest stuttering subsequence problem'),
 (3021,'Performance evaluation of concurrent systems'),
 (3022,'Partitioned encryption and achieving simultaneity by partitioning'),
 (3023,'Average efficiency of data structures for binary image processing'),
 (3024,'A D0L-T0L public key cryptosystem'),
 (3025,'Optimal three-dimensional layouts of complete binary trees'),
 (3026,'On the structural locality of reference in Lisp list access streams'),
 (3027,'Arithmetical axiomatization of first-order temporal logic'),
 (3028,'Tight chip area lower bounds for strings matching'),
 (3029,'Towards the minimum set of primitive relations in temporal logic'),
 (3030,'Trinity algebra and its application to machine decompositions'),
 (3031,'Manipulation of data structures without pointers'),
 (3032,'Extended impossibility results for asynchronous complete networks'),
 (3033,'One-way permutations in NC^0'),
 (3034,'Nonconstructive advances in polynomial-time complexity'),
 (3035,'Two normal form theorems for CSP programs'),
 (3036,'Finding the convex hull of a sorted point set in parallel'),
 (3037,'Extension functions for multiset orderings'),
 (3038,'Embedding ternary trees in VLSI arrays'),
 (3039,'Jump interpolation search trees and symmetric binary numbers'),
 (3040,'A decomposition rule for the Hoare logic'),
 (3041,'Finding maximum cliques on circular-arc graphs'),
 (3042,'An architecture for symbolic processing'),
 (3043,'A polynomial characterization of some graph partitioning problems'),
 (3044,'On totalistic systolic networks'),
 (3045,'Fast decoding of the Huffman codes'),
 (3046,'Data refinement by miracles'),
 (3047,'Input-driven languages are in log n depth'),
 (3048,'Looping LR parsers'),
 (3049,'Plane-sweep solves the closest pair problem elegantly'),
 (3050,'An iterative pipelined array architecture'),
 (3051,'Short propositional formulas represent nondeterministic computations'),
 (3052,'On the rotation distance of binary trees'),
 (3053,'A variant of Ben-Or\"s lower bound for algebraic decision trees'),
 (3054,'Implementing functional programs using mutable abstract data types'),
 (3055,'The boundedness problem'),
 (3056,'Minimum-cost spanning tree as a path-finding problem'),
 (3057,'An optimally efficient selection algorithm'),
 (3058,'Yet another distributed depth-first-search algorithm'),
 (3059,'Normalized divide-and-conquer'),
 (3060,'Cause-effect structures'),
 (3061,'On estimating the complexity of logarithmic decompositions'),
 (3062,'Some nested dissection order is nearly optimal'),
 (3063,'A semantic approach for modular synthesis of VLSI systems'),
 (3064,'A separator theorem for one-dimensional graphs under linear mapping'),
 (3065,'Sorting with efficient use of special-purpose sorters'),
 (3066,'Total domination in interval graphs revisited'),
 (3067,'A tagless marking that is linear over subtrees'),
 (3068,'The date refinement calculator for Z specifications'),
 (3069,'Digital and Hilbert k-d trees'),
 (3070,'Parallel O(log n) time edge colouring of trees and Halin graphs'),
 (3071,'A parallel bucket sort'),
 (3072,'A practical method for finding'),
 (3073,'A polynomial algorithm for computation of the probability of'),
 (3074,'A parallelizable lexicographically first maximal'),
 (3075,'An ordered minimal perfect hashing scheme with single parameter'),
 (3076,'On decomposing polygons into uniformly monotone parts'),
 (3077,'A note on unification type zero'),
 (3078,'Cryptographic implementation of a tree hierarchy for access control'),
 (3079,'Finding the vertices nearest to a point in a hypercube'),
 (3080,'On the random construction of heaps'),
 (3081,'Propositional description of finite cause-effect structures'),
 (3082,'On generating all maximal independent sets'),
 (3083,'A faster approximation algorithm for the Steiner problem in graphs'),
 (3084,'Order statistics on a hypercube'),
 (3085,'Parallel circle-cover algorithms'),
 (3086,'A simple parallel algorithm for finding a satisfying truth assignment'),
 (3087,'Positive boolean dependencies'),
 (3088,'On hardness of one-way functions'),
 (3089,'Logic programming with external procedures: introducing S-unification'),
 (3090,'On handling vertex deletion in updating minimum spanning trees'),
 (3091,'Message complexity of the set intersection problem'),
 (3092,'Time and space efficient algorithms'),
 (3093,'Effects of message loss on the termination of distributed protocols'),
 (3094,'On the convergence of stationary distributions'),
 (3095,'On computing a conditional edge-connectivity of a graph'),
 (3096,'Remarks on languages acceptable in log log n space'),
 (3097,'Generating t-ary trees in A-order'),
 (3098,'An exponential lower bound for the pure literal rule'),
 (3099,'Recognizing majority on a one-way mesh'),
 (3100,'Parallel algorithms for computing maximal independent sets in trees'),
 (3101,'On the computability of circumscription'),
 (3102,'A study of page arrangements for extendible hashing'),
 (3169,'Derivation of a waiting-time factor for a multiple-bank memory'),
 (3170,'An approach to multilevel boolean minimization'),
 (3171,'Properties of linear machines'),
 (3172,'Solvability of machine mappings of regular sets to regular sets'),
 (3173,'RS-machines with almost blank tape'),
 (3174,'Input-error-limiting automata'),
 (3175,'Aitken-Hermite interpolation'),
 (3176,'Evaluation of a pseudo-randeom normal number generator'),
 (3177,'Random-access stored-program machines - an approach to programming languages'),
 (3178,'Nonlinear programming with the aid of a multiple-gradient summation technique'),
 (3179,'Some analytical procedures for computers and their applications'),
 (3180,'Generalized inverse computations using the gradient projection method'),
 (3181,'A flow analysis algorithm'),
 (3182,'Mechanized indexing methods and their testing'),
 (3183,'Investigation of computer operating time and system capacity'),
 (3184,'Can a priori probabilities help in character recognition ?'),
 (3185,'Error rates for two methods of statistical pattern recognition'),
 (3186,'Derivatives of regular expressions'),
 (3187,'A Turing machine simulator'),
 (3188,'A programming language for simulating digital systems'),
 (3189,'A machine-oriented logic based on the resolution principle'),
 (3190,'A new normal form theorem for context-free phrase structure grammars'),
 (3191,'A fixed optimum cell-size for records of various lengths'),
 (3192,'Sequential search: a method for solving constrained optimization problems'),
 (3193,'Uniform random number generators'),
 (3194,'Numerical evaluation of symmetric polynomials'),
 (3195,'A fast direct solution of Poisson\"s equation using Fourier analysis'),
 (3196,'Approximation of solutions of mixed boundary value problems'),
 (3197,'A modified multistep method'),
 (3198,'An error bound for a numerical filtering technique'),
 (3199,'Analysis and synthesis of stable linear sequential circuits'),
 (3200,'Discrete orthonormal sequences'),
 (3201,'Examination of multiple roots and root clusters of a polynomial'),
 (3202,'On the numerical solution of ordinary and partial differential equations'),
 (3203,'Convergence problems in Maehly\"s second method'),
 (3204,'The automorphism group if the direct product of strongly related automata'),
 (3205,'Computer studies of Turing machine problems'),
 (3206,'Optimal decision functions for computer character recognition'),
 (3207,'A predictor-corrector algorithm with an increased range of absolute stability'),
 (3208,'Number base conversion in a significant digit arithmetic'),
 (3209,'A \"binary\" system for complex numbers'),
 (3210,'Document association and classification based on L-languages'),
 (3211,'Concerning the merging of equal length tape files'),
 (3212,'The choice of origin and scale for graphs'),
 (3213,'Threshold logic elements used as a probability transformer'),
 (3214,'On the time required to perform addition'),
 (3215,'Digital time-domain analysis of systems with widely separated poles'),
 (3216,'A survey of methods for computing minimax and near-minimax polynomial'),
 (3217,'One view of man-machine interaction'),
 (3218,'An online display for the study of approximating functions'),
 (3219,'On a problem concerning a central storage device served by multiple terminals'),
 (3220,'A modified method of latent class analysis'),
 (3221,'Statistical complexity of algorithms for boolean function minimization'),
 (3222,'On the boolean matrix equation Mprime = OR from i=1 to d Mi'),
 (3223,'Chebyshev solution of n+1 linear equations in n unknowns'),
 (3224,'Generation of primes by a one-dimensional real-time iterative array'),
 (3225,'Location of the maximum on unimodal surfaces'),
 (3226,'Ultimate-definite and symmatric-definite events and automata'),
 (3227,'Generalized cascade decompositions of automata'),
 (3228,'Mappings of languages by two-tape devices'),
 (3229,'Morphological classification'),
 (3230,'Is automatic classification'),
 (3231,'Automatic subject recognition in scientific papers: an empirical study'),
 (3232,'Backtrack programming'),
 (3233,'An investigation of some computational aspects of integer programming'),
 (3234,'Efficiency and completeness of the set of support strategy in theorem proving'),
 (3235,'On mappings for modular arithmetic - I'),
 (3236,'On mappings for modular arithmetic - II'),
 (3237,'Iterative procedures for nonlinear integral equations'),
 (3238,'Groups of automorphisms and sets of equivalence classes of input for automata'),
 (3239,'On the automorphism group of an automaton'),
 (3240,'Analysis of real time multiprogramming'),
 (3241,'Segmentation and the design of multiprogrammed computer systems'),
 (3242,'Updating the product form of the inverse for the revised simplex method'),
 (3243,'Program and addressing structure in a time-sharing environment'),
 (3244,'ALPHA - an automatic programming system of high efficiency'),
 (3245,'Large parallel computers'),
 (3246,'Realization of input-output relations by sequential machines'),
 (3247,'Index register allocation'),
 (3248,'Ambiguity in context free languages'),
 (3249,'On the syntax of algorithmic languages'),
 (3250,'Convergence problems in Maehly\"s second method: part II'),
 (3251,'Pseudo-Runge-Kutta methods involving two points'),
 (3252,'A procedure for nonlinear least squares refinement'),
 (3253,'A method for the solution of roots of a nonlinear equation'),
 (3254,'A note on linear extrapolation of multivariate functions'),
 (3255,'On asymptotic estimates in switching and automata theory'),
 (3256,'Two complete axiom systems for the algebra of regular events'),
 (3257,'Group-type automata'),
 (3258,'Sequential processing machines (S.P.M.) analyzed with a queueing theory model'),
 (3259,'BE VISION - a package of IBM 7090 Fortran programs'),
 (3260,'A mechanical analysis of the cyclic structure of undirected linear graphs'),
 (3261,'Analysis of graphs by connectivity considerations'),
 (3262,'The solvability of the derivability problem for one-normal systems'),
 (3263,'A theory of computer instructions'),
 (3264,'On the class of predicates decidable by two-way multitape finite automata'),
 (3265,'The synthesis of recursive digital filters'),
 (3266,'Unrecognizable sets of numbers'),
 (3267,'Boundary value techniques for the numerical solution'),
 (3268,'Numerical experiments in conformal mapping'),
 (3269,'Some reults on multicategory pattern recognition'),
 (3270,'Time-shared computer operations'),
 (3271,'Conversion of limted-entry decision tables to optimal computer programs I'),
 (3272,'Monogenic Post normal systems of arbitrary degree'),
 (3273,'Preservation of unambiguity and inherent ambiguity in context-free languages'),
 (3274,'Use of multiwrite for general programmability of search memories'),
 (3275,'Predictor-corrector methods of high order'),
 (3276,'Automatic controlled precision calculations'),
 (3277,'Internal sorting by radix plus shifting'),
 (3278,'Generalized single-ended counters'),
 (3279,'Numerical inversion of Laplace transforms using Laguerre functions'),
 (3280,'A class of integration formulas'),
 (3281,'On the \"reverse order law\"'),
 (3282,'An abstract machine for symbolic computation'),
 (3283,'Sequential operations in digital picture processing'),
 (3284,'A formal system for differentiation'),
 (3285,'An extension of Romberg integration procedures to N variables'),
 (3286,'Statistical determination'),
 (3287,'Analysis of the address assignment problem for clustered keys'),
 (3288,'Two-tape simulation of multitape Turing machines'),
 (3289,'On the length of programs for computing finite binary sequences'),
 (3290,'On context-free languages'),
 (3291,'The unsolvability of the recognition of linear context-free languages'),
 (3292,'The independence of inherent ambiguity from complementedness'),
 (3293,'The immortality problem for Post normal systems'),
 (3294,'Discrete analogs for continuous filters'),
 (3295,'Digital one-third octave spectral analysis'),
 (3296,'The placement of computer logic modules'),
 (3297,'The synthesis of algorithmic systems'),
 (3298,'Sieving procedures on a digital computer'),
 (3299,'Statistical discrimination'),
 (3300,'A computer program for the nonnumerical testing and reduction'),
 (3103,'A new computation rule for Prolog'),
 (3104,'An incremental pattern matching algorithm for the pipelined lexical scanner'),
 (3105,'A linear-time algorithm for finding a minimum spanning pseudoforest'),
 (3106,'The complexity of ultrametric partitions on graphs'),
 (3107,'A unified approach to domination problems on interval graphs'),
 (3108,'Line arrangements and range search'),
 (3109,'On the factors of the Thue-Morse word on three symbols'),
 (3110,'A better lower bound for distributed leader finding'),
 (3111,'Shifting timestamps for concurrency control in an information hierarchy');
INSERT INTO `paper` (`PaNum`,`Title`) VALUES 
 (3112,'Optimal fault-tolerant distributed construction of a spanning forest'),
 (3113,'Proof system for weakest prespecification'),
 (3114,'On the connectivity of the de Bruijn graph'),
 (3115,'A lower bound for the edit-distance problem under an arbitrary cost function'),
 (3116,'Nonserial dynamic programming formulations of satisfiability'),
 (3117,'Bifaithful starry transductions'),
 (3118,'Finding paths and deleting edges in directed acyclic graphs'),
 (3119,'The evaluation of an alternative sum'),
 (3120,'Testing for class membership in multi-parent hierarchies'),
 (3121,'On the IO-complexity and approximation languages'),
 (3122,'Infinite hierarchy of expressions containing shuffle closure operator'),
 (3123,'Optimum watchman routes'),
 (3124,'Synchronizing the I/O behavior of functional programs with feedback'),
 (3125,'Paw-free graphs'),
 (3126,'Transposition of an l*l matrix requires Omega(log l) reversals'),
 (3127,'An improved parallel algorithm'),
 (3128,'An O(sqrt n) time algorithm for the ECDF searching problem'),
 (3129,'Computing the determinant and the characterstic polynomial of matrix'),
 (3130,'Prefix and equality languages of rational functions are co-context-free'),
 (3131,'Parallelism and the feedback vertex set problem'),
 (3132,'Linear strategy for propositional modal resolution'),
 (3133,'Computing Eulerian trails'),
 (3134,'Atomic semantics of nonatomic programs'),
 (3135,'A parallel algorithm for recognizing unordered depth-first search'),
 (3136,'Load imbalance in DASD dynamic reconnection'),
 (3137,'Strictness analysis of the untyped lambda-calculus'),
 (3138,'Characterization of some rescaling functions'),
 (3139,'Bad cases for shaker-sort'),
 (3140,'Parallel p-adic computation'),
 (3141,'A probabilistic simulation of PRAMs on a bounded degree network'),
 (3142,'Optimal multidisk partial match file designs'),
 (3143,'A structural test selection criterion'),
 (3144,'On Ianov\"s program schemata'),
 (3145,'Tape sets and automata'),
 (3146,'Universality of tag systems with P=2'),
 (3147,'SNOBOL - a string manipulation language'),
 (3148,'Mixed congruential random number generators for binary machines'),
 (3149,'Calculations with pseudo-random numbers'),
 (3150,'Two new classes of algorithms for finding the eigenvalues and eigenvectors'),
 (3151,'A direct method for Chebyshev approximation by rational functions'),
 (3152,'Tables of the generalized Stirling numbers of the first kind'),
 (3153,'A mathematical method for the automatic scaling of a function'),
 (3154,'Application of ternary algebra to the study of static hazards'),
 (3155,'Estimation of power spectral density by filters'),
 (3156,'Message route control in a large teletype network'),
 (3157,'Fact retrieval and decutive question-answering information retrieval systems'),
 (3158,'Automatic document classification part II: additional experiments'),
 (3159,'Input data source limitations for real-time operation of digital computers'),
 (3160,'Single-scan techniques for the translation of arithmetic expressions'),
 (3161,'Function evaluation in unnormalized arithmetic'),
 (3162,'Generalized multispet predictor-corrector methods'),
 (3163,'Convergence of multipoint iterative methods'),
 (3164,'Multivariable curve interpolation'),
 (3165,'Tables for the step-by-step integration'),
 (3166,'Algebraic specification of statistical models'),
 (3167,'Digital computer system for dynamic analysis'),
 (3168,'An efficient algorithm for finding certain minimum-cost procedures'),
 (2839,'Safety without stuttering'),
 (2840,'A generalized deadlock predicate'),
 (2841,'Towards an asymptotic analysis of Karmarkar\"s algorithm'),
 (2842,'Hamiltonian circuits in interval graph generalizations'),
 (2843,'Resolution deduction to detect satisfiability for another class'),
 (2844,'Eliminating the flag in threaded binary search trees'),
 (2845,'The efficiency of using k-d trees'),
 (2846,'A parallel O(log n) algorithm'),
 (2847,'A note on complete problems for complexity classes'),
 (2848,'An alternative implementation of communication primitives'),
 (2849,'Merging by the parallel jump searching algorithm'),
 (2850,'The value of an array facility in Prolog'),
 (2851,'Denotational semantics of communicating sequential programs'),
 (2852,'A note on implementing Prolog in Lisp'),
 (2853,'An in situ distributive sort'),
 (2854,'A note on pure grammars'),
 (2855,'The inaccessible set'),
 (2856,'On the complexity of some extended word problems'),
 (2857,'Halfplanar range search in linear space and O(n^0.695) query time'),
 (2858,'A new generalization of Dekker\"s algorithm for mutual exclusion'),
 (2859,'The correctness of nondeterministic programs revisited'),
 (2860,'A bit-string longest-common-subsequence algorithm'),
 (2861,'Efficient computation of the locally least-cost insertion string'),
 (2862,'A linear algorithm for the cutting center of a tree'),
 (2863,'When chasing your tail saves time'),
 (2864,'L-attributed LL(1)-grammars are LR-attributed'),
 (2865,'Weighted grammars and Kleene\"s theorem'),
 (2866,'How to prove representation-independent independence results'),
 (2867,'In-situ conversion of a cyclic permutation'),
 (2868,'An O(n log n log log n) parallel maximum matching algorithm'),
 (2869,'Multiple cuts - input repetition - and VLSI complexity'),
 (2870,'An efficient deadlock avoidance algorithm'),
 (2871,'ECLR-attributed grammars: a practical class of LR-attributed grammars'),
 (2872,'Predicate transfer and timeout in message-passing systems'),
 (2873,'The alpha-beta algorithm: an exercise in program transformation'),
 (2874,'Binary search networks: a new method for key searching'),
 (2875,'An O(n^2) algorithm for the satisfiability problem'),
 (2876,'An off-line storage allocation algorithm'),
 (2877,'Uniform inevitability is tree automation ineffable'),
 (2878,'An infinite word language which is not co-CFL'),
 (2879,'Concurrent execution of transaction copies'),
 (2880,'A note on a new data structure for in-the-past queries'),
 (2881,'On determining the on-line minimax linear fit to a discrete point set'),
 (2882,'The program dependence graph in static program testing'),
 (2883,'Subsumption and implication'),
 (2884,'A simple realization of LR-parsers for regular right part grammars'),
 (2885,'Parallelism and the maximal path problem'),
 (2886,'The weakest prespecification'),
 (2887,'The maximum colorable subgraph problem for chordal graphs'),
 (2888,'The complexity of scheduling independent two-processor tasks'),
 (2889,'A note on the transaction backout problem'),
 (2890,'A polynomial algorithm for b-matchings: an alternative approach'),
 (2891,'Generation of convex polygons with individual angular constraints'),
 (2892,'The planar realization of boolean functions'),
 (2893,'On solving hard problems by polynomial-size circuits'),
 (2894,'How to compare the incomparable'),
 (2895,'A set of combinators for abstraction in linear space'),
 (2896,'On a recursion connected with tree balancing algorithms'),
 (2897,'An algorithm for determining an opaque minimal forest of a convex polygon'),
 (2898,'A distributed algorithm to prevent mutual drift between n logical clocks'),
 (2899,'A note on extending Knuth\"s tree estimator to directed acyclic graphs'),
 (2900,'Explicit solution of block tridiagonal systems of linear equations'),
 (2901,'\"Algorithms for on-the-fly garbage collection\" revisited'),
 (2902,'Computing dominators in parallel'),
 (2903,'A note on the formula size of the \"mod k\" functions'),
 (2904,'Time efficient systolic architecture for matrix * vector multiplication'),
 (2905,'A logarithmic boolean time algorithm for parallel polynomial division'),
 (2906,'Chordal graph recognition is in NC'),
 (2907,'Obtaining lower bounds using artificial components'),
 (2908,'A variant of heapsort with almost optimal number of comparisons'),
 (2909,'A general method for avoiding cycling in a network'),
 (2910,'Strict combinators'),
 (2911,'Minimizing mean weighted execution time loss'),
 (2912,'Correctness of an extended operator-precedence parsing algorithm'),
 (2913,'A liveness property of a parallel algorithm'),
 (2914,'A note on the computation of the k-closure of a graph'),
 (2915,'Using string-rewriting'),
 (2916,'Shortest path between two simple polygons'),
 (2917,'Computing the number of mergings with constraints'),
 (2918,'A distributed algorithm for distributed termination'),
 (2919,'Automating the semantic component'),
 (2920,'Improved update/query algorithms for the interval valuation problem'),
 (2921,'On the costs of self-stabilization'),
 (2922,'The automated solution of logic puzzles'),
 (2923,'Remarks on string-matching and one-way multihead automata'),
 (2924,'A note on undefined execution values in programming logics'),
 (2925,'Time- and space-optimal contour computation for a set of rectangles'),
 (2926,'Traveling salesman cycles are not always subgraphs'),
 (2927,'Variable abstraction in O(n log n) space'),
 (2928,'Sorting numbers using limited systolic coprocessors'),
 (2929,'On the size of nonredundant FD-covers'),
 (2930,'There are no fully space constructible functions between log log n and log n'),
 (2931,'An improved simulation of space and reversal bounded deterministic'),
 (2932,'Digitizing the plane with cells of nonuniform size'),
 (2933,'Occam\"s razor'),
 (2934,'A fast multiprocessor message passing implementation'),
 (2935,'Optimization of argument evaluation order'),
 (2936,'A note on the effect of preemptive policies'),
 (2937,'A note on external sorting using almost single input buffering'),
 (2938,'A new algorithm for parallel solution of linear equations'),
 (2939,'Zooming by repeated range detection'),
 (2940,'Some observations concerning alternating Turing machines using small space'),
 (2941,'On-line construction of the convex hull of a simple polyline'),
 (2942,'Separation with the Ruzzo - Simon and Tompa relativization'),
 (2943,'Probable correctness theory'),
 (2944,'An O(n^1.5) algorithm to decide boundedness'),
 (2945,'Fixed hypercube embedding'),
 (2946,'Obstacle growing in a nonpolygonal world'),
 (2947,'A fast parallel coloring of planar graphs with five colors'),
 (2948,'An O(log n) time parallel algorithm'),
 (2949,'Performance of distributive partitioned sort in a demand paging environment'),
 (2950,'A topological approach to dynamic graph connectivity'),
 (2951,'Prespecification in data refinement'),
 (2952,'A linear expected-time algorithm'),
 (2953,'Efficient algorithms for common transversals'),
 (2954,'Predicative specifications'),
 (2955,'A time-optimal message-efficient distributed algorithm for depth-first search'),
 (2956,'Parallel algorithms for finding Hamiltonian cycles in random graphs'),
 (2957,'An observation concerning constraint-based compaction'),
 (2958,'The complexity of preemptive scheduling'),
 (2959,'Does co-NP have short interactive proofs ?'),
 (2960,'Quantification in Algol-like languages'),
 (2961,'Counterexamples to termination for the direct sum of term rewriting systems'),
 (2962,'On the proof of a distributed algorithm'),
 (2963,'A non-Hamiltonian - nondegenerate Delaunay triangulation'),
 (2964,'On distributed snapshots'),
 (2965,'A lower bound on the complexity'),
 (2966,'Stopping times of distributed consensus protocols: a probabilistic analysis'),
 (2967,'Local authentication in insecure environments'),
 (2968,'Interpreting logics of knowledge in propositional dynamic logic with converse'),
 (2969,'History sensitive string for multiple alphabets'),
 (2970,'On the detection of unstructuredness in flowgraphs'),
 (3565,'Equilibration of symmetric matrices in the max-norm'),
 (3566,'A note on consistent ordering and zero circulation'),
 (3567,'A note on quadrilateral interpolation'),
 (3568,'Multiplicative pseudo-random number generators with rpime modulus'),
 (3569,'Solving boundary-value problems by imbedding'),
 (3570,'A dynamic time-sharing priority queue'),
 (3571,'A note on some mathematical models of time-sharing systems'),
 (3572,'On network linguistics and the conversational design of queueing networks'),
 (3573,'Two results on ordering for resolution with merging and linear format'),
 (3574,'What is computer science ?'),
 (3575,'S-semigroups of automata'),
 (3576,'Linear and context-free graph grammars'),
 (3577,'Analysis of graphs by ordering of nodes'),
 (3578,'A new search algorithm for finding'),
 (3579,'Memory requirements in a multiprocessing environment'),
 (3580,'Analysis of two time-sharing queueing models'),
 (3581,'Service in a loop system'),
 (3582,'Fuzzy logic and the resolution principle'),
 (3583,'Automatic theorem proving with built-in theories'),
 (3584,'Addressless units for carrying out loop-free computations'),
 (3585,'Computational complexity and the existence of complexity gaps'),
 (3586,'The operator gap'),
 (3587,'Theoretical efficiency of the Edmonds-Karp algorithm'),
 (3588,'Multitape AFA'),
 (3589,'A note on bracketed grammars'),
 (3590,'Weak and mixed strategy precedence parsing'),
 (3591,'Corrections to Bierstone\"s algorithm for generating cliques'),
 (3592,'Theoretical improvements in algorithmic efficiency'),
 (3593,'On the maximization of a pseudo-boolean function'),
 (3594,'One-pass complexity of digital picture properties'),
 (3595,'Recursive properties of abstract complexity classes'),
 (3596,'Addressable data graphs'),
 (3597,'Sorting using networks of queues and stacks'),
 (3598,'Statistical studies of theoremhood'),
 (3599,'A unifying view of some linear Herbrand procedures'),
 (3600,'An algorithm for the design of simple precedence grammars'),
 (3601,'The halting problem for probabilistic context-free generators'),
 (3602,'Permutation graphs and transitive graphs'),
 (3603,'Graph structures'),
 (3604,'Finding the lengths of all shortest paths'),
 (3605,'Practical aspects of doubly chained trees for retrieval'),
 (3606,'Inversion of persymmetric matrices having Toeplitz inverses'),
 (3607,'Nonpriority multiprogramming systems under heavy demand conditions'),
 (3608,'Busy period analysis of a time-sharing system: transform inversion'),
 (3609,'Processor sharing queueing models of mixed scheduling disciplines'),
 (3610,'A stochastic model for message assembly buffering'),
 (3611,'An approach for finding C-linear complete inference systems'),
 (3612,'The expression of algorithms by charts'),
 (3613,'Subrecursive programming languages - part I'),
 (3614,'A note on the efficiency of hashing functions'),
 (3615,'Computer approaches to the representation of Lie algebras'),
 (3616,'Real-time simulation of multihead tape units'),
 (3617,'A note concerning nondeterministic tape complexities'),
 (3618,'An axiomatic approach to code optimization for expressions'),
 (3619,'Bounds on optimal merge performance - and a strategy for optimality'),
 (3620,'On the optimality of some set algorithms'),
 (3621,'Computational work and time on finite machines'),
 (3622,'On the covering and reduction problems for context-free grammars'),
 (3623,'The generation of minimal trees with a Steiner topology'),
 (3624,'Accelerated algorithms for labeling and relabeling of trees -'),
 (3625,'A note on feedback queues with bulk service'),
 (3626,'A minimum variance sampling technique for simulation models'),
 (3627,'Toward a formal theory of modeling and simulation'),
 (3628,'Upper bounds for the total path length of binary trees'),
 (3629,'A-stable composite multistep methods'),
 (3630,'An efficient parallel algorithm'),
 (3631,'A combinatorial problem related to interleaved memory systems'),
 (3632,'Scheduling algorithms for multiprogramming'),
 (3633,'Mathematical models for automatic line detection'),
 (3634,'Arcs and curves in digital pictures'),
 (3635,'Efficient exercising of switching elements in nets of identical gates'),
 (3636,'The solvability of the decision problem'),
 (3637,'Z-resolution: theorem-proving with compiled axioms'),
 (3638,'A class of merging algorithm'),
 (3639,'Tree-manipulating systems and Church-Rosser theorems'),
 (3640,'An axiomatic approach to code optimization for expressions'),
 (3641,'Set covering by an all integer algorithm: computational experience'),
 (3642,'Benefit-cost analysis of coding techniques'),
 (3643,'Canonical precedence schemes'),
 (3644,'A formalization of transition diagram systems'),
 (3645,'Recent studies in automatic text analysis and document retrieval'),
 (3646,'Best least squares solutions to finite difference equations'),
 (3647,'Optimal covering algorithms in methods of search'),
 (3648,'A midpoint phenomenon'),
 (3649,'Note on the lower bound of the linear complexity'),
 (3650,'Optimization of static loading and sizing'),
 (3651,'Efficient exercising of switching elements in combinational nets'),
 (3652,'A complete mechanization of second-order type theory'),
 (3653,'A backtrack procedure for isomorphism of directed graphs'),
 (3654,'A path entropy function for rooted trees'),
 (3655,'A note on Dijkstra\"s shortest path algorithm'),
 (3656,'A note on Yen\"s algorithm for finding the length'),
 (3657,'On local roundoff errors in floating-point arithmetic'),
 (3658,'Toward abstract numerical analysis'),
 (3659,'An algorithm for the inversion of block matrices of Toeplitz form'),
 (3660,'Cyclic queues with bulk arrivals'),
 (3661,'Placement of records on a secondary storage device'),
 (3662,'Some results in computational topology'),
 (3663,'Generalized feedback shift register pseudorandom number algorithm'),
 (3664,'An asymptotically random Tausworthe sequence'),
 (3665,'Efficient ordering of set expressions for symbolic expansion'),
 (3666,'Decidable properties of monodic functional schemas'),
 (3667,'Loopless algorithms for generating permutations - combinations -'),
 (3668,'Parallel program schemata and maximal parallelism I'),
 (3669,'Bernouil\"s method with implicit shifting'),
 (3670,'On testing a subroutine for the numerical integration'),
 (3671,'The exact solution of systems of linear equations'),
 (3672,'A multiprogramming queue'),
 (3673,'Performance of movable-head disk storage devices'),
 (3674,'On the optimality of the probability ranking scheme'),
 (3675,'A local visual operator which recognizes edges and lines'),
 (3676,'The concept of weak substitution in theorem proving'),
 (3677,'Ordinal hierarchies and naming complexity classes'),
 (3678,'An example of information and computation resource tradeoff'),
 (3679,'Parallel program schemata and maximal parallelism II'),
 (3680,'On a statistical model of Strand and Westwater'),
 (3681,'Some a posteriori error bounds in floating-point computations'),
 (3682,'Processing times for segmented jobs with I/O compute overlap'),
 (3683,'Some distribution-free aspects of paging algorithm performance'),
 (3684,'Finding optimal demand paging algorithms'),
 (3685,'Some aspects of hierarchical memory systems'),
 (3686,'Scheduling for minimum total loss using service time distribution'),
 (3687,'Some topics in code optimization'),
 (3688,'Simulating stable stochastic systems I'),
 (3689,'Simulating stable stochastic systems I'),
 (3690,'An implementation of the model elimination proof procedure'),
 (3691,'Characterization and theoretical comparison'),
 (3692,'A theorem in the theory of compromise merge methods'),
 (3693,'On the number of multiplications for the evaluation of a polynomial'),
 (3694,'The string-to-string correction problem'),
 (3695,'Some binary derivation systems'),
 (3696,'A new class of automated theorem-proving algorithms'),
 (3697,'The parallel evaluation of general arithmetic expressions'),
 (3698,'Further results on the problem of finding minimal length programs'),
 (3699,'Grammar schemata'),
 (3700,'A modified list technique allowing binary search'),
 (3701,'A document storage method based on polarized distance'),
 (3702,'Efficient storage and retrieval'),
 (3703,'Calculating the eigenvectors of diagonally dominant matrices'),
 (3704,'The solution of a Toeplitz set of linear equations'),
 (3705,'Computing partitions with applications to the knapsack problem'),
 (3706,'Bernstein-Bezier methods for the computer-aided design'),
 (3707,'Efficiency of Chebyshev approximation on finite subsets'),
 (3708,'Comments on a paper by Gaver'),
 (3709,'Application of the diffusion approximation to queueing networks I'),
 (3710,'Synthesis of a feedback queueing discipline for computer operation'),
 (3711,'Priority disciplines in a loop system'),
 (3712,'An efficient algorithm for finding an irredundant set cover'),
 (3713,'A diclique representation and decomposition of binary relations'),
 (3714,'Characterizations of reducible flow graphs'),
 (3715,'Efficiency of binary comparison storage technique'),
 (3716,'An algorithm for the chromatic number of a graph'),
 (3717,'A combinatorial problem related to multimodule memory organizations'),
 (3718,'Information-theoretic limitations of formal systems'),
 (3719,'On almost everywhere complex recursive functions'),
 (3720,'Iterated limiting recursion and the program minimization problem'),
 (3721,'Context-limited grammars'),
 (3722,'Computing a subinterval of the image'),
 (3723,'Application of the diffusion approximation to queueing networks II'),
 (3724,'Waiting lines and times in a system with polling'),
 (3725,'Bounds for some functions concerning dynamic storage allocation'),
 (3726,'Transformation of multisalesmen problem'),
 (3727,'An algorithm for the bounded variable integer programming problem'),
 (3728,'Some new bounds on the condition numbers of optimally scaled matrices'),
 (3729,'On the parsing of deterministic languages'),
 (3730,'Efficient planarity testing'),
 (3731,'An optimal algorithm to detect a line graph and output its root graph'),
 (3732,'A search procedure for Hamilton paths and circuits'),
 (3733,'Linear least squares by elimination and MGS'),
 (3734,'The undecidability of the existence of zeros'),
 (3735,'Unit refutations and Horn sets'),
 (3736,'A human oriented logic for automatic theorem-proving'),
 (3737,'Automated theorem-proving for theories'),
 (3738,'Optimal order of one-point and multipoint iteration'),
 (3739,'Allocating storage for extendible arrays'),
 (3740,'Testing for the Church-Rosser property'),
 (3741,'An analysis of some relationships between Post and Boolean algebras'),
 (3742,'Regularity and related problems for deterministic pushdown automata'),
 (3743,'An algorithm for finding a minimal equivalent graph of a digraph'),
 (3744,'A formal construction of term classes'),
 (3745,'On computing the exact determinant'),
 (3746,'High order search methods for finding roots'),
 (3747,'A metalgorithm for adaptive quadrature'),
 (3748,'An analysis of drum storage units'),
 (3749,'Exact - approximate and guaranteed accuracy algorithms'),
 (3750,'Approximate algorithms for the 0/1 knapsack problem'),
 (3751,'The change-making problem'),
 (3752,'Proving theorems about Lisp functions'),
 (3753,'Derivation of a path-connectivity matrix for tagged flowcharts'),
 (3754,'On the structure of polynomial time reducibility'),
 (3755,'An extension of the string-to-string correction problem'),
 (3756,'The linear complexity of computation'),
 (3757,'Bounds to complexities of networks for sorting and for switching'),
 (3758,'Efficient generation of optimal prefix code'),
 (3759,'Efficiency of a good but not linear set union algorithm'),
 (3760,'A simple planarity criterion'),
 (3761,'A generalized multi-entrance time-sharing priority queue'),
 (3762,'Open - closed - and mixed networks of queues'),
 (3763,'On approximate computer system models'),
 (3764,'A processor in series with demand-interrupting devices'),
 (3765,'Multivariate polynomial factorization'),
 (3766,'Inference and paraphrase by computer'),
 (3767,'A theory of program size formally identical to information theory'),
 (3768,'On reducibility to complex or sparse sets'),
 (3769,'A new linear-time \"on-line\" algorithm'),
 (3770,'Advances on the Hamiltonian completion problem'),
 (3771,'Representing graphs by Knuth trees'),
 (3772,'The complexity of some simple retrieval problems'),
 (3773,'Primes with a prime subscript'),
 (3774,'The generation of optimal code for stack machines'),
 (3775,'Queueing analysis of the scan policy for moving-head disks'),
 (3776,'A computational study of the effects of problem dimensions'),
 (3777,'The concept of term exclusiveness'),
 (3778,'The effect of a capacity constraint'),
 (3779,'A sorting algorithm for polynomial multiplication'),
 (3780,'Fast approximation algorithms'),
 (3781,'On finding the maxima of a set of vectors'),
 (3782,'On the parallel evaluation of certain arithmetic expressions'),
 (3783,'An observation on relative parsing time'),
 (3784,'A note on tape-bounded complexity classes'),
 (3785,'A sufficient bound for codes correcting bursts with weight constraint'),
 (3786,'A class of implicit Runge-Kutta methods for the numerical integration'),
 (3787,'Computer search for numerical instability'),
 (3788,'Analysis of several task-scheduling algorithms'),
 (3789,'The fanout structure of switching functions'),
 (3790,'A proof procedure using connection graphs'),
 (3791,'On the interconnection of asynchronous control structures'),
 (3792,'Bounds on the complexity of the longest common subsequence problem'),
 (3793,'Bounds for the string editing problem'),
 (3794,'On the complete covering problem for LR(k) grammars'),
 (3795,'An algorithm for subgraph isomorphism'),
 (3796,'The complexity of near-optimal graph coloring'),
 (3797,'A shortest path algorithm for edge-sparse graphs'),
 (3798,'A Gaussian elimination algorithm'),
 (3799,'Note on Hopcroft and Tarjan\"s planarity algorithm'),
 (3800,'Precision weighting - an effective automatic indexing method'),
 (3801,'Numerical inversion of Laplace transforms'),
 (3802,'Adaptive allocation of central processing unit quanta'),
 (3803,'Record allocation for minimizing expected retrieval costs'),
 (3804,'Algorithms for scheduling independent tasks'),
 (3805,'The independence of miss ratio on page size'),
 (3806,'A polynomial-time algorithm'),
 (3807,'A code for the transportation problem of linear programming'),
 (3808,'Global data flow analysis and iterative algorithms'),
 (3809,'A fast and usually linear algorithm for global flow analysis'),
 (3810,'A completeness theorem'),
 (3811,'An efficient implementation of Edmonds algorithm'),
 (3812,'Efficiency of computation of Cayley tables of 2-groups'),
 (3813,'Fast multiple-precision evaluation of elementary functions'),
 (3814,'New algorithms and lower bounds for the parallel evaluation'),
 (3815,'A space-economical suffix tree construction algorithm'),
 (3816,'A statistical model for relevance feedback in information retrieval'),
 (3817,'Convergence estimates for the distribution of trailing digits'),
 (3818,'Array permutation by index-digit permutation'),
 (3819,'On the linear convergence of a covariance factorization algorithm'),
 (3820,'Exact and approximate algorithms'),
 (3821,'A queueing model with finite waiting room and blocking'),
 (3822,'A note on the effect of the'),
 (3823,'Simulating stable stochastic systems - VI: quantile estimation'),
 (3824,'A simple approximation to the average queue size'),
 (3825,'Picture segmentation by a tree traversal algorithm'),
 (3826,'Proving properties of complex data structures'),
 (3827,'Resolution strategies as decision procedures'),
 (3828,'Canonical coin changing and greedy solutions'),
 (3301,'Computable error bounds for direct solution of linear equations'),
 (3302,'A modification of Davidson\"s minimization method'),
 (3303,'A multistep generalization of Runge-Kutta methods with four or five stages'),
 (3304,'Fourier analysis of uniform random number generators'),
 (3305,'Binomial-weighted orthogonal polynomials'),
 (3306,'Subresultants and reduced polynomial remainder sequences'),
 (3307,'Modified multistep methods based on a nonpolynomial interpolant'),
 (3308,'Multistep methods with modified predictors and correctors'),
 (3309,'A remark on Post normal systems'),
 (3310,'Stack automata and compiling'),
 (3311,'A survey of microcellular research'),
 (3312,'Time-shared systems: a theoretical treatment'),
 (3313,'Some mathematical considerations of time-sharing scheduling algorithms'),
 (3314,'Error probability in decision functions for character recognition'),
 (3315,'Models of computations and systems -'),
 (3316,'Path detection in multidimensional iterative arrays'),
 (3317,'A convergent algorithm for solving polynomial equations'),
 (3318,'Iterative refinement in floating point'),
 (3319,'A machine-independent theory of the complexity of recursive functions'),
 (3320,'A uniform random number generator'),
 (3321,'Resolution by iteration of some nonlinear systems'),
 (3322,'A test for instability in the numerical solution'),
 (3323,'A procedure for checking equality of regular expressions'),
 (3324,'On the numerical solution of a quasi-linear elliptic equation'),
 (3325,'Irreducible topological components of an arbitrary boolean truth function'),
 (3326,'Note concerning the algebraic theory of automata'),
 (3327,'One-way stack automata'),
 (3328,'Probability models for multiprocessor computer systems'),
 (3329,'Production and stabilization of real-time task schedules'),
 (3330,'Roots of star events'),
 (3331,'Some bounds on the storage requirements'),
 (3332,'Parenthesis grammars'),
 (3333,'Matrix equations and normal forms for context-free grammars'),
 (3334,'Analysis of factorial experiments using generalized matrix operations'),
 (3335,'A method for constructing circuit codes'),
 (3336,'An algorithm for generating stable feedback shift registers of order n'),
 (3337,'On the compatibility of a given solution with the data of a linear system'),
 (3338,'Numerical solution of parabolic partial differential equations'),
 (3339,'The organization of computations for uniform recurrence equations'),
 (3340,'Application of parallel processing to numerical weather prediction'),
 (3341,'Programming languages for automata'),
 (3342,'Nondeterministic algorithms'),
 (3343,'Real-time definable languages'),
 (3344,'On memory requirements for context-free language recognition'),
 (3345,'Periodic decomposition of sequential machines'),
 (3346,'The solvability of the halting problem for 2-state Post machines'),
 (3347,'Minimal experiments for input-independent machines'),
 (3348,'Automatic theorem proving with renamable and semantic resolution'),
 (3349,'The concept of demodulation in theorem proving'),
 (3350,'Morphology of \"information flow\"'),
 (3351,'An algorithm for reconstructing protein and RNA sequences'),
 (3352,'On a continuous method of approximating solutions of the heat equation'),
 (3353,'Conversion of limited-entry decision tables to optimal computer programs II'),
 (3354,'Matrix inversion using parallel processing'),
 (3355,'On computing the fixed-point probability vector'),
 (3356,'Solution of ordinary differential equations using two \"off-step\" points'),
 (3357,'Some new results in pseudo-random number generation'),
 (3358,'On the time required to perform multiplication'),
 (3359,'Computers then and now'),
 (3360,'Computer evaluation of indexing and text processing'),
 (3361,'PL360'),
 (3362,'Solution of integer linear programming problems by direct search'),
 (3363,'Experiments with a multipurpose - theorem-proving heuristic program'),
 (3364,'Statistical estimation of the numerical solution'),
 (3365,'Numerical inversion of Laplace transforms'),
 (3366,'Some completeness results in the mathematical theory of computation'),
 (3367,'Structure and transition-preserving functions of finite automata'),
 (3368,'A permutation network'),
 (3369,'A formalism for program translation'),
 (3370,'Structuring of parallel algorithms'),
 (3371,'The prespective representation of functions of two variables'),
 (3372,'A mathematical model for the analysis of contour-line data'),
 (3373,'A bidirectional simplex algorithm'),
 (3374,'Mechanical theorem-proving by model elimination'),
 (3375,'An adaptation of the fast Fourier transform for parallel processing'),
 (3376,'Quasi-Newton methods for nonlinear equations'),
 (3377,'Common solution for n matrix equations with applications'),
 (3378,'Analysis in a computable number field'),
 (3379,'A remark on acceptable sets of numbers'),
 (3380,'Generalized pair algebra with applications to automata theory'),
 (3381,'Decidable and undecidable questions about automata'),
 (3382,'Computational complexity of one-tape Turing machine computations'),
 (3383,'Analysis of two time-sharing algorithms designed for limited swapping'),
 (3384,'A procedure for detecting intersections of three-dimensional objects'),
 (3385,'Resolution with merging'),
 (3386,'On the recognition of primes by automata'),
 (3387,'A modification of Nordsieck\"s method using an \"off-step\" point'),
 (3388,'Inversion of modified symmetric matrices'),
 (3389,'The unsolvability of the equivalence problem'),
 (3390,'Relations between time and tape complexities'),
 (3391,'One-way deterministic real-time list-storage languages'),
 (3392,'A universal syntax-directed top-down analyzer'),
 (3393,'Syntax-directed transduction'),
 (3394,'Semantic clustering of index terms'),
 (3395,'PATRICIA - practical algorithm to retrieve information coded in alphanumeric'),
 (3396,'The influence of data base characteristics and usage'),
 (3397,'Feedback queueing models for time-shared systems'),
 (3398,'Queueing analysis of the IBM 2314 disk storage facility'),
 (3399,'Scheduling parallel computations'),
 (3400,'A method for obtaining skeletons using a quasi-euclidean distance'),
 (3401,'A formal deductive problem-solving system'),
 (3402,'Indexed grammars - an extension of context-free grammars'),
 (3403,'On the independence of real-time definability'),
 (3404,'Degrees of unsolvability in formal grammars'),
 (3405,'Representation of events in the von Neumann cellular model'),
 (3406,'A theorem for the stability of general predictor-corrector methods'),
 (3407,'Generalized multistep methods in satellite orbit computation'),
 (3408,'A policy for JACM'),
 (3409,'One man\"s view of computer science'),
 (3410,'MERCURY: a system for the computer-aided distributed of technical reports'),
 (3411,'Automatic question-answering of English-like questions about simple diagrams'),
 (3412,'Semi-automated mathematics'),
 (3413,'Recursive formulas for the evaluation of the convolution integral'),
 (3414,'Analysis of a drum input/output queue'),
 (3415,'An infinite hierarchy of context-free languages'),
 (3416,'Programmed grammars and classes of formal languages'),
 (3417,'On decompositions of regular events'),
 (3418,'On the length of programs for computing finite binary sequences'),
 (3419,'On the complexity of undecidable problems in automata theory'),
 (3420,'Some results on tape-bounded Turing machines'),
 (3421,'A model of replication'),
 (3422,'Experiments with some programs that search game trees'),
 (3423,'Automorphisms of polyadic automata'),
 (3424,'A note on star-free events'),
 (3425,'Synchronization and general repetitive machines -'),
 (3426,'The time required for group multiplication'),
 (3427,'Properties of programs and first-order predicate calculus'),
 (3428,'A direct proof of the inherent ambiguity of a simple context-free language'),
 (3429,'Translation networks and function composition'),
 (3430,'New methods in automatic extracting'),
 (3431,'Lattice approximations to the minima of functions of several variables'),
 (3432,'Linear multistep methods for Volterra integro-differential equations'),
 (3433,'Inversion of matrices by partitioning'),
 (3434,'A time-sharing queue with a finite number of customers'),
 (3435,'The recursive unsolvability of the decision problem'),
 (3436,'Toward a theory of enumerations'),
 (3437,'A simplified format for the model elimination theorem-proving procedure'),
 (3438,'A planning problem solver based on look-ahead in stochastic game trees'),
 (3439,'Nested stack automata'),
 (3440,'On the simplicity and speed of programs'),
 (3441,'A syntax-analysis procedure for umambiguous context-free grammars'),
 (3442,'On the periodic representations and the reducibility of periodic automata'),
 (3443,'Lattice functions - pair algebras - and finite-state machines'),
 (3444,'An algorithm for finding the minimum equivalent graph of a digraph'),
 (3445,'A generalization of shift-register sequence generators'),
 (3446,'Organization of large scale Fourier processors'),
 (3447,'Notes on the adaptive Simpson quadrature routine'),
 (3448,'A new look at the numerical integration of ordinary differentiel equations'),
 (3449,'On monotone decomposable operators'),
 (3450,'A stochastic approximation method for optimization problems'),
 (3451,'Sufficient conditions for the success of GPS'),
 (3452,'Continuous skeletons from digitized images'),
 (3453,'Halting stack automata'),
 (3454,'A cycle generation algorithm for finite undirected linear graphs'),
 (3455,'File organization: on the selection'),
 (3456,'Nonnormality and Jordan condition numbers of matrices'),
 (3457,'Finite difference scheme for a third boundary value problem'),
 (3458,'Toeplitz matrix inversion: the algorithm of T.F. Trench'),
 (3459,'Analysis and optimization of disk storage devices for time-sharing systems'),
 (3460,'Random sets in subrecursive hierarchies'),
 (3461,'Computer time-sharing queues with priorities'),
 (3462,'On the role of the ACM Journal'),
 (3463,'Two-way balloon automata and AFL'),
 (3464,'Total precedence relations'),
 (3465,'General problems of formal grammars'),
 (3466,'A note on ambiguity of context-free languages'),
 (3467,'An efficient algorithm for graph isomorphism'),
 (3468,'Storage requirements for information handling centers'),
 (3469,'An algorithm for convex polytopes'),
 (3470,'Symbolic generation of an optimal crout algorithm'),
 (3471,'Note on a least squares inverse of a matrix'),
 (3472,'Algorithmic solution of the change-making problem'),
 (3473,'Waiting time distributions for processor sharing systems'),
 (3474,'A queueing theory study'),
 (3475,'Connectivity in digital pictures'),
 (3476,'Thresholded convolution operations'),
 (3477,'Simplification of the covering problem'),
 (3478,'An algorithm for modular partitioning'),
 (3479,'Form and content in computer science'),
 (3480,'A programming language with automatic goal generation and selection'),
 (3481,'Connectivity and reversibility in automata'),
 (3482,'Computational complexity and probability constructions'),
 (3483,'Kronecker matrices - computer implementation - and generalized spectra'),
 (3484,'Sequences of numbers that are approximately completely equidistributed'),
 (3485,'Methods of search for solving polynomial equations'),
 (3486,'Stability analysis of a new algorithm'),
 (3487,'Application of the method of lines'),
 (3488,'An approach to solving linear discrete optimization problems'),
 (3489,'A feedback queueing system with batch arrivals - bulk service -'),
 (3490,'The logical complexity of geometric properties in the plane'),
 (3491,'On limit properties in digitization schemes'),
 (3492,'An algorithmic semantics for Algol 60 identifier notation'),
 (3493,'Accelerating list processing in discrete programming'),
 (3494,'On canonical forms and simplification'),
 (3495,'On the approximate solution of free boundary problems'),
 (3496,'An initial-value theory for Fredholm integral equations'),
 (3497,'Nonlinear interpolation of multivariable functions by the Monte Carlo method'),
 (3498,'Optimization of memory hierarchies in multiprogrammed systems'),
 (3499,'Nonlinear regression with linear constraints'),
 (3500,'Parsing of graph-representable pictures'),
 (3501,'The use of information in sorting'),
 (3502,'Samplesort: a sampling approach to minimal storage tree sorting'),
 (3503,'Tree structures for optimal searching'),
 (3504,'Controllability of nonlinear sequential networks'),
 (3505,'A linear format for resolution with merging'),
 (3506,'Interpolation theorems for resolution in lower predicate calculus'),
 (3507,'Legality and other properties of graph models of computations'),
 (3508,'Formalization of properties of functional programs'),
 (3509,'An analysis of some graph theoretical cluster techniques'),
 (3510,'A new method of interpolation and smooth curve fitting'),
 (3511,'Computer interval arithmetic: definition and proof of correct implementation'),
 (3512,'Pseudo Runge-Kutta methods of the fifth order'),
 (3513,'A method for solving large matrix equations'),
 (3514,'Accumulation of round-off error in Fast Fourier Transforms'),
 (3515,'Efficiency of a procedure for near-minimax approximation'),
 (3516,'Error bounds for zeros of a polynomial based upon Gerschgorin\"s theorems'),
 (3517,'Necessary and sufficient conditions'),
 (3518,'Statistical properties of the buddy system'),
 (3519,'The unit proof and the input proof in theorem proving'),
 (3520,'On the efficiency of algorithms'),
 (3521,'The generation of optimal code for arithmetic expressions'),
 (3522,'The equivalence problem of simple programs'),
 (3523,'Some thoughts on scientific information dissemination'),
 (3524,'Characterizations of pushdown machines in terms of time-bounded computers'),
 (3525,'An augmented content-addressed memory array'),
 (3526,'Optimal sequential partitions of graphs'),
 (3527,'Linear L1 approximation for a discrete point set'),
 (3528,'A mean square estimate of the generated round off error'),
 (3529,'Topological problems arising when solving boundary value problems'),
 (3530,'A graphical search for stiffly stable methods'),
 (3531,'Principles of optimal page replacement'),
 (3532,'Effects of constrained information on player decisions'),
 (3533,'The boundary count of digital pictures'),
 (3534,'An operator which locates edges in digitized pictures'),
 (3535,'Completeness of linear refutation for theories with equality'),
 (3536,'Some comments from a numerical analyst'),
 (3537,'A grammatical characterization of one-way nondeterministic stack languages'),
 (3538,'A mathematical method for analyzing the growth of a scientific discipline'),
 (3539,'Probability models for buffer storage allocation problems'),
 (3540,'A cyclic-queue model of system overhead in multiprogrammed computer systems'),
 (3541,'Busy period analysis of a time-sharing system'),
 (3542,'On the topological properties of quantized spaces.'),
 (3543,'On the topological properties of quantized spaces.'),
 (3544,'Some parallel thinning algorithms for digital pictures'),
 (3545,'Chow parameters in threshold logic'),
 (3546,'On effective procedures for speeding up algorithms'),
 (3547,'Deterministic pushdown store machines and real-time computation'),
 (3548,'A note on degrees of self-describing Turing machines'),
 (3549,'Simple computation-universal cellular spaces'),
 (3550,'On the optimal solutions to AND/OR series-parallel graphs'),
 (3551,'Numerical analysis of a nonlinear diffusion problem'),
 (3552,'The runs up-and-down performance'),
 (3553,'An accessing model'),
 (3554,'Analysis of remote terminal backlogs under heavy demand conditions'),
 (3555,'An estimate of the store size necessary for dynamic storage allocation'),
 (3556,'Some results concerning the reduction of binary matrices'),
 (3557,'Minimal sets of distinct literals for a logically passive functions'),
 (3558,'An overview of the theory of computational complexity'),
 (3559,'On Euclid\"s algorithm'),
 (3560,'On Euclid\"s algorithm and the theory of subresultants'),
 (3561,'The calculation of multivariate polynomial resultants'),
 (3562,'Integer arithmetic algorithms for polynomial real zero determination'),
 (3563,'Determining the equivalence of algebraic expressions by hash coding'),
 (3564,'On the problem of recognizing zero'),
 (3961,'Partitioning the period of a class of m-sequences'),
 (3962,'Control system model for critically timed resources'),
 (3963,'Characterizing the storage process and its effect'),
 (3964,'Bounds on storage for consecutive retrieval'),
 (3965,'On axiomatizing multivalued dependencies in relational databases'),
 (3966,'Security in databases: a combinatorial study'),
 (3967,'A fast selection algorithm'),
 (3968,'Speedup in parallel algorithms for adaptive quadrature'),
 (3969,'Odd-even reduction for banded linear equations'),
 (3970,'Estimating the mean of a correlated binary sequence'),
 (3971,'Optimality of the Fast Fourier transform'),
 (3972,'Time bounded random access machines with parallel processing'),
 (3973,'A complete and consistent Hoare axiomatics'),
 (3974,'Programming language constructs for which it is impossible'),
 (3975,'Minimal and optimal computations of recursive programs'),
 (3976,'An O(n log n) algorithm for rectilinear minimal spanning trees'),
 (3977,'A linear time algorithm for deciding interval graph isomorphism'),
 (3978,'Optimality properties of multiple-key hashing functions'),
 (3979,'A fast merging algorithm'),
 (3980,'A counting approach to lower bounds for selection problems'),
 (3981,'Integrals with a kernel'),
 (3982,'Convergence and complexity of Newton iteration for operator equations'),
 (3983,'On the optimum checkpoint interval'),
 (3984,'Regenerative simulation with internal controls'),
 (3985,'Data structures and correctness of programs'),
 (3986,'Data flow analysis for procedural languages'),
 (3987,'A purely homomorphic characterization of recursively enumerable sets'),
 (3988,'A practical decision procedure for arithmetic with functions symbols'),
 (3989,'Relations among complexity measures'),
 (3990,'Theorem proving by covering expressions'),
 (3991,'Two algorithms for determining volumes of convex polyhedra'),
 (3992,'An optimal algorithm for finding the kernel of a polygon'),
 (3993,'The tree-to-tree correction problem'),
 (3994,'Significant improvements to the Hwang-Lin merging algorithm'),
 (3995,'The Ford-Johnson sorting algorithm is not optimal'),
 (3996,'Search within a page'),
 (3997,'Some A-stable and L-stable methods for the numerical integration'),
 (3998,'Scaling for numerical stability in Gaussian elimination'),
 (3999,'Maximal order and order of information for numerical quadrature'),
 (4000,'Approximation algorithms for some postman problems'),
 (4001,'A comparison of multilevel break and next statements'),
 (4002,'An NP-complete number-theoretic problem'),
 (4003,'Combining dimensionality and rate of growth arguments'),
 (4004,'Linear algorithms for isomorphism of maximal outerplanar graphs'),
 (4005,'The effect of a connectivity requirement'),
 (4006,'The serializability of concurrent database updates'),
 (4007,'Performance measures for ordered lists in random-access files'),
 (4008,'Encoding data structures in trees'),
 (4009,'Applications of path compression on balanced trees'),
 (4010,'Improved trailing digits estimates'),
 (4011,'A transformed implicit Runge-Kutta method'),
 (4012,'Reducibility among floating-point graphs'),
 (4013,'An evaluation of CPU efficiency under dynamic quantum allocation'),
 (4014,'A generalized queueing discipline for product form network solutions'),
 (4015,'Flowgraphs and flow algebras'),
 (4016,'Renamings - maximal parallelism - and space-time tradeoff'),
 (4017,'On the generation of binary trees'),
 (4018,'A note on enumerating binary trees'),
 (4019,'An optimal routing algorithm for mesh-connected parallel computers'),
 (4020,'Message waiting time in a packet switching system'),
 (4021,'Polling in a loop system'),
 (4022,'Synchronization problems solvable by generalized PV systems'),
 (4023,'Consistency in hierarchical database systems'),
 (4024,'External hashing schemes for collections of data structures'),
 (4025,'Stack machines and classes of nontested macro languages'),
 (4026,'A polynomial algorithm'),
 (4027,'Space-time trade-offs in structured programming'),
 (4028,'A scheme for the automatic inference of variable types'),
 (4029,'Efficient computation of expressions with common subexpressions'),
 (4030,'Continuation-based program transformation strategies'),
 (4031,'The number of fanout-free functions with various gates'),
 (4032,'Verification decidability of Presburger array programs'),
 (4033,'New algorithms for bin packing'),
 (4034,'Reaching agreements in the presence of faults'),
 (4035,'Equality and domain closure for first-order databases'),
 (4036,'An algorithm for inferring multivalued dependencies'),
 (4037,'Can any stationary iteration using linear information'),
 (4038,'Testing deadlock-freedom of computer systems'),
 (4039,'The cycle time distribution of exponential cyclic queues'),
 (4040,'A new algorithm for preemptive scheduling of trees'),
 (4041,'Mean value analysis of closed multichain queueing networks'),
 (4042,'Queuing network models with state-dependent routing'),
 (4043,'On the correctness of semantic-syntax-directed translations'),
 (4044,'Fast decision procedures based on congruence closure'),
 (4045,'A syntactic theory of message passing'),
 (4046,'Lower bounds on information transfer in distributed computation'),
 (4047,'Go is polynomial-space hard'),
 (4048,'Reasoning about recursively defined data structures'),
 (4049,'Codes: unequal probabilities - unequal letter costs'),
 (4050,'Information bounds are weak in the shortest distance problem'),
 (4051,'A polynomial solution in the undirected two paths problem'),
 (4052,'Optimal selection of CPU speed -'),
 (4053,'A new approach to the analysis of linear probing schemes'),
 (4054,'Complex properties of grammars'),
 (4055,'Fixed point languages - equality languages -'),
 (4056,'Sharing a processor among many job classes'),
 (4057,'Flowshop scheduling with limited temporary storage'),
 (4058,'Scheduling independent tasks with due times'),
 (4059,'Constructing call-by-value continuation semantics'),
 (4060,'A note on fuzzy deduction'),
 (4061,'Two-dimensional Voronoi diagrams in the Lp-metric'),
 (4062,'An algorithm to enumerate all cutsets of a graph'),
 (4063,'Equivalences among relational expressions'),
 (4064,'The sequence equivalence problem is decidable for 0S systems'),
 (4065,'Minimum covers in the relational database model'),
 (4066,'Superdeterministic PDAs: a subcase with a decidable inclusion problem'),
 (4067,'Fast probabilistic algorithms'),
 (4068,'Database location in computer networks'),
 (4069,'Solving two-commodity transportation problems'),
 (4070,'Variations on the common subexpression problem'),
 (4071,'Operational and semantic equivalence between recursive programs'),
 (4072,'Confluent reductions: abstract properties'),
 (4073,'Computation of bilinear forms over finite fields'),
 (4074,'Parallel prefix computation'),
 (4075,'Improved bounds on the problem of time-space trade-off'),
 (4076,'An on-line edge-deletion problem'),
 (4077,'Max-min tree partitioning'),
 (4078,'Linear algorithm for data compression via string matching'),
 (4079,'Using semi-joins to solve relational queries'),
 (4080,'On databases with incomplete information'),
 (4081,'n-evaluation conjecture for multipoint iterations'),
 (4082,'Bounds on schedules for independent tasks'),
 (4083,'Sequencing tasks with exponential service times to minimize'),
 (4084,'Alternation'),
 (4085,'String matching in real time'),
 (4086,'A unified lower bound for selection and set partitioning problems'),
 (4087,'New real-time simulations of multihead tape units'),
 (4088,'On the use of transcendentals for program testing'),
 (4089,'Theorem proving via general matings'),
 (4090,'A decision procedure for the correctness of a class of programs'),
 (4091,'Complete sets of reductions for some equational theories'),
 (4092,'A note on multiple error detection'),
 (4159,'An approach to program behavior modeling and optimal memory control'),
 (4160,'Axiomatic definitions of programming languages'),
 (4161,'The pattern-of-calls expansion'),
 (4162,'The compilation of regular expressions into integrated circuits'),
 (4163,'Linear-time computability of combinatorial problems'),
 (4164,'Parallel permutation and sorting algorithms'),
 (4165,'Testing satisfaction of functional dependencies'),
 (4166,'Properties of functional-dependency families'),
 (4167,'Equivalence of relational algebra and relational calculus'),
 (4168,'A theory of safe locking policies in database systems'),
 (4169,'Inference of reversible languages'),
 (4170,'An almost-linear algorithm for two-processor scheduling'),
 (4171,'Critical path scheduling with resource and processor constraints'),
 (4172,'Preemptive scheduling with release times - deadlines - and due times'),
 (4173,'A note on product-form solution for queueing networks'),
 (4174,'Contributions to the theory of logic programming'),
 (4175,'Two-way counter machines and Diophantine equations'),
 (4176,'Some exact complexity results'),
 (4177,'On parallel computation for the knapsack problem'),
 (4178,'Distribution of packet delay and interdeparture time'),
 (4179,'Data compression via textual substitution'),
 (4180,'Horn clauses and database dependencies'),
 (4181,'On the family of generalized dependency constraints'),
 (4182,'A theorem in database concurrency control'),
 (4183,'On the relationship between the LL(1) and LR(1) grammars'),
 (4184,'Deadlock avoidance revisited'),
 (4185,'Semaphore primitives and starvation-free mutual exclusion'),
 (4186,'A unversal interconnection pattern for parallel computers'),
 (4187,'Asymptotically tight bounds on time-space trade-offs in a pebble game'),
 (4188,'Basic digit sets for radix representation'),
 (4189,'The power of pluralism for automatic program synthesis'),
 (4190,'The equivalence problem'),
 (4191,'Search algorithms under different kinds of heuristics'),
 (4192,'Bidirectional heuristic search again'),
 (4193,'A note on \"A note on multiple error detection'),
 (4194,'Locking expressions for increased database concurrency'),
 (4195,'Locking primitives in a database system'),
 (4196,'Implicit data structures for the dictionary problem'),
 (4197,'A supernormal-form theorem for context-free grammars'),
 (4198,'Solving linear algebraic equations on an MIMD computer'),
 (4199,'Formulations and algorithms'),
 (4200,'Polynomial-time aggregation of integer programming problems'),
 (4201,'The time for a round trip in a cycle of exponential queues'),
 (4202,'The expressiveness of simple and second-order type structures'),
 (4203,'Vector execution of flow graphs'),
 (4204,'Formal justification of a proof system'),
 (4205,'Probabilistic algorithms'),
 (4206,'Analysis of the search performance of coalesced hashing'),
 (4207,'The complexity of LALR(k) testing'),
 (4208,'Computable error bounds for aggregated Markov chains'),
 (4209,'A characterization of product-form queueing networks'),
 (4210,'Decentralized simulation of resource managers'),
 (4211,'On communicating finite-state machines'),
 (4212,'Abstract implementations and their correctness proofs'),
 (4213,'An efficient general-purpose parallel computer'),
 (4214,'Optimal search on some game trees'),
 (4215,'Three-dimensional VLSI: a case study'),
 (4216,'Smallest-last ordering and clustering and graph coloring algorithms'),
 (4217,'The relative neighbourhood graph -'),
 (4218,'Efficiency of synchronous versus asynchronous distributed systems'),
 (4219,'Instruction sets for evaluating arithmetic expressions'),
 (4220,'On the desirability of acyclic database schemes'),
 (4221,'Degrees of acyclicity for hypergraphs and relational database schemes'),
 (4222,'Parametric combinatorial computing'),
 (4223,'Robustness of queueing network formulas'),
 (4224,'Properties of a notation for combining functions'),
 (4225,'Effective axiomatizations of Hoare logics'),
 (4226,'The complexity of solving polynomial equations by quadrature'),
 (4227,'On the simplification and equivalence problems'),
 (4228,'Time-space trade-offs for some algebraic problems'),
 (4229,'The weak Byzantine generals problem'),
 (4230,'Refining nondeterminism in relativizations of complexity classes'),
 (4231,'Decision quality as a function of search depth on game trees'),
 (4232,'Cost trade-offs in graph embedding - with applications'),
 (4233,'Improving the performance guarantee for approximate graph coloring'),
 (4234,'Design of minimum-cost deadlock-free systems'),
 (4235,'Graph algorithms for functional dependency manipulation'),
 (4236,'Syntactic characterization of tree database schemas'),
 (4237,'Locking protocols: from exclusive to shared locks'),
 (4238,'Analysis of uniform hashing'),
 (4239,'An iteration theorem for simple precedence languages'),
 (4240,'The proof of a folk theorem on queuing delay'),
 (4241,'Applying parallel computation algorithms'),
 (4242,'Deciding combinations of theories'),
 (4243,'Bounding fan-out in logical networks'),
 (4244,'Some Hamilton paths and a minimal change algorithm'),
 (4245,'On the structure of Armstrong relations for functional dependencies'),
 (4246,'On compiling queries in recursive first-order databases'),
 (4247,'Optimal flow control of an M/M/m queue'),
 (4248,'A fast algorithm for the two-variable integer programming problem'),
 (4249,'Linear programming in linear time when the dimension is fixed'),
 (4250,'The product form for sojourn time distributions'),
 (4251,'Priority queues with feedback'),
 (4252,'Information transfer in distributed computing'),
 (4253,'Random trees and the analysis of branch and bound procedures'),
 (4254,'Complexity results for permuting data'),
 (4255,'Finitely specifiable implicational dependency families'),
 (4256,'Serializability by locking'),
 (4257,'Worst-case analysis of set union algorithms'),
 (4258,'The omega-sequence equivalence problem for D0L systems is decidable'),
 (4259,'Terminating Turing machine computations and the complexity and/or'),
 (4260,'Beyond floating point'),
 (4261,'Lower bounds and fast algorithms for secure acceleration'),
 (4262,'The three-machine no-wait flow shop is NP-complete'),
 (4263,'Asymptotic expansions and integral representations'),
 (4264,'Some combinatorial game problems require OMEGA(n^k) time'),
 (4265,'The VLSI complexity of selected graph problems'),
 (4266,'On the complexity of unique solutions'),
 (4267,'Symmetric complementation'),
 (4268,'Space-time trade-offs for banded matrix problems'),
 (4269,'A mechanical proof of the unsolvability of the halting problem'),
 (4270,'Solving NP-hard problems on graphs that are almost trees'),
 (4271,'An end-to-end approach to the resequencing problem'),
 (4272,'Synthesis of a class of deadlock-free Petri nets'),
 (4273,'Efficient schemes for parallel communication'),
 (4274,'The format model: a theory of database organization'),
 (4275,'Storing a sparse table with O(1) worst case access time'),
 (4276,'On the optimal solution of large linear systems'),
 (4277,'A theory of communicating sequential processes'),
 (4278,'A formal method for the abstract specification of software'),
 (4279,'Analysis of interleaved storage via a constant-service queuing system'),
 (4280,'Graph problems on a mesh-connected processor array'),
 (4281,'A polynomial linear search algorithm'),
 (4282,'Depth-first search and Kuratowski subgraphs'),
 (4283,'Configuration of VLSI arrays in the presence of defects'),
 (4284,'A proof procedure for data dependencies'),
 (4285,'Updates of relational views'),
 (4286,'Incomplete information in relational databases'),
 (4287,'Optimal asynchronous Newton method'),
 (4288,'Bounds for the positive eigenvectors of nonnegative matrices'),
 (4289,'Optimum head separation in a disk system with two read/write heads'),
 (4290,'Numerical computation of sojourn-time distributions'),
 (4093,'Optimal design of linear storage hierarchies'),
 (4094,'Expected length of the longest probe sequence in hash code searching'),
 (4095,'Summation in finite terms'),
 (4096,'Measurement bias in feedback queues'),
 (4097,'The distribution of queuing network states'),
 (4098,'Derivation of logic programs'),
 (4099,'The closure statement: a programming language construct'),
 (4100,'Complexity of partial satisfaction'),
 (4101,'A unification algorithm for associative-commutative functions'),
 (4102,'An equivalence between relational database dependencies'),
 (4103,'Optimal time minimal space selection algorithms'),
 (4104,'On J-maximal and J-minimal flow-shop schedules'),
 (4105,'On optimal scheduling algorithms for time-shared systems'),
 (4106,'Connected component labeling using quadtrees'),
 (4107,'Probabilistic aspects of boolean switching functions'),
 (4108,'The area-time complexity of binary multiplication'),
 (4109,'The complexity of the equivalence problem for simple programs'),
 (4110,'The complexity of the finite containment problem for Petri nets'),
 (4111,'A unified approach to path problems'),
 (4112,'Fast algorithms for solving path problems'),
 (4113,'Should tables be sorted ?'),
 (4114,'Mean-value analysis of closed multichain queuing networks'),
 (4115,'On matrices with connections'),
 (4116,'Deleting repeated goals in the problem reduction format'),
 (4117,'Algorithmic analysis'),
 (4118,'On the complexity of testing implications'),
 (4119,'A lower bound on the complexity of orthogonal range queries'),
 (4120,'A morphic representation of complements'),
 (4121,'A simpler construction for showing the intrinsically exponential'),
 (4122,'Algorithms for scheduling tasks on unrelated processors'),
 (4123,'Dynamic programming as graph searching: an algebraic approach'),
 (4124,'An algorithm for K best solutions of the resource allocation problem'),
 (4125,'On the complexity of integer programming'),
 (4126,'Deciding linear inequalities by computing loop residues'),
 (4127,'A lower bound to finding convex hulls'),
 (4128,'Mechanical discovery of classes of problem-solving strategies'),
 (4129,'A sufficient condition for backtrack-free search'),
 (4130,'Nonmonotonic logic II: nonmonotonic modal theories'),
 (4131,'A shifting algorithm for min-max tree partitioning'),
 (4132,'Pattern matching in trees'),
 (4133,'An almost linear-time algorithm for computing a dependency basis'),
 (4134,'Subset dependencies and a completeness result'),
 (4135,'Dense hierarchies of grammatical families'),
 (4136,'On the construction of feedback queries'),
 (4137,'Term weighting in information retrieval using the term precision model'),
 (4138,'Confluent and other types of Thue systems'),
 (4139,'Data requirements for implementation of N-process mutual exclusion'),
 (4140,'On the theory of specification - implementation - and parameterization'),
 (4141,'On the complexity of flowchart and loop program schemes'),
 (4142,'The complexity of maintaining an array and computing partial sums'),
 (4143,'Relativized questions involving probabilistic algorithms'),
 (4144,'Generation and verification of finte models and counterexamples'),
 (4145,'The complexity of restricted spanning tree problems'),
 (4146,'On database logic'),
 (4147,'On the equivalence of database models'),
 (4148,'Template dependencies: a large class of dependencies'),
 (4149,'A complete axiomatization of full join dependencies'),
 (4150,'Useless actions make a difference'),
 (4151,'A generalization of Ogden\"s lemma'),
 (4152,'Upper bounds for speedup in parallel parsing'),
 (4153,'On the decidability of grammar problems'),
 (4154,'Determination of the conditional response'),
 (4155,'Maximum rates of memory bound systems'),
 (4156,'A finite-sequence queue with different customers'),
 (4157,'Dynamic scaling and growth behavior'),
 (4158,'The performance of job classes with distinct policy functions'),
 (3829,'Shifting graphs and their applications'),
 (3830,'A fast backtracking algorithm to test directed graphs'),
 (3831,'R-domination in graphs'),
 (3832,'An analysis of binary search trees'),
 (3833,'Semi-implicit Runge-Kutta procedures with error estimates'),
 (3834,'Scheduling tasks with nonuniform deadlines on two processors'),
 (3835,'Solution of integer programs with a quadratic objective function'),
 (3836,'Linear programming computational procedures for ordinary regression'),
 (3837,'Optimal code generation for expression trees'),
 (3838,'Code generation for a one-register machine');
INSERT INTO `paper` (`PaNum`,`Title`) VALUES 
 (3839,'Transforming LR(k) grammars'),
 (3840,'Restructuring of arithmetic expressions for parallel evaluation'),
 (3841,'On the complexity of edge traversing'),
 (3842,'P-complete approximation problems'),
 (3843,'Lower bounds on merging networks'),
 (3844,'Theorem proving with lemmas'),
 (3845,'Size complexity in context-free grammar forms'),
 (3846,'Boundary and object detection in real world images'),
 (3847,'Mathematical techniques for efficient record segmentation'),
 (3848,'Accelerated iterative methods for the solution'),
 (3849,'Sequencing jobs with stochastic task structures on a single machine'),
 (3850,'Open shop scheduling to minimize finishing time'),
 (3851,'Multilevel queues with external priorities'),
 (3852,'Verifying program performance'),
 (3853,'Enumeration of fanout-free boolean functions'),
 (3854,'A combinatorial problem which is complete in polynomial space'),
 (3855,'Space and time hierarchies for classes'),
 (3856,'The semantics of predicate logic as a programming language'),
 (3857,'Efficient algorithms for shortest paths in sparse networks'),
 (3858,'A general model for the performance of disk systems'),
 (3859,'A level algorithm for preemptive scheduling'),
 (3860,'A transformation system for developing recursive programs'),
 (3861,'Initial algebra semantics and continuous algebras'),
 (3862,'An algorithm for structuring flowgraphs'),
 (3863,'Program improvement by source-to-source transformation'),
 (3864,'Code generation for expressions with common subexpressions'),
 (3865,'A methodology for Lisp program construction from examples'),
 (3866,'An improved bidirectional heuristic search algorithm'),
 (3867,'Covering the points of a digraph with point-disjoint paths'),
 (3868,'Hashing schemes for extendible arrays'),
 (3869,'A queueing model of multiprogrammed computer systems'),
 (3870,'On certain output-buffer management techniques - a stochastic model'),
 (3871,'Product form and local balance in queueing networks'),
 (3872,'The power of dominance relations in branch-and-bound algorithms'),
 (3873,'Heuristic algorithms for scheduling independent tasks'),
 (3874,'Information content of programs and operation encoding'),
 (3875,'Proof - completeness - transcendentals - and sampling'),
 (3876,'Algebras having linear multiplicative complexities'),
 (3877,'On time versus space'),
 (3878,'Even simple programs are hard to analyze'),
 (3879,'Automatic proofs of theorems in analysis using nonstandard techniques'),
 (3880,'Stability and optimal control'),
 (3881,'On equivalence and containment problems for formal languages'),
 (3882,'Local feedback in full-text retrieval systems'),
 (3883,'Operations research applied'),
 (3884,'The complexity of trie index construction'),
 (3885,'Optimal batched searching of tree structured files'),
 (3886,'A linear time algorithm for deciding subject security'),
 (3887,'Development of a parametric generating procedure'),
 (3888,'On live-dead analysis for global data flow problems'),
 (3889,'Semantics of the domain of flow diagrams'),
 (3890,'Complexity of synthesizing inductive assertions'),
 (3891,'The complexity of parallel evaluation of linear recurrences'),
 (3892,'Word problems solvable in logspace'),
 (3893,'On the SUP-INF method for proving Presburger formulas'),
 (3894,'A study of schedules as models of synchronous parallel computation'),
 (3895,'Queueing models for computer systems'),
 (3896,'Log space recognition and translation of parenthesis languages'),
 (3897,'Big buckets are (are not) better !'),
 (3898,'Analysis of effectiveness of retrieval in clustered files'),
 (3899,'Errata and comments on a paper by J.R. Cash'),
 (3900,'On solving Fredholm integral equations of the first kind'),
 (3901,'Flow switching approach to the maximum flow problem: I'),
 (3902,'Capacity bounds for multiresource queues'),
 (3903,'Algorithms for the longest common subsequence problem'),
 (3904,'A machine representation of finite T0 topologies'),
 (3905,'Optimization among provably equivalent programs'),
 (3906,'Finding two disjoint paths between two pairs of vertices in a graph'),
 (3907,'Renaming and economy of memory in program schemata'),
 (3908,'Simple representations of certain classes of languages'),
 (3909,'Lower bounds and reductions between grammar problems'),
 (3910,'KEDMA - linguistic tools for retrieval systems'),
 (3911,'Foundations of probabilistic and utility-theoretic indexing'),
 (3912,'On stable parallel linear system solvers'),
 (3913,'Preemptive scheduling of uniform processor systems'),
 (3914,'A linear-time on-line recognition algorithm for \"Palstar\"'),
 (3915,'Some complexity results for matrix computations'),
 (3916,'Reversal-bounded multicounter machines and their decision problems'),
 (3917,'Renaming a set of clauses as a Horn set'),
 (3918,'Satisfiability is quasilinear complete in NQL'),
 (3919,'Separating nondeterministic time complexity classes'),
 (3920,'A new incompleteness result for Hoare\"s system'),
 (3921,'Stable sorting in asymptotically optimal time and extra space'),
 (3922,'Optimal arrangement of keys in a hash table'),
 (3923,'Effective automatic indexing using term addition and deletion'),
 (3924,'Asynchronous iterative methods for multiprocessors'),
 (3925,'All algebraic functions can be computed fast'),
 (3926,'An example of a skweing function'),
 (3927,'Pivot strategies for primal-simplex network codes'),
 (3928,'On the efficiency of a polynomial irreducibility test'),
 (3929,'Analysis and applications of the delay cycle'),
 (3930,'A direct descent binary knapsack algorithm'),
 (3931,'The complexity of finite memory programs with recursion'),
 (3932,'The complexity of some problems on subsequences and supersequences'),
 (3933,'k+1 heads are better than k'),
 (3934,'Another generalization of resolution'),
 (3935,'Properties of conflict-free and persistent Petri nets'),
 (3936,'An algorithm to design the memory configuration of a computer network'),
 (3937,'Performance analysis of cache memories'),
 (3938,'Generation of binary trees from ballot sequences'),
 (3939,'On the tape complexity of deterministic context-free languages'),
 (3940,'A global bisection algorithm for computing the zeros of polynomials'),
 (3941,'Dynamic placement of records in linear storage'),
 (3942,'The bottleneck traveling salesman problem'),
 (3943,'Regenerative simulation of response times in networks of queues'),
 (3944,'Some properties of predicate transformers'),
 (3945,'Analysis and design of fanout-free networks'),
 (3946,'\"Strong\" NP-completeness results'),
 (3947,'A time-space trade-off'),
 (3948,'Some matching problems for bipartite graphs'),
 (3949,'Self-organizing search trees'),
 (3950,'On the average number of maxima in a set of vectros and applications'),
 (3951,'The analysis of hashing techniques that exhibit k-ary clustering'),
 (3952,'Lower bounds for selection in X+Y and other multisets'),
 (3953,'Noncounting context-free languages'),
 (3954,'Fast algorithms for manipulating formal power series'),
 (3955,'Two-commodity flow'),
 (3956,'On preemptive scheduling of unrelated parallel processors'),
 (3957,'Exact aggregation in exponential queueing networks'),
 (3958,'Path calculus in program verification'),
 (3959,'Assigment commands with array references'),
 (3960,'Conditional expressions with equality tests'),
 (4555,'Factorizing words over an ordered alphabet'),
 (4556,'The NP-completeness column: an ongoing guide'),
 (4557,'Bounds for naive multiple machine scheduling with release times and deadlines'),
 (4558,'Direct-chaining with coalescing lists'),
 (4559,'Fast algorithms for generating all maximal independent sets'),
 (4560,'Analysis of hashing with chaining in the prime area'),
 (4561,'Scheduling precedence graphs of bounded height'),
 (4562,'An O(N^2) algorithm for colouring perfect planar graphs'),
 (4563,'Optimal binary split trees'),
 (4564,'Efficient algorithms for a family of matroid intersection problems'),
 (4565,'A personnel assignment problem'),
 (4566,'The NP-completeness column: an ongoing guide'),
 (4567,'Heuristic matching for graph satisfying the triangle equality'),
 (4568,'Finding the number of factors of a polynomial'),
 (4569,'A linear algorithm for nonhomopgeneous spectra of numbers'),
 (4570,'Optimal algorithms to compute the closure of a set of iso-rectangles'),
 (4571,'Characterizations of totally balanced matrices'),
 (4572,'On two geometric problems related to trhe traveling salesman problem'),
 (4573,'Generating random regular graphs'),
 (4574,'An efficient algorithm for generating all k-subsets (1 <= k <= m <= n)'),
 (4575,'The NP-completeness column: an ongoing guide'),
 (4576,'An optimal contour algorithm for iso-oriented rectangles'),
 (4577,'On symmetric algorithms for bilinear forms over finite fields'),
 (4578,'A non-factorial algorithm for canonical numbering of a graph'),
 (4579,'Short monotone formulae for the majority function'),
 (4580,'Optimum split trees'),
 (4581,'Gauss codes - planar Hamiltonian graphs - and stack-sortable permutations'),
 (4582,'A separator theorem for graphs of bounded genus'),
 (4583,'On the solution of inequality systems relevant to IC-layout'),
 (4584,'An O(n log n) algorithm for finding all repetitions in a string'),
 (4585,'The NP-completeness column: an ongoing guide'),
 (4586,'The analysis of linear probing sort'),
 (4587,'Multiplying Schur functions'),
 (4588,'Sequential and distributed graph coloring algorithms'),
 (4589,'On a dual version of the one-dimensional bin packing problem'),
 (4590,'An adaptive algorithm for system level diagnosis'),
 (4591,'Improved dynamic programming algorithms for bandwidth minimization'),
 (4592,'A probabilistic analysis of the next-fit bin packing algorithm'),
 (4593,'New algorithms for selection'),
 (4594,'The NP-completeness column: an ongoing guide'),
 (4595,'The expected length of the longest probe sequence for bucket searching'),
 (4596,'NP-completeness for minimizing maximum edge length in grid embeddings'),
 (4597,'Finding the convex hull facet by facet'),
 (4598,'A new proof for the first-fit decreasing bin-packing algorithm'),
 (4599,'On the complexity of some algorithms of matrix multiplication'),
 (4600,'Searching ordered structures'),
 (4601,'A \"retraction\" method for planning th emotion of a disc'),
 (4602,'An algorithmic proof of Tutte\"s f-factor theorem'),
 (4603,'Finding approximate patterns in strings'),
 (4604,'Two levels are as good as any'),
 (4605,'The NP-completeness column: an ongoing guide'),
 (4606,'Dynamic Huffman coding'),
 (4607,'An analysis of optimum caching'),
 (4608,'Pyramid computer solutions of the closest pair problem'),
 (4609,'Computing the extreme distances between two convex polygons'),
 (4610,'Binary tree Gray codes'),
 (4611,'Constructing trees with prescribed cardinalities'),
 (4612,'On optimal arrangements of keys with double hashing'),
 (4613,'An optimal algorithm for finding all the humps of a monotone step-function'),
 (4614,'A theoretical analysis of backtracking in the graph coloring problem'),
 (4615,'The NP-completeness column: an ongoing guide'),
 (4616,'Domination in permutation graphs'),
 (4617,'Hash table reorganization'),
 (4618,'The analysis of a fringe heuristic for binary search trees'),
 (4619,'The complexity of the generalised cyclic towers of Hanoi problem'),
 (4620,'On the complexity of calculating factorials'),
 (4621,'A linear algorithm for determining the separation of convex polyhedra'),
 (4622,'Lower bounds for combinatorial problems on graphs'),
 (4623,'A theorem on the expected complexity of Dijkstra\"s shortest path algorithm'),
 (4624,'Scheduling transmissions in a network'),
 (4625,'Partitioning with two lines in the plane'),
 (4626,'The NP-completeness column: an ongoing guide'),
 (4627,'Efficient uses of the past'),
 (4628,'Repeated random insertion into a priority queue'),
 (4629,'Polynomial-time algorithms for finding elements of prime order'),
 (4630,'Batched dynamic solutions to decomposable searching problems'),
 (4631,'The complexity of Dehn\"s algorithm for word problems in groups'),
 (4632,'Weighted heuristic search in networks'),
 (4633,'An efficient algorithm for the \"stable roommates\" problem'),
 (4634,'The optimal representation of disjoint iso-oriented rectrangles'),
 (4635,'Evaluation of a MULTIFIT-based scheduling algorithm'),
 (4636,'A compact representation for permutation groups'),
 (4637,'An efficient parallel algorithm for shifting'),
 (4638,'An algorithmic characterization of total digraphs'),
 (4639,'On the complexity of circulations'),
 (4640,'An algorithm for early unlocking of entities in database transactions'),
 (4641,'A new upper bound for shellsort'),
 (4642,'Planar 3DM is NP-complete'),
 (4643,'Depth-size trade-offs for parallel prefix computation'),
 (4644,'Searching and storing similar lists'),
 (4645,'Polygon triangulation: efficiency and minimality'),
 (4646,'Single bend wiring'),
 (4647,'An optimal algorithm for finding minimal enclosing triangles'),
 (4648,'Conway\"s parallel sorting algorithm'),
 (4649,'Bipartite graph matching for points on a line or a cicrle'),
 (4650,'Computing the convex hull of line intersections'),
 (4651,'The NP-completeness column: an ongoing guide'),
 (4652,'Graph minors II: algorithmic aspects of tree-widths'),
 (4653,'An algorithmic proof'),
 (4654,'An algorithm for constructing m-ary de Bruijn sequences'),
 (4655,'Optimal expected-time algorithms for merging'),
 (4656,'An O(n log n) randomizing algorithm'),
 (4657,'Fast computation of the modality of polygons'),
 (4658,'Finding short cycles in planar graphs using separators'),
 (4659,'On deletion in threaded binary trees'),
 (4660,'Faster construction of optimal split trees'),
 (4661,'Algorithms for maximum independent sets'),
 (4662,'Point retrieval for polygons'),
 (4663,'On the number of queries necessary to identify a permutation'),
 (4664,'The complexity of generating an exponentially distributed variable'),
 (4665,'A stochastic analysis of the NFD bin-packing algorithm'),
 (4666,'Routing through a generalized switchbox'),
 (4667,'Polygon containment under translation'),
 (4668,'Generalized Steiner problem in series-parallel networks'),
 (4669,'A fast and simple randomized parallel algorithm'),
 (4670,'The NP-completeness column: an ongoing guide'),
 (4671,'Dynamic orthogonal segment intersection search'),
 (4672,'Shape from probing'),
 (4673,'Efficient parallel algorithms for edge coloring problems'),
 (4674,'A lower bound for probabilistic distributed algorithms'),
 (4675,'Convex hulls of piecewise-smooth Jordan curves'),
 (4676,'Searching in 2-dimensional partial orders'),
 (4677,'O(n^2.5) time algorithms for the subgraph homeomorphism problem on trees'),
 (4678,'An improved block-interchange algorithm'),
 (4679,'The 1-Steiner tree problem'),
 (4680,'A non-inductive GL(n -Z) algorithm that constructs integral linear relations'),
 (4681,'Optimal multiway split trees'),
 (4682,'An optimal algorithm for geometrical congruence'),
 (4683,'Computing pi(x): an analytic method'),
 (4684,'An efficient and simple motion planning algorithm'),
 (4685,'Linear-time computation of optimal subgraphs of decomposable graphs'),
 (4686,'Linear probing: the probable largest search time'),
 (4687,'Multiple optima in local search'),
 (4688,'Efficient algorithms for finding maximum spanning forests'),
 (4689,'The NP-completeness column: an ongoing guide'),
 (4690,'Fast approximation algorithms for a nonconvex covering problem'),
 (4691,'Computational complexities of Diophantine equations with parameters'),
 (4692,'Better expanders and superconcentrators'),
 (4693,'Space searching for intersecting objects'),
 (4694,'Finding critical sets'),
 (4695,'On the routability of a convex grid'),
 (4696,'Problems complete for deterministic logarithmic space'),
 (4697,'Universal traversal sequences for paths and cycles'),
 (4698,'A heuristic triangulation algorithm'),
 (4699,'The NP-completeness column: an ongoing guide'),
 (4700,'How much is that DAWG in the window ?'),
 (4701,'Coloring planar graphs in parallel'),
 (4702,'On bipartite matchings of minimum density'),
 (4703,'The rotation graph of binary trees is Hamiltonian'),
 (4704,'The virtues of locking by symbolic names'),
 (4705,'Simplified stable merging tasks'),
 (4706,'Improved constants for some separator theorems'),
 (4707,'A subquadratic algorithm for constructing'),
 (4708,'Generating the maximum spanning trees of a weighted graph'),
 (4709,'Polynomial-time versions of Sylow\"s theorem'),
 (4710,'An O(n^2) shortest path algorithm for a non-rotating convex body'),
 (4711,'A more efficient algorithm for lattice basis reduction'),
 (4712,'Almost all k-colrable graphs are easy to color'),
 (4713,'A fast parallel algorithm to color a graph with delta colors'),
 (4714,'Binary tree algebraic computation and parallel algorithms for simple graphs'),
 (4715,'A mixed-integer linear programming problem which is efficiently solvable'),
 (4716,'A new proof of the Garsia-Wachs algorithm'),
 (4717,'An algorithm for polynomial multiplication'),
 (4718,'Improved algorithms for discs and balls using power diagrams'),
 (4719,'Adjacent interchange generation of combinations'),
 (4720,'An algorithm for finding Hamilton cycles in random directed graphs'),
 (4721,'Fast parallel strong orientation of mixed graphs'),
 (4722,'Some results on V-ary asymmetric trees'),
 (4723,'Construction of optimal binary split trees'),
 (4724,'Efficient data structures for range searching on a grid'),
 (4725,'Fast parallel algorithms'),
 (4726,'On a special case of uniform processor scheduling'),
 (4727,'An overview of automated reasoning and related fields'),
 (4728,'Applications of the theory of Bradford\"s law'),
 (4729,'Does order of presentation affect users judgment of documents?'),
 (4730,'A mathematical model of retrieval system performance'),
 (4731,'Book availability as a performance measure of a library'),
 (4732,'A signature file scheme based on multiple organizations'),
 (4733,'Citation analysis of the literature of systematic botany'),
 (4734,'Bracketed context-free languages'),
 (4735,'Linear positive machines'),
 (4736,'Chebyshev solution of large linear systems'),
 (4737,'A parametric method for solving'),
 (4738,'Methods of the algebraic theory of machines'),
 (4739,'Stationary points of functionals in pre-Hilbert spaces'),
 (4740,'Foundations of the state-space theory of continuous systems I'),
 (4741,'Algebraic principles for the analysis of a biochemical system'),
 (4742,'On some properties of the free monoids'),
 (4743,'Homomorphic images of linear sequential machines'),
 (4744,'Nonerasing stack automata'),
 (4745,'Some definitional suggestions for automata theory'),
 (4746,'Generalized upper bounding techniques'),
 (4747,'Solutions of generalized optimization problems'),
 (4748,'First-order necessary conditions'),
 (4749,'A decomposition method for structured quadratic programming problems'),
 (4750,'A solution to the optimal pursuit problem'),
 (4751,'Distribution of attained service in time-shared systems'),
 (4752,'Multitape finite automata with rewind instructions'),
 (4753,'Characterizing derivation trees of context-free grammars'),
 (4754,'On infinite-dimensional convex programs'),
 (4755,'Affine dynamical systems'),
 (4756,'Global theory of the Riccati equation'),
 (4757,'The computation of eigenvalues and eigenvectors'),
 (4758,'Fuzzy star functions - probabilistic automata -'),
 (4759,'State estimation for infinite-dimensional systems'),
 (4760,'Deterministic stack automata and the quotient operator'),
 (4761,'Bounded action machines'),
 (4762,'On the equivalence between'),
 (4763,'Multitape one-way nonwriting automata'),
 (4764,'A new computing technique in system identification'),
 (4765,'Tape-reversal bounded Turing machine computations'),
 (4766,'The reduction of tape reversals for off-line one-tape Turing machines'),
 (4767,'Closures which preserve finiteness in families of languages'),
 (4768,'On the nonexistence of'),
 (4769,'Newton\"s method and boundary value problems'),
 (4770,'Further results on generalized predictor-corrector methods'),
 (4771,'Frequency of decomposability'),
 (4772,'Derivation-bounded languages'),
 (4773,'Extensions of synchronous circuits and the delay problem'),
 (4774,'On the geometry of optimal strategies in two-person games of kind'),
 (4775,'A note on decision rules for stochastic programs'),
 (4776,'Probabilistic aspects of machine decomposition theory'),
 (4777,'Multiparametric eigenvalue problems in inner-product spaces'),
 (4778,'Algorithms for some minimax problems'),
 (4779,'Infinite linear sequential machines'),
 (4780,'On the multiplying ability of two-way automata'),
 (4781,'Structural equivalence of context-free grammars'),
 (4782,'On a characterization of the nonregular set of primes'),
 (4783,'On the convergence of nonlinear simultaneous displacements'),
 (4784,'Combinatorial equivalence of (0'),
 (4785,'Optimal control for a class of distributed parameter systems'),
 (4786,'Syntax directed translations and the pushdown assembler'),
 (4787,'A general theory of extremals'),
 (4788,'Time-varying linear sequential machines I'),
 (4789,'The correctness of programs'),
 (4790,'Convergence with Hilbert\"s space filling curve'),
 (4791,'Parallel program schemata'),
 (4792,'Checking automata and one-way stack languages'),
 (4793,'Cubature and Tchakaloff cone'),
 (4794,'Every semilinear set is a finite union of disjoint linear sets'),
 (4795,'Scattered context grammars'),
 (4796,'Towards a theory of semantics and compilers for programming languages'),
 (4797,'Writing pushdown acceptors'),
 (4798,'Properties of syntax directed translations'),
 (4799,'A decomposition method for structured linear and nonlinear programs'),
 (4800,'Regular expressions and the equivalence of programs'),
 (4801,'Elementary indefinite integration theory for the computer'),
 (4802,'Some considerations on fuzzy automata'),
 (4803,'Referenced automata and metaregular families'),
 (4804,'The primitive recursive analysis of ordinary differential equations'),
 (4805,'A generator of context-sensitive languages'),
 (4806,'Depth-bounded computation'),
 (4807,'Newton\"s method under mild differentiability conditions'),
 (4808,'Nonlinear optimal controls'),
 (4809,'A convex programming problem in Banach spaces'),
 (4810,'Time-restricted sequence generation'),
 (4811,'Some results concerning proofs of statements about programs'),
 (4812,'Some results concerning proofs of statements about programs'),
 (4813,'Generation of near-optimal universal boolean functions'),
 (4814,'Factorization of operators II'),
 (4815,'On the computational power of pushdown automata'),
 (4816,'A completeness problem for pattern generation in tessalation automata'),
 (4817,'Relationships between nondeterministic and deterministic'),
 (4818,'Abstract families of processors'),
 (4291,'Probabilistic models of database locking'),
 (4292,'Algebraic structures with hard equivalence and minimization problems'),
 (4293,'Lower bounds for distributed maximum-finding algorithms'),
 (4294,'Three approaches to heuristic search in networks'),
 (4295,'AND/OR graph heuristic search methods'),
 (4296,'Synchronizing clocks in the presence of faults'),
 (4297,'Disaggregations in databases'),
 (4298,'Memory-constrained task scheduling on a network of dual processors'),
 (4299,'Approximation schemes for covering and packing problems'),
 (4300,'Algebraic laws for nondeterminism and concurrency'),
 (4301,'Aggregation with an error of O(eps^2)'),
 (4302,'Bounds on information exchange for Byzantine agreement'),
 (4303,'Hard-core theorems for complexity classes'),
 (4304,'A tight bound for black and white pebbles on the pyramid'),
 (4305,'Solving low-density subset sum problems'),
 (4306,'Soundness and completeness of a synthesis algorithm'),
 (4307,'On the efficiency of subsumption algorithms'),
 (4308,'Feedback vertex sets and cyclically reducible graphs'),
 (4309,'Beyond two-phase locking'),
 (4310,'Algorithms for resolving conflicts in dynamic storage allocation'),
 (4311,'Parallel algorithms for data compression'),
 (4312,'Impossibility of distributed consensus with one faulty process'),
 (4313,'The travelling salesman problem in graphs with 3-edge cutsets'),
 (4314,'A fixpoint semantics for nondeterministic data flow'),
 (4315,'Optimal static load balancing in distributed computer systems'),
 (4316,'Decidable problems for powerful programs'),
 (4317,'A complexity theory based on Boolean algebra'),
 (4318,'Generalized best-first search strategies and the optimality of A*'),
 (4319,'Enumeration of structured flowcharts'),
 (4320,'Optimal attack and reinforcement of a network'),
 (4321,'A simple on-line bin-packing algorithm'),
 (4322,'A model of computation for VLSI with related complexity results'),
 (4323,'A lower bound on the time needed in the worst case'),
 (4324,'Adding range restriction capability to dynamic data structures'),
 (4325,'A mean value performance model for locking in databases'),
 (4326,'Self-adjusting binary search trees'),
 (4327,'Uniform hashing is optimal'),
 (4328,'Generating binary trees using rotations'),
 (4329,'Iterative aggregation/disaggregation techniques'),
 (4330,'The complexity of problems'),
 (4331,'The complexity of propositional linear temporal logics'),
 (4332,'A sufficient condition for backtrack-bounded search'),
 (4333,'A fast parallel algorithm for the maximal independent set problem'),
 (4334,'Closures of database hypergraphs'),
 (4335,'Complexity of network synchronization'),
 (4336,'Asynchronous consensus and broadcast protocols'),
 (4337,'How to assign votes in a distributed system'),
 (4338,'On ordered languages and the optimization of linear functions'),
 (4339,'A simplex algorithm whose average number of steps'),
 (4340,'Acceptance trees'),
 (4341,'Lower bounds for solving linear Diophantine equations'),
 (4342,'Applications of Ramsey\"s theorem to decision tree complexity'),
 (4343,'A polynomial algorithm for the min-cut linear arrangement of trees'),
 (4344,'Special relations in automated deduction'),
 (4345,'Routing through a rectangle'),
 (4346,'An application of number theory'),
 (4347,'Notions of dependency satisfaction'),
 (4348,'A chaotic asynchronous algorithm for computing'),
 (4349,'\"Sometimes\" and \"not never\" revisited'),
 (4350,'Bound hierarchies for multiple-class queueing networks'),
 (4351,'A matrix-algebraic solution to two Km servers in a loop'),
 (4352,'Effective transformations on infinite trees -'),
 (4353,'Equality-based binary resolution'),
 (4354,'Partitioning a polygonal region into trapezoids'),
 (4355,'The mutual exclusion problem: part I - a theory of interprocess communication'),
 (4356,'The mutual exclusion problem: part II - statement and solutions'),
 (4357,'A sound and sometimes complete query evaluation algorithm'),
 (4358,'Partial match retrieval of multidimensional data'),
 (4359,'Tuple sequences and lexicographic indexes'),
 (4360,'Elimination of intersection anomalies from database schemes'),
 (4361,'Security problems on inference controls for SUM - MAX - and MIN queries'),
 (4362,'Sort sets in the relational model'),
 (4363,'A note on the height of binary search trees'),
 (4364,'Reaching approximate agreement in the presence of faults'),
 (4365,'Predicting fill for sparse orthogonal factorization'),
 (4366,'A unified approach to approximation algorithms'),
 (4367,'Improved methods for storing and updating information'),
 (4368,'Asymptotic expansions for closed Markovian networks'),
 (4369,'The performance of a precedence-based queueing discipline'),
 (4370,'The polynomial-time hierarchy and sparse oracles'),
 (4371,'Relativizing complexity classes with sparse oracles'),
 (4372,'Subproblem finder and instance checker -'),
 (4373,'The ocmbinatorics of local constraints'),
 (4374,'On driving many long wires in a VLSI layout'),
 (4375,'Approximating grammar probabiolities: solution of a conjecture'),
 (4376,'Initializing generalized feedback shift register'),
 (4377,'Complexity of parallel QR factorization'),
 (4378,'Countable nondeterminism and random assignment'),
 (4379,'RECAL - a new efficient algorithm'),
 (4380,'How to construct random functions'),
 (4381,'Polynomial-time algorithm for the orbit problem'),
 (4382,'Small sample algorithms for the identification of plynomials'),
 (4383,'Intersection of convex objects in two and three dimensions'),
 (4384,'Dynamic functional dependencies and database aging'),
 (4385,'Logarithmic time sort for linear size networks'),
 (4386,'On the minimal synchronism needed for distributed consensus'),
 (4387,'Electing a leader in a synchronous ring'),
 (4388,'How to share memory in a distributed system'),
 (4389,'On the Church-Rosser property for the direct sum of term rewriting systems'),
 (4390,'Using dual approximation algorithms for scheduling problems'),
 (4391,'Simultaneous writes of parallel random access machines'),
 (4392,'Analysis of a composite performance reliability mesure'),
 (4393,'Slowing down sorting networks to obtain faster sorting algorithms'),
 (4394,'Hard examples for resolution'),
 (4395,'Inference with path resolution and semantic graphs'),
 (4396,'Recognizing planar perfect graphs'),
 (4397,'Estimating the multiplicities of conflicts to speed their resolution'),
 (4398,'Optimal reconfiguration strategy'),
 (4399,'Answering queries on embedded-complete database schemes'),
 (4400,'Associative table lookup processing for multioperand residue arithmetic'),
 (4401,'Linear probing with a nonuniform address distribution'),
 (4402,'A model for distributed systems based on graph rewriting'),
 (4403,'Concurrent dynamic logic'),
 (4404,'Minimal degrees for polynomial reducibilities'),
 (4405,'Decidability of the purely existential fragment'),
 (4406,'An O(n^3 log n) deterministic and an O(n^3) Las Vegas'),
 (4407,'An efficient algorithm for the \"optimal\" stable marriage'),
 (4408,'A theory of intersection anomalies in relational database schemes'),
 (4409,'Complete inverted files for efficient text retrieval and analysis'),
 (4410,'Fibonacci heaps and their uses in improved network optimization algorithms'),
 (4411,'New applications of failure functions'),
 (4412,'Optimal clock synchronization'),
 (4413,'Systems of linear equations with dense univariate polunomial coefficients'),
 (4414,'Stochastic catastrophe theory in computer performance modeling'),
 (4415,'Infinitesimal perturbation analysis for general discrete event systems'),
 (4416,'The existence and density of generalized complexity cores'),
 (4417,'The equivalence problem for real-time DPDAs'),
 (4418,'Convexity algorithms in parallel computers'),
 (4419,'Randomized parallel communications on an extension of the omega network'),
 (4420,'Design and analysis of dynamic Huffman codes'),
 (4421,'Multidimensional search trees that provide new types of memory reductions'),
 (4422,'A weighted voting algorithm for replicated directories'),
 (4423,'An O(log n) expected rounds randomized Byzantine generals protocol'),
 (4424,'Lower bounds on communication complexity in distributed computer networks'),
 (4425,'On the discrepancy of GFSR pseudorandom numbers'),
 (4426,'Parallel algorithms for minimum cuts and maximum flows in planar networks'),
 (4427,'A linear time algorithm for residue computation'),
 (4428,'Asympotic expansions of the sojourn time distributed functions of jobs'),
 (4429,'Monotone versus positive'),
 (4430,'Many-sorted unification'),
 (4431,'The complexity of searching a graph'),
 (4432,'Optimal design and use of rtetry in fault-tolerant computer systems'),
 (4433,'Equivalence and optimization in relational transactions'),
 (4434,'A theory of reliability in database systems'),
 (4435,'On conjunctive queries containing inequalities'),
 (4436,'External hashing with limited internal storage'),
 (4437,'Automating program analysis'),
 (4438,'A vertex-allocation theorem for resources in queuing networks'),
 (4439,'Greatest common divisors of polynomials given by straight-line programs'),
 (4440,'On the shortest path between two convex polyhedra'),
 (4441,'Consensus in the presence of partial synchrony'),
 (4442,'Church-Rosser Thue systems and formal languages'),
 (4443,'Efficient tests for top-down termination of logical rules'),
 (4444,'An O(n^2 (m+n log n) log n) min-cost flow algorithm'),
 (4445,'The time complexity of maximum matching by simulated annealing'),
 (4446,'The schematic protection model'),
 (4447,'Optimal directory placement on disk storage devices'),
 (4448,'Comparing the combinational complexities of arithmetic functions'),
 (4449,'On the complexity of branching programs and decision trees'),
 (4450,'Khachiyan\"s linear programming algorithm'),
 (4451,'An analysis of (h - k - 1)-shellsort'),
 (4452,'A parallel algorithm for constructing mninimum spanning trees'),
 (4453,'Combinatorial solutions of multidimensional divide-and-conquer recurrences'),
 (4454,'Subadditive lifting methods for partitioning and knapsack problems'),
 (4455,'Recognizing disguised NR(1) instances of the satisfiability problem'),
 (4456,'A combinatorial family of labeled trees'),
 (4457,'Sequence of operations analysis for dynamic data structures'),
 (4458,'Worst-case complexity bounds for algorithms'),
 (4459,'Average running time of the Fast Fourier transform'),
 (4460,'On selecting a random shifted Young tableau'),
 (4461,'Finding the contour of a union of iso-oriented rectangles'),
 (4462,'A linear algorithm for a core of a tree'),
 (4463,'Fast solution of Toeplitz systems of equations'),
 (4464,'Convolution of vectors over the real field of constants by evaluations'),
 (4465,'Decomposable searching problems. I. Static-to-dynamic transformation'),
 (4466,'The theory and computation of evolutionary distances: pattern recognition'),
 (4467,'Linear expected-time algorithms for connectivity problems'),
 (4468,'Searching and sorting real numbers'),
 (4469,'On vectorial addition chains'),
 (4470,'The complexity of identifying redundant and essential elements'),
 (4471,'An algorithm to determine when certain sets have 0-density'),
 (4472,'Exhaustive checking of sparse algebras'),
 (4473,'A new memoryless algorithm for De Bruijn sequences'),
 (4474,'Segments - rectangles - contours'),
 (4475,'The spanning bound as a measure of range query complexity'),
 (4476,'Finding the maximu - merging - and sorting in a parallel computation model'),
 (4477,'Fast canonization of circular strings'),
 (4478,'An O(n) algorithm to find a near-optimum partition of a convex polygon'),
 (4479,'A time/space tradeoff for in-place array permutation'),
 (4480,'The bit-complexity of arithmetic algorithms'),
 (4481,'A space-efficient on-line method of computing quantile estimates'),
 (4482,'Stacks in a two-level store'),
 (4483,'A linear algorithm for computing the visibility polygon from a point'),
 (4484,'A linear-time approximation algorithm for the weighted vertex cover problem'),
 (4485,'The uniform selection of free trees'),
 (4486,'A fast algorithm for testing for safety and detecting deadlocks'),
 (4487,'Generating coset representatives for permutation groups'),
 (4488,'Dynamization of order decomposable set problems'),
 (4489,'On systems of bilinear forms'),
 (4490,'The measure problem for rectangular ranges in d-space'),
 (4491,'A unified approach to the analysis of bilinear algorithms'),
 (4492,'The minimum-length generator sequence problem is NP-hard'),
 (4493,'A linear 5-coloring algorithm of planar graphs'),
 (4494,'A weighted matroid intersection algorithm'),
 (4495,'Finding intersection of rectangles by range search'),
 (4496,'A 5/4 algorithm for two-dimensional packing'),
 (4497,'On optimal trees'),
 (4498,'Irreducible polynomials with internal coefficients have succinct certificates'),
 (4499,'The NP-completeness column: an ongoing guide'),
 (4500,'Lower bounds for algebraic decision trees'),
 (4501,'On the average case complexity of \"bucketing\" algorithms'),
 (4502,'The Byzantine generals strike again'),
 (4503,'A nonquadratic monimal algorithm for a system of quadratic forms'),
 (4504,'A Gray code for compositions'),
 (4505,'A generalization of the fast LUP matrix decomposition algorithm'),
 (4506,'An O(log n) parallel connectivity algorithm'),
 (4507,'The complexity of partial match retrieval in a dynamic setting'),
 (4508,'Parallel complexity of sorting problems'),
 (4509,'The NP-completeness column: an ongoing guide'),
 (4510,'Refined analysis and improvements on some factoring algorithms'),
 (4511,'An O(n^2 log n) parallel MAX-FLOW algorithm'),
 (4512,'Minimal string difference encodings'),
 (4513,'Analysis of an algorithm for composition of binary quadratic forms'),
 (4514,'Rectilinear line segment intersection - layered segment trees -'),
 (4515,'The NP-completeness column: an ongoing guide'),
 (4516,'Identification of algebraic numbers'),
 (4517,'Robust linear algorithms for cutsets'),
 (4518,'An improved algorithm for the rectangle enclosure problem'),
 (4519,'Algorithmic extremal problems in combinatorial optimization'),
 (4520,'An O(n log n) unidirectional distributed algorithm'),
 (4521,'Deletion algorithms for hashing that preserve randomness'),
 (4522,'Fixed-bucket binary storage trees'),
 (4523,'The NP-completeness column: an ongoing guide'),
 (4524,'A two-dimensional bin-packing model of preemptive - FIFO storage allocation'),
 (4525,'A bijective proof of the hook-length formula'),
 (4526,'Complexity results for scheduling tasks with discrete starting times'),
 (4527,'The NP-completeness column: an ongoing guide'),
 (4528,'The additive and logical complexities'),
 (4529,'NP completeness of finding the chromatic index of regular graphs'),
 (4530,'Implementation of simultaneous memory address access in models that forbid it'),
 (4531,'Ranking and unranking of B-trees'),
 (4532,'Finding kth paths and p-centers'),
 (4533,'Minimal algorithms for bilinear forms may have divisions'),
 (4534,'The NP-completeness column: an ongoing guide'),
 (4535,'Shifting algorithms for tree partitioning with general weighting functions'),
 (4536,'Efficient algorithms for computing the maximum distance'),
 (4537,'Certain systems of bilinear forms whose minimal algorithms are all quadratic'),
 (4538,'On the generation of all topological sortings'),
 (4539,'Computing normalizers in permutation groups'),
 (4540,'The NP-completeness column: an ongoing guide'),
 (4541,'The random selection of unlabeled graphs'),
 (4542,'Random spanning tree'),
 (4543,'A formal account of some elementary continued fraction algorithms'),
 (4544,'Multiterminal flows in outerplanar networks'),
 (4545,'An O(n log n) algorithm for the Josephus problem'),
 (4546,'An algorithm for parallel evaluation of functions'),
 (4547,'On the minimum number of additions required to compute a quadratic form'),
 (4548,'The NP-completeness column: an ongoing guide'),
 (4549,'The complexity of finding generalized paths in tournaments'),
 (4550,'Finding the connected components and a maximum clique'),
 (4551,'Finding the convex hull of a simple polygon'),
 (4552,'Fast compact prime number sieves (among others)'),
 (4553,'On finding the core of a tree with a specified length'),
 (4554,'Nearly on-line scheduling of multiprocessor systems with memories'),
 (4951,'Classes of discrete optimization problems and their decision problems'),
 (4952,'Theories of automata on omega-tapes: a simplified approach'),
 (4953,'A geometric hierarchy of languages'),
 (4954,'On vector languages'),
 (4955,'Deterministic multitape automata computations'),
 (4956,'Predecessor machines'),
 (4957,'Solution of eigenvalue problems in Hilbert spaces'),
 (4958,'Comment on the paper \"Error detection in formal languages\"'),
 (4959,'The equivalence of stack counter acceptors'),
 (4960,'Fast algorithms for bin packing'),
 (4961,'Reversal-bounded multipushdown machines'),
 (4962,'On homomorphisms - correctness - termination - unfoldments -'),
 (4963,'Fast modular transforms'),
 (4964,'Translatability of schemas over restricted interpretations'),
 (4965,'A generalized approach to formal languages'),
 (4966,'Multiple-entry finite automata'),
 (4967,'Algorithm model for penalty functions-type iterative procedures'),
 (4968,'Completeness problem of'),
 (4969,'Difunctionally induced state machines'),
 (4970,'Cyclic decomposition of finite stochastic systems'),
 (4971,'On incomparable abstract family of languages (AFL)'),
 (4972,'Congruence arithmetic algorithms'),
 (4973,'Linear dynamical systems over integral domains'),
 (4974,'Approximations to the halting problem'),
 (4975,'The extent and density of sequences'),
 (4976,'1-way stack automaton with jumps'),
 (4977,'Translatability of flowcharts into while programs'),
 (4978,'Minimum times and memories needed to compute the values of a function'),
 (4979,'Comparing complexity classes'),
 (4980,'Analysis of structured programs'),
 (4981,'Approximation algorithms for combinatorial problems'),
 (4982,'Attributed translations'),
 (4983,'An observation on time-storage trade off'),
 (4984,'Fast on-line integer multiplication'),
 (4985,'Correct and optimal implementations of recursion'),
 (4986,'Testing flow graph reducibility'),
 (4987,'Discrete-time machines in closed monoidal categories I'),
 (4988,'Effective proper procedures and universal classes of program schemata'),
 (4989,'On tape-bounded complexity classes and multihead finite automata'),
 (4990,'Some clarifications of the concept of a Garden-of-Eden configuration'),
 (4991,'Splitting a context-sensitive set'),
 (4992,'Two-way A-transducers and AFL'),
 (4993,'Proving assertions about parallel programs'),
 (4994,'Tree adjunct grammars'),
 (4995,'Uniformly erasable AFL'),
 (4996,'On the density of honest subrecursive classes'),
 (4997,'The decidability of a mapping problem'),
 (4998,'Various kinds of automata with weights'),
 (4999,'One counter languages and the IRS condition'),
 (5000,'Reproduction in tessalation structures'),
 (4819,'Equivalences on program schemes'),
 (4820,'On formalised computer programs'),
 (4821,'Remarks on the approximation of some nonlinear elliptic equations'),
 (4822,'General properties of star height of regular events'),
 (4823,'Star height of regular events'),
 (4824,'A characterization of semilinear sets'),
 (4825,'Principal AFL'),
 (4826,'Generalized sequential machine maps'),
 (4827,'What makes some language theory problems undecidable'),
 (4828,'On the stability of linear recurrence equations'),
 (4829,'Error detection in formal languages'),
 (4830,'Acceptors and some of their applications'),
 (4831,'On the structure of subrecursive degrees'),
 (4832,'Recursive function theory and numerical analysis'),
 (4833,'Invariant imbedding - difference equations -'),
 (4834,'An hierarchy between context-free and context-sensitive languages'),
 (4835,'Uniform rational approximation with osculatory interpolation'),
 (4836,'A characterization of two-way deterministic classes of languages'),
 (4837,'Algebraic structures in linear systems theory'),
 (4838,'An application of the epsilon technique'),
 (4839,'Cutting plane algorithms and state space constrained'),
 (4840,'Time- and tape-bounded Turing acceptors and AFLs'),
 (4841,'Tape-bounded Turing acceptors and principal AFLs'),
 (4842,'Dot-depth of star-free events'),
 (4843,'The concept of effective method'),
 (4844,'Realizations by stochastic finite automata'),
 (4845,'Classification of non-counting events'),
 (4846,'The use of lists in the study'),
 (4847,'Algorithmic approximations'),
 (4848,'On the isolation of the roots of a non-linear operator'),
 (4849,'Characterization of some tape and time complexity classes'),
 (4850,'Abstract computational complexity and cycling computations'),
 (4851,'Extensions of asynchronous circuits and the delay problem'),
 (4852,'A computational approach to the maximum principle'),
 (4853,'Data graphs and addressing schemes'),
 (4854,'Mathematical theory of partial correctness'),
 (4855,'Translating recursion equations into flow charts'),
 (4856,'The enumerability and invariance of complexity classes'),
 (4857,'Three theorems concerning principal AFLs'),
 (4858,'Subrecursive programming languages II. on program size'),
 (4859,'Unilateral context sensitive grammars and left-to-right parsing'),
 (4860,'A characterization of context-free languages'),
 (4861,'AFL with the semilinear property'),
 (4862,'Time-bounded grammars and their languages'),
 (4863,'Minimum error bounds for multidimensional spline approximation'),
 (4864,'Tessalation structures for reproduction of arbitrary patterns'),
 (4865,'Operation-preserving functions and autonomous factors'),
 (4866,'Towards a theory of data structures'),
 (4867,'Every finite sequential machine is linearly realizable'),
 (4868,'Marked directed graphs'),
 (4869,'Algebraic theory of finite Fourier transforms'),
 (4870,'Finite-turn checking automata'),
 (4871,'Pair grammars - graph languages and string-to-graph translations'),
 (4872,'Abstract families of relations'),
 (4873,'On fully indecomposable matrices'),
 (4874,'Pattern reproduction in tessalation automata of arbitrary dimension'),
 (4875,'Substitution expressions'),
 (4876,'Computation of powers of multivariate polynomials over the integers'),
 (4877,'Substitution and bounded languages'),
 (4878,'Syntactic operators on full semiAFLs'),
 (4879,'Effective operators with no strong gaps'),
 (4880,'On program schemata equivalence'),
 (4881,'A phenomenon in the theory of sorting'),
 (4882,'Tape bounds for time-bounded Turing machines'),
 (4883,'Equivalence of programs with structured variables'),
 (4884,'Pushdown automata with counters'),
 (4885,'Locally testable languages'),
 (4886,'Writing stack acceptors'),
 (4887,'Complete linear proofs of linear inequalities'),
 (4888,'A homomorphism theorem for weighted context-free grammars'),
 (4889,'Real-time language recognition by one-dimensional cellular automata'),
 (4890,'Combinatorial systems I. cylindrical problems'),
 (4891,'The relation between derivations and syntactical structures'),
 (4892,'Les 1-convexes du monoide commutatif N^n'),
 (4893,'The equivalence of several initial value methods'),
 (4894,'Tchebycheff approximation for multivariate splines'),
 (4895,'An interpretation-oriented theorem prover over integers'),
 (4896,'Absolutely parallel grammars and two-way finite state transducers'),
 (4897,'The Riccati equation and its bounds'),
 (4898,'A general approach to one-step iterative methods'),
 (4899,'Tessalation with local transformations'),
 (4900,'Degrees of computational complexity'),
 (4901,'Continuously valued logic'),
 (4902,'A generalization of the theory of incompletely specified machines'),
 (4903,'Decision procedures for surjectivity and injectivity'),
 (4904,'The Markov algorithm as a language parser-linear bounds'),
 (4905,'Subrecursive program schemata I and II'),
 (4906,'Generalized overlap resolvable grammars and their parsers'),
 (4907,'Optimization of LR(k) parsers'),
 (4908,'Augmented loop languages and classes of computable functions'),
 (4909,'Efficient evaluation of polynomial forms'),
 (4910,'Proving simultaneous positivity of linear forms'),
 (4911,'On AFL generators for finitely encoded AFA'),
 (4912,'On two-way multihead automata'),
 (4913,'Web grammars and several graphs'),
 (4914,'LR-regular grammars - and extension of LR(k) grammars'),
 (4915,'Algorithms for producing grammars from sample derivations'),
 (4916,'Program schemes - recursion schemes - and formal languages'),
 (4917,'Every discrete input machine is linearly simulatable'),
 (4918,'Group theoretic characterization of linear permutation automata'),
 (4919,'Optimal algorithms for parallel polynomial polynomial evaluation'),
 (4920,'On the extension of Gladkij\"s theorem'),
 (4921,'Strict deterministic grammars'),
 (4922,'Coproducts and decomposable machines'),
 (4923,'Establishing certain bounds concerning finite automata'),
 (4924,'A structure theory of automata characterized by groups'),
 (4925,'Approximate solutions and error bounds'),
 (4926,'A V log V algorithm for isomorphism of triconnected planar graphs'),
 (4927,'A bound on the multiplicative efficiency of iteration'),
 (4928,'A hierarchy for nondeterministic time complexity'),
 (4929,'Time bounded random access machines'),
 (4930,'Process complexity and effective random tests'),
 (4931,'Maze recognizing automata and nondeterministic tape complexity'),
 (4932,'Characterizations of flowchartable recursions'),
 (4933,'Time bounds for selection'),
 (4934,'The unsolvability of the equality problem'),
 (4935,'The efficient calculation of powers of polynomials'),
 (4936,'The constructibility of a configuration in a cellular automaton'),
 (4937,'Many-one degrees associated with semi-Thue systems'),
 (4938,'Distributions of queue lengths and waiting times'),
 (4939,'State assignments for realizing'),
 (4940,'Program schemata as automata I'),
 (4941,'A characterization theorem for n-parallel right linear languages'),
 (4942,'Two iteration theorems for some families of languages'),
 (4943,'Conversion of programs between computers'),
 (4944,'Two entropies of a generalized sorting problem'),
 (4945,'Left-derivation bounded languages'),
 (4946,'Ambiguity and decision problems for local adjunct languages'),
 (4947,'On transformations of programs'),
 (4948,'Structure des grammaires d\"ambiguite bornee'),
 (4949,'On periodicity of sequential machines'),
 (4950,'Program schemata and the first-order decision problem');
/*!40000 ALTER TABLE `paper` ENABLE KEYS */;




/*!40101 SET SQL_MODE=@OLD_SQL_MODE */;
/*!40014 SET FOREIGN_KEY_CHECKS=@OLD_FOREIGN_KEY_CHECKS */;
/*!40014 SET UNIQUE_CHECKS=@OLD_UNIQUE_CHECKS */;
/*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */;
/*!40101 SET CHARACTER_SET_RESULTS=@OLD_CHARACTER_SET_RESULTS */;
/*!40101 SET COLLATION_CONNECTION=@OLD_COLLATION_CONNECTION */;
/*!40101 SET CHARACTER_SET_CLIENT=@OLD_CHARACTER_SET_CLIENT */;